Tail recursion in REBOL
Edit Page
Report
Scan day: 03 March 2014 UTC
55
Virus safety - good
Description: Proper tail recursion is unusually difficult to achieve in REBOL. Joe Marshall describes the problem and solution. From LL1: Lightweight Languages Workshop.
(November 17, 2001)
REBOL 1.0 is properly tail recursive. Proper tail recursion is usually easy to achieve in most languages, but in REBOL it surprisingly difficult. Here is a short description of the problem and solution.
Size: 202 chars
Contact Information
Email: —
Phone&Fax: —
Address: —
Extended: —
WEBSITE Info
| Page title: | Joe Marshall on Rebol 1.0 |
| Keywords: | |
| Description: | |
| IP-address: | 128.30.2.140 |
WHOIS Info
| NS | Name Servers: USE2.AKAM.NET USE5.AKAM.NET |
| WHOIS | |
| Date | activated: 23-May-1985 last updated: 17-May-2013 expires: 31-Jul-2014 |