Lambda-Calculus Schemata (1993)

Cached

Download Links

by Michael J. Fischer
Citations:100 - 1 self

Documents Related by Co-Citation

300 Definitional interpreters for higher-order programming languages – John C. Reynolds - 1972
625 Compiling With Continuations – A W Appel - 1992
161 Reasoning about Programs in Continuation-Passing Style – Amr Sabry Sabry, Matthias Felleisen
220 Call-by-name, call-by-value and the -calculus – G D Plotkin - 1975
90 Abstract Models of Memory Management – Greg Morrisett, Matthias Felleisen, Robert Harper - 1995
46 On the relation between direct and continuation semantics – J C Reynolds - 1974
68 Continuation Semantics in Typed Lambda-Calculi – Albert R. Meyer, Mitchell Wand - 1985
269 The Essence of Compiling with Continuations – Cormac Flanagan, Amr Sabry, Bruce F. Duba, Matthias Felleisen - 1993
42 Semantics of memory management for polymorphic languages – Greg Morrisett, Robert Harper - 1997
730 Notions of Computation and Monads – Eugenio Moggi - 1991
157 Revised report on the algorithmic language Scheme – W Clinger, J Rees - 1991
538 A Syntactic Approach to Type Soundness – Andrew K. Wright, Matthias Felleisen - 1992
83 Control operators, the SECD machine and the -calculus – M Felleisen, D P Friedman - 1986
59 Reasoning with continuations – Matthias Felleisen, Daniel P Friedman, Eugene Kohlbecker, Bruce Duba - 1986
116 A syntactic theory of sequential control – M Felleisen, D P Friedman, E Kohlbecker, B Duba - 1987
180 The next 700 programming languages – P J Landin - 1966
22 Thunks: a way of compiling procedure statements with some comments on procedure declarations – P Z Ingerman - 1961
46 A model and stack implementation of multiple environments – D G Bobrow, B Wegbreit - 1973
128 Rabbit: A compiler for Scheme – Guy L Steele - 1978