An interpretation of λμ-calculus in λ-calculus

Information Processing Letters

Volumn 84, Issue 5, 2002, Pages 261-264

  Fujita, Ken Etsu ^a  

^a SHIMANE UNIVERSITY   (Japan)

Author keywords

model; Fixed point combinators; Formal semantics; G del Gentzen translation; Type free calculus

Indexed keywords

COMBINATORIAL MATHEMATICS; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; SEMANTICS;

FIXED POINT COMBINATORS; FORMAL SEMANTICS;

COMPUTATIONAL METHODS;

EID: 0037121495     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(02)00300-9     Document Type: Article

References (21)

1. Akama Y. Limiting partial combinatory algebra towards infinitary lambda-calculi and classical logic. Lecture Notes in Comput. Sci. 2142:2001;399-413 Springer, Berlin.
2. Barendregt H.P. The Lambda Calculus, Its Syntax and Semantics (revised edition). 1984;North-Holland, Amsterdam.
3. Baba K., Hirokawa S., Fujita K. Parallel reduction in type-free λμ -calculus. 7th Asian Logic Conference. 1999.
4. Baba K., Hirokawa S., Fujita K. Parallel reduction in type-free λμ -calculus. Electron. Notes Theoret. Comput. Sci. 42:2001;52-66.
5. Felleisen M., Friedman D.P., Kohlbecker E., Duba B. Reasoning with continuations. Proc. Annual IEEE Symposium on Logic in Computer Science. 1986;131-141.
6. Fujita K. On proof terms and embeddings of classical substructural logics. Studia Logica. 61:1998;199-221.
7. Fujita K. Multiple-conclusion system as communication calculus. Electron. Notes Theoret. Comput. Sci. 31:2000;167-182.
8. Fujita K. Simple model of type free λμ -calculus. 18th Conference Proceedings Japan Society for Software Science and Technology. 2001.
9. Fujita K. Continuation semantics and CPS-translation of λμ -calculus. Sci. Math. Japonicae. 2002;. to appear.
10. Griffin T.G. A formulae-as-types notion of control. Proc. 17th Annual ACM Symposium on Principles of Programming Languages. 1990;47-58.
11. de Groote Ph. On the relation between the λμ -calculus and the syntactic theory of sequential control. Lecture Notes in Artif. Intell. 822:1994;31-43 Springer, Berlin.
12. Hofmann M., Streicher T. Continuation models are universal for λμ -calculus. Proc. 12th Annual IEEE Symposium on Logic in Computer Science. 1997;387-395.
13. Howard W. The formulae-as-types notion of constructions. To H.B. Curry: Essays on Combinatory Logic, Lambda-Calculus, and Formalism. 1980;479-490 Academic Press, New York.
14. Murthy C.R. An evaluation semantics for classical proofs. Proc. 6th Annual IEEE Symposium on Logic in Computer Science. 1991;96-107.
15. Ong C.-H.L. A semantic view of classical proofs: Type-theoretic, categorical, and denotational characterizations. Linear Logic'96, Tokyo Meeting. 1996.
16. Parigot M. λμ -calculus: An algorithmic interpretation of classical natural deduction. Lecture Notes in Comput. Sci. 624:1992;190-201 Springer, Berlin.
17. Parigot M. Classical proofs as programs. Lecture Notes in Comput. Sci. 713:1993;263-276.
18. Parigot M. Proofs of strong normalization for second order classical natural deduction. J. Symbolic Logic. 62:(4):1997;1461-1479.
19. Plotkin G. Call-by-name, call-by-value and the λ -calculus. Theoret. Comput. Sci. 1:1975;125-159.
20. Selinger P. Control categories and duality: on the categorical semantics of the lambda-mu calculus. Math. Structures Comput. Sci. 11:2001;207-260.
21. Streicher T., Reus B. Classical logic, continuation semantics and abstract machines. J. Funct. Programming. 8:(6):1998;543-572.