Answer type polymorphism in call-by-name continuation passing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2986, Issue , 2004, Pages 279-293

  Thielecke, Hayo ^a  

^a UNIVERSITY OF BIRMINGHAM   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

CALL-BY-NAME; CONTINUATION PASSING; CONTINUATION-PASSING STYLE; CONTROL OPERATORS; PARAMETRICITY; POLYMORPHIC TYPE SYSTEMS;

ARTIFICIAL INTELLIGENCE;

EID: 35048812549     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24725-8_20     Document Type: Article

References (21)

1. Josh Berdine, Peter W. O'Hearn, Uday Reddy, and Hayo Thielecke. Linear continuation passing. Higher-order and Symbolic Computation, 15(2/3):181-208, 2002.
2. Olivier Danvy and Andrzej Filinski. Representing control, a study of the CPS transformation. Mathematical Structures in Computer Science, 2(4):361-391, December 1992.
3. Olivier Danvy and John Hatcliff. A generic account of continuation-passing styles. In ACM Symposium on Principles of Programming Languages, pages 458-471, 1994.
4. Andrzej Filinski. Declarative continuations: an investigation of duality in programming language semantics. In D. H. Pitt et al., editors, Category Theory and Computer Science, number 389 in Lecture Notes in Computer Science, pages 224249. Springer-Verlag, 1989.
5. Timothy G. Griffin. A formulae-as-types notion of control. In Principles of Programming Languages (POPL '90), pages 47-58. ACM, 1990.
6. Robert Harper and Mark Lillibridge. Explicit polymorphism and CPS conversion. In Principles of Programming Languages (POPL '93), pages 206-219. ACM, 1993.
7. John Hatcliff and Olivier Danvy. Thunks and the A-calculus. Journal of Functional Programming, 7(2):303-319, 1997.
8. Martin Hofmann and Thomas Streicher. Continuation models are universal for Ap-calculus. In LICS: IEEE Symposium on Logic in Computer Science, 1997.
9. Pierre Jouvelot and David K. Gifford. Reasoning about continuations with control effects. In Prgramming Language Design and Implementation (PLDI), pages 218226. ACM, 1988.
10. Richard Kelsey, William Clinger, and Jonathan Rees, editors. Revised5 report on the algorithmic language Scheme. Higher-Order and Symbolic Computation, 11(1):7-105, 1998.
11. Olivier Laurent and Laurent Regnier. About translations of classical logic into polarized linear logic. In Proceedings of the eighteenth annual IEEE symposium on Logic In Computer Science, pages 11-20. IEEE Computer Society Press, June 2003.
12. Albert R. Meyer and Mitchell Wand. Continuation semantics in typed lambdacalculi (summary). In Rohit Parikh, editor, Logics of Programs, number 193 in Lecture Notes in Computer Science, pages 219-224. Springer-Verlag, 1985.
13. Eugenio Moggi. Computational lambda calculus and monads. In Proceedings, Fourth Annual Symposium on Logic in Computer Science, pages 14-23, 1989.
14. Peter W. O'Hearn and John C. Reynolds. From Algol to polymorphic linear lambda-calculus. Journal of the ACM, 47:167-223, 2000.
15. Andrew M. Pitts. Parametric polymorphism and operational equivalence. Mathematical Structures in Computer Science, 10:321-359, 2000.
16. Gordon D. Plotkin. Call-by-name, call-by-value, and the A-calculus. Theoretical Computer Science, 1(2):125-159, 1975.
17. John C. Reynolds. Types, abstraction and parametric polymorphism. In R. E. A. Mason, editor, Information Processing 83, pages 513-523, Amsterdam, 1983. Elsevier Science Publishers B. V. (North-Holland).
18. Thomas Streicher and Bernhard Reus. Classical logic: Continuation semantics and abstract machines. Journal of Functional Programming, 8(6), 1998.
19. Hayo Thielecke. Comparing control constructs by double-barrelled CPS. Higherorder and Symbolic Computation, 15(2/3):141-160, 2002.
20. Hayo Thielecke. From control effects to typed continuation passing. In 30th SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL'03), pages 139-149. ACM, 2003.
21. Philip Wadler. Theorems for free! In 4'th International Conference on Functional Programming and Computer Architecture (FPCA '89), pages 347-359. ACM, 1989.