Linear Continuations (1992)

Cached

Download Links

by Andrzej Filinski
Venue:In Nineteenth ACM Symposium on Principles of Programming Languages
Citations:30 - 1 self

Documents Related by Co-Citation

625 Compiling With Continuations – A W Appel - 1992
280 Computational Interpretations of Linear Logic – Samson Abramsky - 1993
94 Abstracting Control – Olivier Danvy, Andrzej Filinski - 1990
119 Respresentations of categories – M Barr - 1986
328 An algorithmic interpretation of classical natural deduction – M Parigot - 1992
439 Computational Lambda-Calculus and Monads – Eugenio Moggi - 1988
103 Linear Logic, -Autonomous Categories and Cofree Coalgebras – R.A.G. Seely - 1989
134 Linear Types Can Change the World! – Philip Wadler - 1990
161 Reasoning about Programs in Continuation-Passing Style – Amr Sabry Sabry, Matthias Felleisen
300 Definitional interpreters for higher-order programming languages – John C. Reynolds - 1972
12 Properties of Terms in Continuation-Passing Style in an Ordered Logical Framework – Jeff Polakow, Frank Pfenning - 2000
220 Call-by-name, call-by-value and the -calculus – G D Plotkin - 1975
269 The Essence of Compiling with Continuations – Cormac Flanagan, Amr Sabry, Bruce F. Duba, Matthias Felleisen - 1993
150 The theory and practice of first-class prompts – M Felleisen - 1988
240 A Formulae-as-Types Notion of Control – Timothy G. Griffin - 1990
65 Extracting constructive content from classical proofs – C R Murthy - 1990
46 Representing Control in the Presence of One-Shot Continuations – Carl Bruggeman, Oscar Waddell, R. Kent Dybvig - 1996
99 What is a Categorical Model of Intuitionistic Linear Logic? – G.M. Bierman, A \gamma A, Gamma \delta \gamma C, Gamma I \gamma A, Gamma A B \gamma C, B \gamma C - 1995
87 Autonomous Categories and Linear Logic – M Barr - 1991