Skip to main content Accessibility help
×
Home

A Formalisation of Weak Normalisation (with Respect to Permutations) of Sequent Calculus Proofs

  • A.A. Adams (a1)

Abstract

Dyckhoff and Pinto present a weakly normalising system of reductions on derivations are characterised as the fixed points of the composition of the Prawitz translations into natural deduction and back. This paper presents a formalisation of the system, including a proof of the Weak normalisation property for the formalisation. More details can be found in earlier work by the author. The formalisation has been kept as closes as possible to the original presentation to allow an evaluation of the state of proof assistance for such methods, and to ensure similarity of methods, and not merely similarly of results. The formalisation is restricted to the implicational fragment of intuitionistic logic.

    • Send article to Kindle

      To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

      Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

      Find out more about the Kindle Personal Document Service.

      A Formalisation of Weak Normalisation (with Respect to Permutations) of Sequent Calculus Proofs
      Available formats
      ×

      Send article to Dropbox

      To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

      A Formalisation of Weak Normalisation (with Respect to Permutations) of Sequent Calculus Proofs
      Available formats
      ×

      Send article to Google Drive

      To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

      A Formalisation of Weak Normalisation (with Respect to Permutations) of Sequent Calculus Proofs
      Available formats
      ×

Copyright

References

Hide All
1. Adams, A.A., ‘Tools and Techniques for Machine-Assisted Meta-Theory’, PhD Thesis, school of Mathematical and Computational Science, University of St Andrews, UK, 1997.
2. Altenkirch, TH., ‘A formasation of the strong normalisation proof for System F in LEGO’, Typed lambda calculus and applications, Lecture Notes in Computer Science 664 (ed., Bezem, M. and Groote, J.F., Springer-Verlag, 1993) pp. 1328.
3. Barras, B., ‘Coq en Coq’, Tech. Rep. 3026, INRIA(1996).
4. Barras, B., Boutin, S., Cornes, C., Courant, J., Filliatre, J.C., Giménez, E., Herbelin, H., Huet, G., Muñoz, C., Murthy, C., Parent, C., Paulin, C., Saïbi, A. and Werner, B., ‘The Coq Proof assistant Reference Manual (Version 6.1)’, Tech. Rep., INRIA, 1996. Available on-line with the Coq distribution from ftp://ftp.inria.fr.
5. Bundy, A. and Lombart, V., ‘Relational rippling: a general approach’, Proceedings, 14th International Joint Conference on Artificial Intelligence (ed., Mellish, C., IJCAI, 1995) 175181.
6. Bundy, A., Stevens, A., Van Harmelen, F., Ireland, A. and Smaill, A., ‘Rippling: a heuristic for guiding inductive proofs’, Artificial Intelligence (1993) 185253.
7. Constable, R.L., Allen, S.F. and Others, Implementing Mathematics with the NuPrl proof development system (Prentice-Hall, 1986).
8. Coquand, C., From semantics to rules: a machine assisted analysis, Lecture Notes in Computer Science 832 (Springer-Verlag, 1993) 91105.
9. Coquand, TH. and Huet, G., Constructions: a higher order proof system for mecha nizing Mathematics, Lecture Notes in Computer Science 203 (Springer-Verlag, 1985) 151184
10. Bruijn, N.G.De, ‘λ-calculus notation with nameless dummies, a tool for automatic formula manipulation’, Indag. Math 34 (1972) 381392.
11. Bruijn, N.G.DE, A survey of the project AUTOMATH (Academic Press, 1980) 579606.
12. Despeyroux, J., Felty, A. and Hirschhowitz, A., Higher-order abstract syntax in Coq Lecture Notes in Computer Science 902 (Springer-Verlag, 1995). 124138.
13. Dybjer, P., Nordström, B. and Smith, J. (eds), Types for proofs and programs, Proceedings, International Workshop TYPES '94, Lecture Notes in Computer Science (Springer-Verlag, 1994).
14. Dyckhoff, R., ‘Contraction-free sequent calculi for intuitionistic logic’, J. Symbolic Logic 57 (1992) 795807.
15. Dyckhoff, R. and Pinto, L., ‘A permutation-free sequent calculus for intuitionistic logic’, Tech. Rep. CS/96/9, University of St Andrews, 1996.
16. Dyckhoff, R. and Pinto, L., ‘Cut-elimination and Herbelin's sequent calculus for intuitionistic logic’, Studia Logica 60 (1998) 107118.
17. Dyckhoff, R. and Pinto, L., ‘Permutability of proofs in intuitionistic sequent calculi’, Theoret. Comput. Sci 212 (1999) 141–155.
18. Felty, A., A logic program for transforming sequent proofs to natural deduction proofs, Lecture Notes in Artificial Intelligence 475 (Springer-Verlag, 1989) 157178.
19. Fiore, M., Plotkin, G. and Turi, D., ‘Abstract syntax and variable binding’, Proceedings, 14th Annual Symposium on Logic in Computer Science (ed. Longo, G., IEEE Computer Society Press, Washington, 1999).
20. Gabbay, M.J. and Pitts, A.M., ‘A new approach to abstract syntax involving binders’, Proceedings, 14th Annual Symposium on Logic in Computer Science (ed. Longo, G., IEEE Computer Society Press, Washington, 1999)
21. Galmiche, D. and Perrier, G., ‘On proof normalisation in linear logic’, Theoret. Comput. Sci. 135 (1994) 67110.
22. Gentzen, G., ‘Investigations into logical deduction’ The collected papers of Gerhard Gentzen (Translated from 1934 original in German), Studies in Logic and the Foundations of Mathematics (ed.Szabo, M.E., North-Holland, 1969) 68131.
23. Giminez, E., ‘Codifying guarded definitions with recursive schemes’, Types for proofs and programs, Proceedings, International Workshop TYPES '94, Lecture Notes in Computer Science (ed. Dybjer, P., Nordström, B. and Smith, J., Springer-Verlag, 1994) 3959.
24. Gordon, A.D. and Melham, T., ‘Five axioms of alpha-conversion‘, Theorem proving in higher order logics, Proceedings, 9th International Conference, Lecture Notes in Computer Science 1125 (ed. Wright, J. von, Grundy, J. and Harrison, J., Springer-Verlag, 1996) 173190.
25. Gordon, M.J.C. and Melham, T.F. (eds), Introduction to HOL (Cambridge University Press, 1993).
26. Herbelin, H., A λ-calculus structure isomorphic to Gentzen-style sequent calculus structure, Lecture Notes in Computer Science 933 (Springer-Verlag, 1994) 6175.
27. Huet, G., ‘Residual theory in λ-calculus: a complete Gallina development’, J. Funct. Programming 3 (1994) 371394.
28. Huet, G. and Plotkin, G. (eds), Logical frameworks (Cambridge University Press, 1991).
29. Huet, G. and Plotkin, G. (eds), Logical environments (Cambridge University Press, 1993).
30. Kleene, S.C., ‘Permutability of inferences in Gentzen's calculi LK and LJ’, Mem. Amer. Math. Soc. (1952) 126.
31. Klop, J.W., Term rewriting systems (Oxford University Press, 1992) 1–116.
32. Leivant, D., ‘Assumption classes in natural deduction’, Zeitschrift fur Math. Logik 25 (1979) 1–4.
33. Löf, P. Martin-, Intuitionistic type theory (Bibliopolis, 1984).
34. McKinna, J. and Pollack, R., ‘Pure type systems formalized’, Typed lambda calculus and applications, Lecture Notes in Computer Science 664 (ed. Bezem, M. and Groote, J. F., Springer-Verlag, 1993) 289305.
35. Mckinna, J.H. and Pollack, R., ‘Some type theory and lambda calculus formalised’, J. Automat. Reason., Special Issue on Formal Proof, (ed. Pfenning, F., 23 (1999) 373409.
36. Mints, G., ‘Cut-elimination and normal forms of sequent derivations’, Tech. Rep. CSLI-94-193, Stanford University, 1994.
37. Mints, G., Normal forms for sequent derivations (A. K. Peters, Wellesley, MA, 1996) 469492.
38. Nazareth, D. and Nipkow, T., ‘Formal verification of Algorithm W: the monomorphic case’, Theorem proving in higher order logics, Proceedings, 9th International Conference, Lecture Notes in Computer Science 1125 (ed. Wright, J. von, Grundy, J. and Harrison, J., Springer-Verlag, 1996) 331345.
39. Mohring, C. Paulin-, ‘Inductive definitions in the system Coq. Rules and properties’, Typed lambda calculus and applications, Lecture Notes in Computer Science 664 (ed. Bezem, M. and Groote, J.F., Springer-Verlag, 1993) 328345.
40. Pfenning, F., ‘Logic programming in the LF logical framework’, Logical environments (ed. Huet, G. and Plotkin, G., Cambridge University Press, 1993) 149181.
41. Pfenning, F., ‘A structural proof of cut elimination and its representation in a logical framework’, Tech. Rep. CMU-CS-94-218, Carnegie Mellon University (1994).
42. Pfenning, F. and Rohwedder, E., Implementing the meta-theory of deductive systems, Lecture Notes in Artificial Intelligence 607 (Springer-Verlag, 1992) 537551.
43. Prawitz, D., ‘Natural deduction’, Ph.D. thesis, Acta Universitatis Stockholmensis, 1965.
44. Saïbi, A., ‘Formalization of a λ-calculus with explicit substitutions in Coq’, Types for proofs and programs, Proceedings, International Workshop TYPES '94, Lecture Notes in Computer Science (ed. Dybjer, P., Nordström, B. and Smith, J., Springer-Verlag, 1994) 183202.
45. Schwichtenberg, H., ‘Termination of permutative conversions in intuitionistic Gentzen calculi’, Theoretical Comput. Sci. 212 (1999) 247260.
46. Shanker, N., Metamathematics, machines, and Gödel's proof Cambridge Tracts in Theoretical Computer Science (Cambridge University Press, 1994).
47. Szabo, M. E. (ed.), The collected papers of Gerhard Gentzen (Translated from 1934 original in German), Studies in Logic and the Foundations of Mathematics (North-Holland, 1969).
48. Troelstra, A. S. and Schwichtenberg, H., Basic proof theory (Cambridge University Press, 1996).
49. van Benthem Jutting, L. S., McKinna, J. and Pollack, R., ‘Checking algorithms for pure type systems’, Lecture Notes in Computer Science 806 (Springer-Verlag, 1994) 1961.
MathJax
MathJax is a JavaScript display engine for mathematics. For more information see http://www.mathjax.org.

Related content

Powered by UNSILO
Type Description Title
UNKNOWN
Supplementary materials

JCM 3 Adams Appendix A
Adams Appendix A

 Unknown (103 KB)
103 KB

A Formalisation of Weak Normalisation (with Respect to Permutations) of Sequent Calculus Proofs

  • A.A. Adams (a1)

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed.