Article View: comp.lang.misc
Article #6802Re: Breaking loops (Re: Anyone want to design a language?)
From: Chris Dollin
Date: Fri, 23 Feb 1990 15:09
Date: Fri, 23 Feb 1990 15:09
18 lines
1177 bytes
1177 bytes
Jim Giles writes:
I) Recursive data types.
...
(Functional languages usually don't allow cyclic data structures.)
Any such functional languages are brain-dead. The non-strict (often sloppily
[and I'm no exception!] referred to as "lazy") languages permit circular
structures as in eg
let rec ones = cons( 1, ones )
[The syntax, of course, varies]. The strict languages (such as ML and Scheme,
if we permit them to enjoy the adjective "functional") contain assignments
which permits the construction of circular structures.
Regards, "But I program in Pop-11 whenever I can" Kers.
Technical Details
Message-ID:
<KERS.90Feb23100957@cdollin.hpl.hp.com>Path:
arc1-ca.pugleaf.net!utzoo!utgpu!jarvis.csri.toronto.edu!rutgers!usc!ucsd!ucbvax!hplabs!otter!hplb!cdollin!kersReferences:
<390@argosy.UUCP> <14245@lambda.UUCP>Show Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!utzoo!utgpu!jarvis.csri.toronto.edu!rutgers!usc!ucsd!ucbvax!hplabs!otter!hplb!cdollin!kers From: kers@hplb.hpl.hp.com (Chris Dollin) Newsgroups: comp.lang.misc Subject: Re: Breaking loops (Re: Anyone want to design a language?) Message-ID: <KERS.90Feb23100957@cdollin.hpl.hp.com> Date: 23 Feb 90 15:09:57 GMT References: <390@argosy.UUCP> <14245@lambda.UUCP> Sender: news@hplb.hpl.hp.com Distribution: usa Organization: Hewlett-Packard Laboratories, Bristol, UK. Lines: 18 In-reply-to: jlg@lambda.UUCP's message of 22 Feb 90 22:08:30 GMT