Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!wuarchive!usc!snorkelwacker.mit.edu!bloom-beacon!eru!kth.se!sunic!mcsun!ukc!edcastle!cs.ed.ac.uk!db
From: db@cs.ed.ac.uk (Dave Berry)
Newsgroups: comp.lang.functional
Subject: Re: Applications for lazy functional languages
Keywords: strict
Message-ID: <8413@skye.cs.ed.ac.uk>
Date: 29 Mar 91 14:11:17 GMT
References: <ACHA.91Mar21112142@DRAVIDO.CS.CMU.EDU> <4682@osc.COM>
Sender: nnews@cs.ed.ac.uk
Reply-To: db@lfcs.ed.ac.uk (Dave Berry)
Distribution: comp
Organization: Laboratory for the Foundations of Computer Science, Edinburgh U
Lines: 11

In article <4682@osc.COM> jgk@osc.COM (Joe Keane) writes:
>
>conceptually at least, we only need lazy functions.  Lambda calculus and
>combinators both work this way; they have no strict functions.

There is no intrinsic order of evaluation in the lambda calculus.

--
 Dave Berry, LFCS, Edinburgh Uni.      db%lfcs.ed.ac.uk@nsfnet-relay.ac.uk

  "So they gave him a general anaesthetic and cleaned him with Swarfega."