Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-15T04:56:06.391Z Has data issue: false hasContentIssue false
  • English
  • Français

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

Published online by Cambridge University Press:  12 March 2014

Koji Nakazawa and
Makoto Tatsuta
Koji Nakazawa
Affiliation:
Graduate School of Informatics, Kyoto University, Kyoto, 606-8501, Japan, E-mail: knak@kuis.kyoto-u.ac.jp
Makoto Tatsuta
Affiliation:
National Institute of Informatics, 2-1-2 Hitotsubashi, Tokyo, 101-8430, Japan, E-mail: tatsuta@nii.ac.jp
Get accessRights & Permissions [Opens in a new window]

Abstract

This paper points out an error of Parigot's proof of strong normalization of second order classical natural deduction by the CPS-translation, discusses erasing-continuation of the CPS-translation, and corrects that proof by using the notion of augmentations.

Information

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 68 , Issue 3 , September 2003, pp. 851 - 859
Copyright
Copyright © Association for Symbolic Logic 2003

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

REFERENCES

[1] de Groote, P., A CPS-translation for the λμ-calculus, Lecture Notes in Computer Science, vol. 787, Springer-Verlag, 1994.Google Scholar
[2] de Groote, P., A simple calculus of exception handling, Lecture Notes in Computer Science, vol. 902, Springer-Verlag, 1995.Google Scholar
[3] Fujita, K., Domain-free λμ-calculus, Theoretical Informatics and Applications, vol. 34 (2000), pp. 433–466.CrossRefGoogle Scholar
[4] Girard, J.-Y., Taylor, P., and Lafont, Y., Proofs and types, Cambridge University Press, 1989.Google Scholar
[5] Nakazawa, K., Confluency and strong normatizability of call-by-value λμ-calculus, Theoretical Computer Science, vol. 290 (2003), no. 1, pp. 429–463.Google Scholar
[6] Parigot, M., λμ-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.Google Scholar
[7] Parigot, M., Proofs of strong normalization for second order classical natural deduction, this Journal, vol. 62 (1997), no. 4, pp. 1461–1479.Google Scholar
[8] Plotkin, G. D., Call-by-name, call-by-value and the λ-calculus, Theoretical Computer Science, vol. 1 (1975), pp. 125–159.Google Scholar