𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Call-by-name, call-by-value, call-by-need and the linear lambda calculus

✍ Scribed by J. Maraist; M. Odersky; D.N. Turner; P. Wadler


Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
206 KB
Volume
228
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


System T, call-by-value and the minimum
✍ LoΓ―c Colson; Daniel Fredholm πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 855 KB

It is shown that for Giidels system T, evaluated call-by-value, if an algorithm computes a non-trivial binary function (where trivial means constant or projection plus constant), then the time-complexity is at least linear in one of the inputs. This is in contrast to the call-by-name case. As a coro