Completeness of continuation models for λμ-calculus

Information and Computation

Volumn 179, Issue 2, 2002, Pages 332-355

  Hofmann, Martin ^a   Streicher, Thomas ^a  

^a Institut für Informatik   (Germany)

^b DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; COMPUTER SIMULATION; FUNCTIONS; SEMANTICS; SYNTACTICS;

CONTINUATION SEMANTICS;

FORMAL LOGIC;

EID: 0037115170     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.2001.2947     Document Type: Conference Paper

References (19)

1. Agapiev, B., and Moggi, E. (1991), Declarative continuations and monads, unpublished draft.
2. μ-calculus, in "Proceedings of Symposium on Mathematical Foundations of Computer Science, Brno, Czech Republic" (L. Brim, J. Gruska, and J. Zlatuska, Eds.), Lecture Notes in Computer Science, Vol. 1450, pp. 336-345, Springer-Verlag, Berlin/New York.
3. μ-calculus and the syntactic theory of sequential control, in "Proc. 5th International Conference on Logic Programming and Automated Reasoning, LPAR'94" (F. Pfenning, Ed.), Lecture Notes in Artificial Intelligence, Vol. 822, pp. 31-43, Springer-Verlag, Berlin.
4. Felleisen, M., Friedman, D., Kohlbecker, E., and Duba, B. (1987), A syntactic theory of sequential control, Theoret. Comput. Sci. 52, 205-237.
5. Führmann, C. (1999), Direct models for the computational lambda-calculus, in "Proceedings of MFPS XV," ENTCS, Vol. 20.
6. Führmann, C., Direct-style and continuation-passing-style models of control, unpublished manuscript (1999).
7. Hofmann, M. (1995), Sound and complete axiomatisations of call-by-value control operators, Math. Struct. Comp. Sci. 5, 461-482.
8. μ-calculus, in "Proceedings of LICS97," pp. 387-397.
9. Krivine, J.-L. (1994), Classical logic, storage operators, and second-order lambda calculus, Ann. Pure Appl. Logic 68, 53-78.
10. Lafont, Y., Reus, B., and Streicher, T. (1993), "Continuation Semantics or Expressing Implication by Negation," Technical Report 93-21, University of Munich.
11. Ong, C.-H.L., and Stewart, C.A. (1997), A curry-howard foundation for functional computation with control, in "Proceedings of ACM SIGPLAN-SIGACT Symposium on Principle of Programming Languages, Paris, January 1997," Assoc. Comput. Much. Press, New York.
12. Ong, L. (1996), A semantic view of classical proofs, in "Proceedings of LICS '96," IEEE Press, New York.
13. μ-calculus: An algorithmic interpretation of classical matural deduction, in "Proc. LPAR '92," Lecture Notes in Computer Science, Vol. 624, Springer-Verlag, Berlin.
14. Pitts, A. (2000), Categorical logic, in "Handbook of Logic in Computer Science," Vol. V, Oxford Univ. Press, London.
15. Plotkin, G. (1975), Call-by-name, call-by-value and the λ-calculus, Theoret. Comput. Sci. 1, 125-159.
16. Reus, B., and Streicher, T. (1998), Classical logic, continuation semantics, and abstract machines, Journ. Funct. Prog. 8, 543-572.
17. Sabry, A., and Felleisen, M. (1993), Reasoning about programs in continuation-passing style, Lisp Symbolic Comput. 6, 287-358. Preliminary version in "Proceedings of the ACM Conference on Lisp and Functional Programming, 1992," also Technical Report 92-180, Rice University.
18. Selinger, P. (1999), Control categories and duality: On the categorical semantics of the λμ-calculus, presented at MFPS XV, available from the Hypatia Electronic Library.
19. Thielecke, H. "Categorical Structure of Continuation Passing Style," Ph.D. thesis, University of Edinburgh, also as LFCS Technical Report ECS-LFCS-97-376.