PRoof Normalization Modulo

Journal of Symbolic Logic

Volumn 68, Issue 4, 2003, Pages 1289-1316

  Dowek, Gilles ^a   Werner, Benjamin ^a  

^a ÉCOLE POLYTECHNIQUE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0346961401     PISSN: 00224812     EISSN: None     Source Type: Journal    
DOI: 10.2178/jsl/1067620188     Document Type: Article

References (31)

1. S.C. Bailin, A normalization theorem for set theory, this Journal, vol. 53 (1988), no. 3, pp. 673-695.
2. H. Barendregt, Lambda calculi with types, Handbook of logic in computer science (S. Abramsky, D.M. Gabbay, and T.S.E. Maibaum, editors), vol. 2, Oxford University Press, 1992.
3. R.S. Boyer and J.S. Moore, A computational logic, Academic Press, 1979.
4. A. Church, A formulation of the simple theory of types, this Journal, vol. 5 (1940), no. 1, pp. 56-68.
5. Th. Coquand and G. Huet, The calculus of constructions, Information and Computation, vol. 76 (1988), pp. 95-120.
6. M. Crabbe, Non-normalisation de ZF, Manuscript, 1974.
7. M. Crabbe, Stratification and cut-elimination, this Journal, vol. 56 (1991), no. 1, pp. 213-226.
8. H.B. Curry, An analysis of the logical substitution, American Journal of Mathematics, vol. 51 (1929), pp. 263-384.
9. G. Dowek, Proof normalization for a first-order formulation ofhigher-order logic, Theorem proving in higher-order logics (E.L. Gunter and A. Felty, editors), Lecture Notes in Computer Science, vol. 1275, Springer-Verlag, 1997, pp. 105-119. Rapport de Recherche 3383, Institut National de Recherche en Informatique et en Automatique, 1998.
10. G. Dowek, About folding-unfolding cuts and cuts modulo, Journal of Logic and Computation, vol. 11 (2001), no. 3, pp. 419-429.
11. G. Dowek, Th. Hardín, and C. Kírchner, Theorem proving modulo, Journal of Automated Reasoning, (to appear).
12. J. Ekman, Normal proofs in set theory, Doctoral thesis, Chalmers university of technology and University of Goteborg, 1994.
13. H.B. Enderton, A mathematical introduction to logic, Academic Press, 1972.
14. M.J. Fay, First-order unification in an equational theory, Fourth workshop on automated deduction, 1979, pp. 161-167.
15. J. Gallíer, Logic in computer science, Harper and Row, 1986.
16. J.Y Gírard, Interpretation fonctionnelle et elimination des coupures dans l’arithmetique d’ordre superieur, Doctoral thesis, Université de Paris 7, 1972.
17. J.Y Gírard, Y Lafont, and P. Taylor, Proofs and types, Cambridge University Press, 1989.
18. L. HallnAs, On normalization of proofs in set theory, Doctoral thesis, University of Stockholm, 1983.
19. L. Henkín, Banishing the rule ofsubstitution for functional variables, this Journal, vol. 18 (1953), no. 3, pp. 201-208.
20. J.-M. Hullot, Canonicalforms and unification, Conference on automated deduction (W Bibel and R. Kowalski, editors), Lecture Notes in Computer Science, vol. 87, Springer-Verlag, 1980, pp. 318-334.
21. J.-L. Krívíne and M. Parígot, Programming withproofs, Journal of Information Processing and Cybernetics, vol. 26 (1990), no. 3, pp. 149-167.
22. P. Martín-Lof, Intuitionistic type theory, Bibliopolis, 1984.
23. R.P. Nederpelt, J.H. Geuvers, and R.C. de Vrijer (editors), Selected papers on automath, Studies in Logic and the Foundations of Mathematics, vol. 133, North-Holland, 1994.
24. S. Owre and N. Shankar, The formal semantics of PVS, Technical Report CSL-97-2R, SRI, 1999.
25. Ch. Paulín-Mohríng, Inductive definitions in the system Coq - rules and properties, Typedlambda calculi and applications (M. Bezem and J.-F. Groote, editors), Lecture Notes in Computer Science, vol. 664, Springer-Verlag, 1993, pp. 328-345.
26. G. Plotkín, Building-in equational theories, Machine Intelligence, vol. 7 (1972), pp. 73-90.
27. D. Prawítz, Natural deduction, a proof-theoretical study, Almqvist & Wiksell, 1965.
28. M. Stíckel, Automated deduction by theory resolution, Journal of Automated Reasoning, vol. 4 (1985), no. 1, pp. 285-289.
29. W.W Taít, Intensional interpretation of functionals of finite type I, this Journal, vol. 32 (1967), no. 2, pp. 198-212.
30. W.W Taít, A realizability interpretation of the theory of species, Logic colloquium, Lecture Notes in Mathematics, vol. 435, 1975, pp. 240-251.
31. B. Werner, Une theorie des constructions inductives, Doctoral thesis, Universite Paris 7, 1994.