λμ-calculus and Böhm's theorem

Journal of Symbolic Logic

Volumn 66, Issue 1, 2001, Pages 407-413

  David, René ^a   Py, Walter ^a  

^a Laboratoire de Maths   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0035589610     PISSN: 00224812     EISSN: None     Source Type: Journal    
DOI: 10.2307/2694930     Document Type: Article

References (10)

1. S. ABRAMSKY and L. ONG, Full abstraction in the lazy lambda calculus, Information and Computation, vol. 105 (1993), no. 2.
2. P. ACZEL, A general church-rosser theorem, Technical report, University of Manchester, 1978.
3. J. W. KLOP, V. VAN OOSTROM, and F. VAN RAAMSDONK, Combinatory reduction systems, introduction and survey, Theoretical Computer Science, vol. 121 (1993).
4. J. L. KRIVINE, Lambda-calcul, types et modèles, Masson, Paris, 1990.
5. K. NOUR, Non deterministic classical logic : The λ∂-calculus, Private communication.
6. M. PARIGOT, λμ-calculus: an algorithmic interpretation of classical natural deduction, Lecture Notes in Artificial Intelligence, no. 624, Springer-Verlag, 1992.
7. _, Classical proofs as programs, Lecture Notes in Computer Science, no. 713, Springer Verlag, 1993.
8. _, Proofs of strong normalization for second order classical natural deduction, this JOURNAL, vol. 62 (1997), no. 4.
9. D. PRAWITZ, Natural deduction, a proof-theoritical study, Almqvist & Wiksell, Stockholm, 1965.
10. W. PY, Confluence en λμ-calcul, Ph.D. thesis, 1998.