Strong normalization proof with cps-translation for second order classical natural deduction

Journal of Symbolic Logic

Volumn 68, Issue 3, 2003, Pages 851-859

  Nakazawa, Koji ^a   Tatsuta, Makoto ^b  

^a KYOTO UNIVERSITY   (Japan)

^b NATIONAL INSTITUTE OF INFORMATICS   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0141764811     PISSN: 00224812     EISSN: None     Source Type: Journal    
DOI: 10.2178/jsl/1058448444     Document Type: Article

References (8)

1. P. de Groote, A CPS-translation for the Xp-calculus, Lecture Notes in Computer Science, vol. 787, Springer-Verlag, 1994.
2. P. de Groote, A simple calculus of exception handling, Lecture Notes in Computer Science, vol. 902, Springer-Verlag, 1995.
3. K. Fujita, Domain-free Xp-calculus, Theoretical Informatics and Applications, vol. 34 (2000), pp. 433-466.
4. J.-Y. Girard, P Taylor, and Y. Lafont, Proofs and types, Cambridge University Press, 1989.
5. K. Nakazawa, Confluency and strong normalizability of call-by-value Xp-calculus, Theoretical Computer Science, vol. 290 (2003), no. 1, pp. 429-463.
6. M. Parigot, Xp-calculus: an algorithmic interpretation of natural deduction, Proceedings of the international conference on logic programming and automated reasoning, Lecture Notes in Computer Science, vol. 624, Springer-Verlag, 1992, pp. 190-201.
7. M. Parigot, Proofs of strong normalization for second order classical natural deduction, this Journal, vol. 62 (1997), no. 4, pp. 1461-1479.
8. G. D. Plotkin, Call-by-name, call-by-value and the X-calculus, Theoretical Computer Science, vol. 1 (1975), pp. 125-159.