Fold-Unfold Transformations On State Monadic Interpreters (1994)

Cached

Download Links

by Thomas Johnsson
Venue:In Proceedings of the Glasgow Functional Programming Workshop, Ayr 1994, Workshops in Computing
Citations:5 - 1 self

Documents Related by Co-Citation

333 The mechanical evaluation of expressions – P J Landin - 1964
124 M.: The categorical abstract machine – G Cousineau, P L Curien, Mauny - 1987
300 Definitional interpreters for higher-order programming languages – John C. Reynolds - 1972
65 A functional correspondence between evaluators and abstract machines – Mads Sig Ager, Dariusz Biernacki, Olivier Danvy, Jan Midtgaard - 2003
67 Deriving a Lazy Abstract Machine – Peter Sestoft - 1997
59 From operational semantics to abstract machines – John Hannan, Dale Miller - 1992
29 ALGOL 60 Implementation – B Randell, L J Russell - 1964
23 Functional runtime systems within the lambda–sigma calculus – T Hardin, L Maranget, B Pagano - 1998
44 TIM: a simple, lazy abstract machine to execute supercombinators – J Fairbairn, S Wray - 1987
14 On the Transformation between Direct and Continuation Semantics – Olivier Danvy, John Hatcliff - 1993
21 An abstract machine for lambda-terms normalization, in: M. Wand (Ed – P Crégut - 1990
1312 Monads for functional programming – Philip Wadler - 1995
87 A lazy evaluator – P Henderson, J James H Morris - 1976
21 Thunks and the λ-calculus – John Hatcliff, Olivier Danvy - 1997
13 The semantics of lazy functional languages – M B Josephs - 1989
49 Analysis and Efficient Implementation of Functional Programs – Peter Sestoft - 1991
93 The ZINC experiment, an economical implementation of the ML language – Xavier Leroy - 1990
10 Un interprète du λ-calcul. Brouillon. Available online at http://www.pps.jussieu.fr/ ∼ krivine – J-L Krivine - 1985
605 The Definition of Standard ML (Revised – Robin Milner, Mads Tofte, Robert Harper, David Macqueen - 1997