-
1
-
-
1142294722
-
Standard ML of New Jersey
-
Passau, Germany
-
Andrew W. Appel and David B. MacQueen. Standard ML of New Jersey. In Third International Symposium on Programming Language Implementation and Logic Programming, number 528 in Lecture Notes in Computer Science, pages 1- 13, Passau, Germany, August 1991.
-
(1991)
Third International Symposium on Programming Language Implementation and Logic Programming, Number 528 in Lecture Notes in Computer Science
, Issue.August
-
-
Appel, A.W.1
Macqueen, D.B.2
-
4
-
-
0033358705
-
Implementation strategies for first-class continuations
-
William Clinger, Anne H. Hartheimer, and Eric M. Ost. Implementation strategies for first-class continuations. Higher-Order and Symbolic Computation, 12(1):7-45, 1999.
-
(1999)
Higher-Order and Symbolic Computation
, vol.12
, Issue.1
, pp. 7-45
-
-
Clinger, W.1
Hartheimer, A.H.2
Ost, E.M.3
-
5
-
-
84976728532
-
Memory allocation and higher-order functions
-
Saint-Paul, Minnesota, June
-
Olivier Danvy. Memory allocation and higher-order functions. In Proceedings of the ACM SIGPLAN'87 Symposium on Interpreters and Interpretive Techniques, SIGPLAN Notices, Vol. 22, No 7, pages 241-252, Saint-Paul, Minnesota, June 1987.
-
(1987)
Proceedings of the ACM SIGPLAN'87 Symposium on Interpreters and Interpretive Techniques, SIGPLAN Notices
, vol.22
, Issue.7
, pp. 241-252
-
-
Danvy, O.1
-
6
-
-
19044381168
-
On proving syntactic pro- perties of CPS programs
-
Paris, France, September
-
Olivier Danvy, Belmina Dzafic, and Frank Pfenning. On proving syntactic pro- perties of CPS programs. In Third International Workshop on Higher-Order Ope- rational Techniques in Semantics, volume 26 of Electronic Notes in Theoretical Computer Science, pages 19-31, Paris, France, September 1999.
-
(1999)
Third International Workshop on Higher-Order Ope- Rational Techniques in Semantics, Volume 26 of Electronic Notes in Theoretical Computer Science
, pp. 19-31
-
-
Danvy, O.1
DzafiC, B.2
Pfenning, F.3
-
7
-
-
84972048107
-
Representing control, a study of the CPS transformation
-
Olivier Danvy and Andrzej Filinski. Representing control, a study of the CPS transformation. Mathematical Structures in Computer Science, 2(4):361-391, 1992.
-
(1992)
Mathematical Structures in Computer Science
, vol.2
, Issue.4
, pp. 361-391
-
-
Danvy, O.1
Filinski, A.2
-
8
-
-
0026961055
-
Back to direct style II: First-class continuations
-
San Francisco, California, June
-
Olivier Danvy and Julia L. Lawall. Back to direct style II: First-class continuations. In Proceedings of the 1992 ACM Conference on Lisp and Functional Programming, LISP Pointers, Vol. 5, No. 1, pages 299-310, San Francisco, California, June 1992.
-
(1992)
Proceedings of the 1992 ACM Conference on Lisp and Functional Programming, LISP Pointers
, vol.5
, Issue.1
, pp. 299-310
-
-
Danvy, O.1
Lawall, J.L.2
-
9
-
-
0013157199
-
The occurrence of continuation parameters in CPS terms
-
Pittsburgh, Pennsylvania, February
-
Olivier Danvy and Frank Pfenning. The occurrence of continuation parameters in CPS terms. Technical report CMU-CS-95-121, School of Computer Science, Carnegie Mellon University, Pittsburgh, Pennsylvania, February 1995.
-
(1995)
Technical Report CMU-CS-95-121, School of Computer Science, Carnegie Mellon University
-
-
Danvy, O.1
Pfenning, F.2
-
10
-
-
80052798092
-
Typing first-class con- tinuations in ML
-
Orlando, Florida
-
Bruce F. Duba, Robert Harper, and David B. MacQueen. Typing first-class con- tinuations in ML. In Proceedings of the Eighteenth Annual ACM Symposium on Principles of Programming Languages, pages 163-173, Orlando, Florida, January 1991.
-
(1991)
Proceedings of the Eighteenth Annual ACM Symposium on Principles of Programming Languages
, vol.January
, pp. 163-173
-
-
Duba, B.F.1
Harper, R.2
Macqueen, D.B.3
-
11
-
-
0142221566
-
Formalizing program transformations
-
Master's thesis, Denmark, De- cember
-
Belmina Dzafic. Formalizing program transformations. Master's thesis, DAIMI, Department of Computer Science, University of Aarhus, Aarhus, Denmark, De- cember 1998.
-
(1998)
DAIMI, Department of Computer Science, University of Aarhus, Aarhus
-
-
Dzafic, B.1
-
12
-
-
0003882245
-
The Calculi of _-v-CS Conversion: A Syntactic Theory of Con- trol and State in Imperative Higher-Order Programming Languages
-
PhD thesis, Indiana, Au- gust
-
Matthias Felleisen. The Calculi of _-v-CS Conversion: A Syntactic Theory of Con- trol and State in Imperative Higher-Order Programming Languages. PhD thesis, Department of Computer Science, Indiana University, Bloomington, Indiana, Au- gust 1987.
-
(1987)
Department of Computer Science, Indiana University, Bloomington
-
-
Felleisen, M.1
-
13
-
-
0027805209
-
The essence of compiling with continuations
-
Albuquerque, New Mexico, June
-
Cormac Flanagan, Amr Sabry, Bruce F. Duba, and Matthias Felleisen. The essence of compiling with continuations. In Proceedings of the ACM SIGPLAN'93 Confe- rence on Programming Languages Design and Implementation, SIGPLAN Notices, Vol. 28, No 6, pages 237-247, Albuquerque, New Mexico, June 1993.
-
(1993)
Proceedings of the ACM SIGPLAN'93 Confe- Rence on Programming Languages Design and Implementation, SIGPLAN Notices
, vol.28
, Issue.6
, pp. 237-247
-
-
Flanagan, C.1
Sabry, A.2
Duba, B.F.3
Felleisen, M.4
-
15
-
-
0025446241
-
Representing control in the presence of _rst-class continuations
-
White Plains, New York, June
-
Robert Hieb, R. Kent Dybvig, and Carl Bruggeman. Representing control in the presence of _rst-class continuations. In Proceedings of the ACM SIGPLAN'90 Conference on Programming Languages Design and Implementation, SIGPLAN Notices, Vol. 25, No 6, pages 66-77, White Plains, New York, June 1990.
-
(1990)
Proceedings of the ACM SIGPLAN'90 Conference on Programming Languages Design and Implementation, SIGPLAN Notices
, vol.25
, Issue.6
, pp. 66-77
-
-
Hieb, R.1
Kent Dybvig, R.2
Bruggeman, C.3
-
16
-
-
0028743675
-
A tractable Scheme implementation
-
Richard A. Kelsey and Jonathan A. Rees. A tractable Scheme implementation. Lisp and Symbolic Computation, 7(4):315-336, 1994.
-
(1994)
Lisp and Symbolic Computation
, vol.7
, Issue.4
, pp. 315-336
-
-
Kelsey, R.A.1
Rees, J.A.2
-
17
-
-
84976822937
-
Orbit: An optimizing compiler for Scheme
-
Palo Alto, California, June
-
David Kranz, Richard Kesley, Jonathan Rees, Paul Hudak, Jonathan Philbin, and Norman Adams. Orbit: An optimizing compiler for Scheme. In Proceedings of the 1986 Symposium on Compiler Construction, SIGPLAN Notices, Vol. 21, No 7, pages 219-233, Palo Alto, California, June 1986.
-
(1986)
Proceedings of the 1986 Symposium on Compiler Construction, SIGPLAN Notices
, vol.21
, Issue.7
, pp. 219-233
-
-
Kranz, D.1
Kesley, R.2
Rees, J.3
Hudak, P.4
Philbin, J.5
Adams, N.6
-
18
-
-
0001097061
-
Landin. The mechanical evaluation of expressions
-
Peter J. Landin. The mechanical evaluation of expressions. Computer Journal, 6:308-320, 1964.
-
(1964)
Computer Journal
, vol.6
, pp. 308-320
-
-
Peter, J.1
-
19
-
-
84976776509
-
An efficient environment allocation scheme in an interpreter for a lexically-scoped Lisp
-
Stanford, California
-
Drew McDermott. An efficient environment allocation scheme in an interpreter for a lexically-scoped Lisp. In Conference Record of the 1980 LISP Conference, pages 154-162, Stanford, California, August 1980.
-
(1980)
Conference Record of the 1980 LISP Conference
, Issue.August
, pp. 154-162
-
-
McDermott, D.1
-
20
-
-
18944377121
-
Call-by-name, call-by-value and the fi-calculus
-
Gordon D. Plotkin. Call-by-name, call-by-value and the fi-calculus. Theoretical Computer Science, 1:125-159, 1975.
-
(1975)
Theoretical Computer Science
, vol.1
, pp. 125-159
-
-
Plotkin, G.D.1
-
21
-
-
0004219535
-
Rabbit: A compiler for Scheme
-
Cambridge, Massachusetts, May
-
Guy L Steele Jr. Rabbit: A compiler for Scheme. Technical Report AI-TR-474, Ar- ti_cial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, Massachusetts, May 1978.
-
(1978)
Technical Report AI-TR-474, Ar- Ti_Cial Intelligence Laboratory, Massachusetts Institute of Technology
-
-
Steele, G.L.1
-
22
-
-
0033727453
-
Continuations: A mathema- tical semantics for handling full jumps
-
Reprint of the technical monograph PRG-11, Oxford University Computing Laboratory (1974)
-
Christopher Strachey and Christopher P. Wadsworth. Continuations: A mathema- tical semantics for handling full jumps. Higher-Order and Symbolic Computation, 13(1/2), 2000. Reprint of the technical monograph PRG-11, Oxford University Computing Laboratory (1974).
-
(2000)
Higher-Order and Symbolic Computation
, vol.13
, Issue.1-2
-
-
Strachey, C.1
Wadsworth, C.P.2
|