A functional correspondence between monadic evaluators and abstract machines for languages with computational effects
- 6 September 2005
- journal article
- Published by Elsevier BV in Theoretical Computer Science
- Vol. 342 (1), 149-172
- https://doi.org/10.1016/j.tcs.2005.06.008
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- A functional correspondence between call-by-need evaluators and lazy abstract machinesInformation Processing Letters, 2004
- Stack inspectionACM Transactions on Programming Languages and Systems, 2003
- A Tail-Recursive Semantics for Stack InspectionsLecture Notes in Computer Science, 2003
- SAFKASIACM Transactions on Software Engineering and Methodology, 2000
- Abstract machines for programming language implementationFuture Generation Computer Systems, 2000
- Representing Control: a Study of the CPS TransformationMathematical Structures in Computer Science, 1992
- Notions of computation and monadsInformation and Computation, 1991
- Lambda lifting: Transforming programs to recursive equationsLecture Notes in Computer Science, 1985
- Call-by-name, call-by-value and the λ-calculusTheoretical Computer Science, 1975
- The Mechanical Evaluation of ExpressionsThe Computer Journal, 1964