On the strong normalisation of intuitionistic natural deduction with permutation-conversions

Information and Computation

Volumn 178, Issue 2, 2002, Pages 441-464

  De Groote, Philippe ^a  

^a LORIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; DIGITAL ARITHMETIC; PROBLEM SOLVING; THEOREM PROVING;

NATURAL DEDUCTION; PERMUTATION-CONVERSIONS;

FORMAL LOGIC;

EID: 0036851267     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.2002.3147     Document Type: Article

References (14)

1. Barendregt, H. P. (1984), "The Lambda Calculus, Its Syntax and Semantics," revised edition, North-Holland, Amsterdam.
2. Curry, H. B., and Feys, R. (1958), "Combinatory Logic," Vol. I, North-Holland, Amsterdam.
3. de Groote, Ph. (1993) The conservation theorem revisited, in "Proceedings of the International Conference on Typed Lambda Calculi and Applications" (M. Bezem and J. F. Groote, Eds.), Lecture Notes in Computer Science, Vol. 664, pp. 163-178, Springer-Verlag, Berlin/New York.
4. de Groote, Ph. (1995) A simple calculus of exception handling, in "Second International Conference on Typed Lambda Calculi and Applications, TLCA'95" (M. Dezani and G. Plotkin, Eds.), Lecture Notes in Computer Science, Vol. 902, pp. 201-215, Springer-Verlag, Berlin/New York.
5. Gentzen, G. (1955), "Recherches sur la déduction logique (Untersuchungen über das logische schliessen)," Presses Universitaires de France. Traduction et commentaire par R. Feys et J. Ladrière.
6. Girard, J.-Y. (1987), "Proof Theory and Logical Complexity," Bibliopolis.
7. Howard, W. A. (1980), The formulae-as-types notion of construction, in "To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism" (J. P. Seldin and J. R. Hindley, Eds.), pp. 479-490, Academic Press, San Diego.
8. Meyer, A., and Wand, M. (1985), Continuation semantics in typed lambda-calculi (summary), in "Logics of Programs" (R. Parikh, Ed.), Lecture Notes in Computer Science, Vol. 193, pp. 219-224, Springer-Verlag, Berlin/New York.
9. Mints, G. (1997), Private communication.
10. Plotkin, G. D. (1975), Call-by-name, call-by-value and the λ-calculus, Theoret. Comput. Sci. 1, 125-159.
11. Prawitz, D. (1965), "Natural Deduction, A Proof-Theoretical Study," Almqvist & Wiksell, Stockholm.
12. Prawitz, D. (1971), Ideas and results in proof-theory, in "Proceedings of the Second Scandinavian Logic Symposium" (J. E. Fenstad, Ed.), pp. 237-309, North-Holland, Amsterdam.
13. Troelstra, A., and van Dalen, D. (1988), "Constructivism in Mathematics," Vol. I, North-Holland, Amsterdam.
14. Troelstra, A., and van Dalen, D. (1988), "Constructivism in Mathematics," Vol. II, North-Holland, Amsterdam.