Lambda the Ultimate

inactiveTopic Algorithmic complexity of evaluation: lazy, eager, pure and impure
started 1/21/2004; 8:40:49 AM - last post 1/21/2004; 11:12:47 AM
Patrick Logan - Algorithmic complexity of evaluation: lazy, eager, pure and impure  blueArrow
1/21/2004; 8:40:49 AM (reads: 8620, responses: 2)
Algorithmic complexity of evaluation: lazy, eager, pure and impure
This is a pointer to an item in the discussion list from Jim Apple.

This links to papers showing that lazy evaluation is sometime strictly faster than eager evaluation without assignment, and this shows that eager evaluation with assignment is sometimes strictly faster than eager evaluation without assignment. Are there any languages out there without lazy evaluation and without assignment?
Posted to functional by Patrick Logan on 1/21/04; 8:41:53 AM

Patrick Logan - Re: Algorithmic complexity of evaluation: lazy, eager, pure and impure  blueArrow
1/21/2004; 8:43:15 AM (reads: 303, responses: 0)
Another famous one would be Backus' FP.

In fact there's a paper on the very topic of eager/lazy from SIGPLAN Notices back in the old days. 8^)

Ehud Lamm - Re: Algorithmic complexity of evaluation: lazy, eager, pure and impure  blueArrow
1/21/2004; 11:12:47 AM (reads: 275, responses: 0)
More related papers are listed here.