A Formulae-as-Types Notion of Control (1990)

Cached

Download Links

by Timothy G. Griffin
Venue:In Conference Record of the Seventeenth Annual ACM Symposium on Principles of Programming Languages
Citations:238 - 0 self

Documents Related by Co-Citation

328 An algorithmic interpretation of classical natural deduction – M Parigot - 1992
116 A syntactic theory of sequential control – M Felleisen, D P Friedman, E Kohlbecker, B Duba - 1987
300 Definitional interpreters for higher-order programming languages – John C. Reynolds - 1972
44 Classical logic, storage operators and second-order lambda-calculus – J-L Krivine - 1994
65 Extracting constructive content from classical proofs – C R Murthy - 1990
1565 The Definition of Standard ML – Robin Milner, Mads Tofte - 1990
150 The theory and practice of first-class prompts – M Felleisen - 1988
93 Typing First-Class Continuations in ML – Robert Harper, Bruce F. Duba, David Macqueen - 1992
164 A new constructive logic: Classical logic – J-Y Girard - 1991
333 The mechanical evaluation of expressions – P J Landin - 1964
59 Reasoning with continuations – Matthias Felleisen, Daniel P Friedman, Eugene Kohlbecker, Bruce Duba - 1986
255 The Revised Report on the Syntactic Theories of Sequential Control and State – Matthias Felleisen, Matthias Felleisen, Robert Hieb, Robert Hieb - 1992
32 Extracting constructive content from classical logic via control-like reductions – Franco Barbanera, Stefano Berardi - 1993
220 Call-by-name, call-by-value and the -calculus – G D Plotkin - 1975
161 Reasoning about Programs in Continuation-Passing Style – Amr Sabry Sabry, Matthias Felleisen
68 Continuation Semantics in Typed Lambda-Calculi – Albert R. Meyer, Mitchell Wand - 1985
171 Call-by-name, call-by-value, and the lambda calculus – Gordon Plotkin - 1975
102 A New Deconstructive Logic: Linear Logic – Vincent Danos, Jean-Baptiste Joinet, Harold Schellinx - 1995
35 Polymorphic type assignment and CPS conversion – Robert Harper, Mark Lillibridge - 1993