A Rational Deconstruction of Landin’s J Operator

A Rational Deconstruction of Landin’s J Operator (2006)

Cached

Download Links

by Olivier Danvy , Kevin Millikin

Citations:

BibTeX

@MISC{Danvy06arational,
    author = {Olivier Danvy and Kevin Millikin},
    title = { A Rational Deconstruction of Landin’s J Operator },
    year = {2006}
}

Bookmark

OpenURL

Abstract

Citations

433	Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory - Stoy - 1977
299	The mechanical evaluation of expressions - Landin - 1964
272	Computational interpretations of linear logic - Abramsky - 1993
270	Λµ-calculus: an algorithmic interpretation of classical natural deduction - Parigot - 1992
263	Definitional interpreters for higher-order programming languages - Reynolds - 1972
206	A formulae-as-types notion of control - Griffin - 1990
174	Call-by-name, call-by-value and the λ-calculus - Plotkin - 1976
164	The next 700 programming languages - Landin - 1966
160	Partial Evaluation of Computation Process - an Approach to a Compiler-Compiler. Systems - Futamura - 1971
146	Fundamental concepts in programming languages - Strachey - 2000
117	A correspondence between ALGOL 60 and Church's lambda notation - Landin - 1965
116	Representing monads - Filinski - 1994
111	Functional Programming - Field, Harrison - 1988
103	Recursive Programming Techniques - Burge - 1975
101	Danvy and Andrzej Filinski. Representing control, a study of the CPS transformation - Olivier - 1992
101	The discoveries of continuations - Reynolds - 1993
97	C.P.: Continuations: A mathematical semantics for handling full jumps - Strachey, Wadsworth - 1974
91	RABBIT: a compiler for SCHEME - JR, L - 1978
70	D.P.: Control operators, the SECD machine and the λcalculus - Felleisen, Friedman - 1986
59	Defunctionalization at work - Danvy, Nielsen - 2001
55	An abstract framework for environment machines - Curien - 1991
53	Proper tail recursion and space efficiency - Clinger - 1998
53	From operational semantics to abstract machines - Hannan, Miller - 1992
52	A functional correspondence between evaluators and abstract machines - Ager, Biernacki, et al. - 2003
49	Danvy and Andrzej Filinski. Abstracting control - Olivier - 1990
48	Back to direct style II: First-class continuations - Danvy, Lawall - 1992
48	Analysis and efficient implementation of functional programs - Sestoft - 1991
39	An Introduction to Functional Programming Systems Using Haskell - Davie - 1992
38	The Calculi of λ-v-CS Conversion: A Syntactic Theory of Control and State in Imperative Higher-Order Programming Languages - Felleisen - 1987
35	Intensions and extensions in a reflective tower - Danvy, Malmkjær
34	A functional correspondence between monadic evaluators and abstract machines for languages with computational effects - Ager, Danvy, et al. - 2005
32	A functional correspondence between callby-need evaluators and lazy abstract machines - Ager, Danvy, et al. - 2004
31	The functional abstract machine - Cardelli - 1983
31	A scheme for a higher-level semantic algebra - Clinger, Friedman, et al. - 1985
23	A rational deconstruction of Landin’s SECD machine - Danvy - 2003
22	Constraining control - Friedman, Haynes - 1985
22	Functional runtime systems within the lambda-sigma calculus - Hardin, Maranget, et al. - 1998
21	Control operators, hierarchies, and pseudo-classical type systems: A-translation at work - Murthy - 1992
20	Definitional interpreters revisited - Reynolds - 1998
20	Shift to control - Shan - 2004
17	An operational foundation for delimited continuations in the CPS hierarchy - Biernacka, Biernacki, et al. - 2005
17	Essentials of Programming Languages, second edition - Friedman, Wand, et al. - 2001
16	Parallelism in sequential functional languages - Blelloch, Greiner - 1995
16	Adapting combinator and SECD machines to display snapshots of functional computations - Runciman, Toyn - 1986
15	Comparing control constructs by double-barrelled CPS - Thielecke
14	An Analytical Approach to Program as Data Objects. DSc thesis - Danvy - 2006
14	How to remove a dynamic prompt: Static and dynamic delimited continuation operators are equally expressible - Kiselyov - 2005
13	A simple proof of a folklore theorem about delimited control - Biernacki, Danvy
13	On the transformation between direct and continuation semantics - Danvy, Hatcliff - 1993
13	The next 700 formal language descriptions - Morris - 1993