A sound and complete CPS-translation for λμ-calculus

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

Volumn 2701, Issue , 2003, Pages 120-134

  Fujita, Ken Etsu ^a  

^a SHIMANE UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

BIOMINERALIZATION; COMPUTATIONAL MECHANICS; DIFFERENTIATION (CALCULUS);

INJECTIVITY; LAMBDA CALCULUS; LAMBDA-MU CALCULUS; MONOIDS; SOUND AND COMPLETE; SURJECTIVE;

CALCULATIONS;

EID: 24944561201     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44904-3_9     Document Type: Article

References (17)

1. H. P. Barendregt: The Lambda Calculus, Its Syntax and Semantics (revised edition), North-Holland, 1984.
2. K. Baba, S. Hirokawa, and K. Fujita: Parallel Reduction in Type-Free λμ-Calculus, Electronic Notes in Theoretical Computer Science, Vol. 42, pp. 52-66, 2001.
3. P. -L. Curien: Categorical Combinators, Sequential Algorithms and Functional Programming, Pitman, London/John Wiley&Sons, 1986.
4. K. Fujita: Simple Models of Type Free λμ-Calculus, The 18th Conference Proceedings Japan Society for Software Science and Technology, 2001 (in Japanese).
5. K. Fujita: An interpretation of λμ-calculus in λ-calculus, Information Processing Letters, Vol. 84, No. 5, pp. 261-264, 2002.
6. K. Fujita: Continuation Semantics and CPS-translation of λμ-Calculus, Scientiae Mathematicae Japonicae, Vol. 57, No.1, pp. 73-82, 2003.
7. T. G. Griffin: A Formulae-as-Types Notion of Control, Proc. the 17th Annual ACM Symposium on Principles of Programming Languages, pp. 47-58, 1990.
8. C. A. Gunter and D. S. Scott: Semantic Domains, in: Handbook of Theoretical Computer Science Vol. B : Formal Models and Semantics, Elsevier Science Publishers B. V., 1990.
9. M. Hofmann and T. Streicher: Continuation models are universal for λμ-calculus, Proc. the 12th Annual IEEE Symposium on Logic in Computer Science, pp. 387-395, 1997.
10. W. Howard: The Formulae-as-Types Notion of Constructions, in: To H.B.Curry: Essays on combinatory logic, lambda-calculus, and formalism, Academic Press, pp. 479-490, 1980.
11. J. Lambek and P. J. Scott: Introduction to higher order categorical logic, Cambridge University Press, 1986.
12. C. R. Murthy: An Evaluation Semantics for Classical Proofs, Proc. the 6th Annual IEEE Symposium on Logic in Computer Science, pp. 96-107, 1991.
13. M. Parigot: λμ-Calculus: An Algorithmic Interpretation of Classical Natural Deduction, Lecture Notes in Computer Science 624, pp. 190-201, 1992.
14. M. Parigot: Proofs of Strong Normalization for Second Order Classical Natural Deduction, J. Symbolic Logic, Vol. 62, No. 4, pp. 1461-1479, 1997.
15. G. Plotkin: Call-by-Name, Call-by-Value and the λ-Calculus, Theoretical Computer Science, Vol. 1, pp. 125-159, 1975.
16. P. Selinger: Control Categories and Duality: on the Categorical Semantics of the Lambda-Mu Calculus, Math. Struct. in Compu. Science, Vol. 11, pp. 207-260, 2001.
17. T. Streicher and B. Reus: Classical Logic, Continuation Semantics and Abstract Machines, J. Functional Programming, Vol. 8, No. 6, pp. 543-572, 1998.