A λ-to-CL translation for strong normalization

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

Volumn 1210, Issue , 1997, Pages 1-10

  Akama, Yohji ^a  

^a UNIVERSITY OF TOKYO   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; BIOMINERALIZATION; COMPUTATIONAL MECHANICS; DIFFERENTIATION (CALCULUS); NUMBER THEORY; PATHOLOGY;

BETA-REDUCTION; LAMBDA CALCULUS; LAMBDA TERMS; ORDINAL NUMBER; PARTIAL COMBINATORY ALGEBRAS; STRONG NORMALIZATION;

CALCULATIONS;

EID: 84892753229     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-62688-3_25     Document Type: Conference Paper

References (14)

1. Y. Akama. On Mints' reduction for ccc-calculus. In Bezem and Groote [7], pages 1-12.
2. T. Altenkirch. Proving strong normalization of CC by modifying realizability semantics. In H. Barendregt and T. Nipkow, editors, Types for Proofs and Programs, volume 806 of Lecture Notes on Computer Science, pages 3-18. Springer, 1994.
3. It. Barendregt. The Lambda Calculus, Its Syntax and Semantics. North-Holland, second edition, 1984.
4. M. Beeson. Foundations of Constructive Mathematics. Springer, 1985.
5. I. Bethke and J. W. Klop. Collapsing partial combinatory algebras. In G. Dowek, J. Heering, K. Meinke, and B. Möller, editors, Higher-Order Algebra, Logic, and Term Rewriting, volume 1074 of Lecture Notes on Computer Science, pages 57-73. Springer, 1996.
6. I. Bethke, J. W. Klop, and R. de Vrijer. Completing partial combinatory algebras with unique head-normal forms. In Logic in Computer Science, pages 448-454. IEEE Computer Society press, 1996.
7. M. Bezem and J.F. Groote, editors. Typed Lambda Calculi and Applications, volume 664 of Lecture Notes in Computer Science. Springer, 1993.
8. H. B. Curry, J. R. Hindley, and J. P. Seldin. Combinatory Logic, Volume IL Studies in Logic and the Foundations of Mathematics. North-Holland, 1972.
9. J.R. Hindley and J.P. Seldin. Introduction to Combinators and Lambda-calculus. Cambridge University Press, 1986.
10. W.A. Howard. Assignment of ordinals to terms for primitive recursive functionals of finite type. In A. Kino, J. Myhill, and R. Vesley, editors, Intuitionism and Proof Theory, pages 443-458. North-Holland, 1970.
11. J.M.E. Hyland and C.-H. L. Ong. Modified realizability toposes and strong normalization proofs (extended abstract). In Bezem and Groote [7], pages 179-194.
12. J.W. Klop. Term rewriting systems. In S. Abramsky, D. Gabbay, and T. Maibaum, editors, Handbook of Logic in Computer Science, volume 2, pages 2-117. Oxford University Press, 1992.
13. K. Schiitte. Proof Theory. Springer, 1977. (translated by J. Crossley from the German.).
14. D. A. Turner. A new implementation technique for applicative languages. Software Practice and Experience, 9(1):31-49, January 1979.