Call-by-name, Call-by-value, Call-by-need, and the Linear Lambda Calculus
Open Access
- 31 December 1995
- journal article
- Published by Elsevier in Electronic Notes in Theoretical Computer Science
- Vol. 1, 370-392
- https://doi.org/10.1016/s1571-0661(04)00022-2
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Call-by-name, Call-by-value, Call-by-need, and the Linear Lambda CalculusElectronic Notes in Theoretical Computer Science, 1995
- What is a categorical model of Intuitionistic Linear Logic?Published by Springer Nature ,1995
- Semantics of weakening and contractionAnnals of Pure and Applied Logic, 1994
- Reasoning about programs in continuation-passing styleHigher-Order and Symbolic Computation, 1993
- The discoveries of continuationsHigher-Order and Symbolic Computation, 1993
- Computational interpretations of linear logicTheoretical Computer Science, 1993
- A term calculus for Intuitionistic Linear LogicPublished by Springer Nature ,1993
- The linear abstract machineTheoretical Computer Science, 1988
- Linear logicTheoretical Computer Science, 1987
- Call-by-name, call-by-value and the λ-calculusTheoretical Computer Science, 1975