Skip to main content
SpringerLink
Log in

Formalizing Strong Normalization Proofs of Explicit Substitution Calculi in ALF

  • Published:
Journal of Automated Reasoning Aims and scope Submit manuscript

Abstract

The past decade has given rise to a number of explicit substitution calculi. An important question of explicit substitution calculi is that of the termination of the underlying calculus of substitution. Proofs of termination of substitutions fall in two categories: those that are easy because a decreasing measure can be established and those that are difficult because such a decreasing measure is not easy to establish. This paper considers two styles of explicit substitution: σ and s, for which different termination proof methods apply. The termination of s is guaranteed by a decreasing weight, while a decreasing weight for showing the termination of σ has not yet been found. These termination methods for σ and s are formalized in the proof checker ALF. During our process of formally checking the termination of σ and s we comment on what is needed to make a proof formally checkable.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. ftp://ftp.cs.chalmers.se/users/cs/qiao/Sigma/.

  2. Abadi, M., Cardelli, L., Curien, P.-L. and Lévy, J.-J.: Explicit substitutions, J. Funct. Programming 1(4) (1991), 375-416.

    Google Scholar 

  3. Barras, B.: Auto-validation d’un système de preuves avec familles inductives, Thèse de doctorat, Université Paris 7, November 1999.

  4. Benaissa, Z., Briaud, D., Lescanne, P. and Rouyer-Degli, J.: ??, a calculus of explicit substitutions which preserves strong normalisation, J. Funct. Programming 6(5) (1996), 699-722.

    Google Scholar 

  5. Bloo, R. and Rose, K.: Preservation of strong normalisation in named lambda calculi with explicit substitution and garbage collection, in CSN-95: Computer Science in the Netherlands, November 1995.

  6. Bognar, M. and de Vrijer, R.: The context calculus lambda-c, Workshop on Logical Frameworks and Meta-languages, 1999.

  7. Constable, R. L., Allen, S., Bromely, H., Cleveland, W., et al.: Implementing Mathematics with the Nuprl Development System, Prentice-Hall, Inc., Englewood Cliffs, NJ, 1986.

    Google Scholar 

  8. Project Coq: The Coq proof assistant reference manual, version 6.1, Technical report, INRIA, 1996.

  9. Coquand, C.: From semantics to rules: A machine assisted analysis, in E. Börger, Y. Gurevich and K. Meinke (eds), Proceedings of the 7th Workshop on Computer Science Logic, LNCS 832, Springer-Verlag, 1993, pp. 91-105.

  10. Curien, P.-L.: Categorical Combinators, Sequential Algorithms, and Functional Programming, 2nd edn, Progr. Theoret. Comput. Sci., Birkhäuser, Boston, 1993. (1st edn, Pitman Publishing, London, and Wiley, New York).

    Google Scholar 

  11. Curien, P.-L., Hardin, T. and Lévy, J.-J.: Confluence properties of weak and strong calculi of explicit substitutions, Technical Report RR 1617, INRIA, Rocquencourt, 1992.

    Google Scholar 

  12. Curien, P.-L., Hardin, T. and Ríos, A.: Strong normalisation of substitutions, Logic and Computation 6 (1996), 799-817.

    Google Scholar 

  13. David, R. and Guillaume, B.: The lambda l calculus, Second International Workshop on Explicit Substitutions, Theory and Applications, 1999.

  14. de Bruijn, N.: A namefree lambda calculus with facilities for internal definition of expressions and segments, Technical report, Department of Mathematics, University of Eindhoven, Netherlands, 1978.

    Google Scholar 

  15. Gordon, M. J. C. and Melham, T. F.: Introduction to HOL: A Theorem Proving Environment for Higher Order Logic, Cambridge University Press, 1993.

  16. Hardin, T. and Laville, A.: Proof of termination of the rewriting system SUBST on CCL, Theoret. Comput. Sci. 46(2-3) (1986), 305-312.

    Article  Google Scholar 

  17. Hardin, T. and Lévy, J.-J.: A confluent calculus of substitutions, France-Japan Artificial Intelligence and Computer Science Symposium, December 1989.

  18. Hardin, T., Maranget, L. and Pagano, B.: Functional runtime systems within the lambda-sigma calculus, Funct. Programming 8(2) (1998), 131-176.

    Article  Google Scholar 

  19. Hashimoto, M. and Ohori, A.: A typed context calculus, Type Theory and Its Applications to Computer Systems (Japanese) 1023 (1998), 76-91.

    Google Scholar 

  20. Kamareddine, F. and Nederpelt, R. P.: On stepwise explicit substitution, Internat. J. Found. Comput. Sci. 4(3) (1993), 197-240.

    Google Scholar 

  21. Kamareddine, F. and Ríos, A.: A ?-calculus à la de Bruijn with explicit substitutions, in PLILP95, Lecture Notes in Comput. Sci. 982, Springer-Verlag, 1995, pp. 45-62.

  22. Kamareddine, F. and Ríos, A.: Extending a ?-calculus with explicit substitution which preserves strong normalisation into a confluent calculus on open terms, J. Funct. Programming 7(4) (1997), 395-420.

    Article  Google Scholar 

  23. Kamareddine, F. and Ríos, A.: Relating the ?s-and ?s-styles of explicit substitutions, Logic and Computation 10(3) (2000), 349-380.

    Google Scholar 

  24. Magnusson, L.: The implementation of ALF - a proof editor based on Martin-Löf’s monomorphic type theory with explicit substitution, Ph.D. thesis, Chalmers University of Technology and Göteborg University, January 1995.

  25. Martin-Löf, P.: An intuitionistic theory of types, Logic Colloquium’ 73, 1975.

  26. Sato, M., Sakurai, T. and Kameyama, Y.: A simply typed context calculus with first-class environments, Fifth International Symposium on Functional and Logic Programming, FLOPS’01, 2001.

  27. McKinna, J. and Pollack, R.: Pure type systems formalised, in M. Bezem and J. F. Groote (eds), Proceedings 1st Intl. Conf. on Typed Lambda Calculi and Applications, TLCA’93, Utrecht, The Netherlands, 16-18 March 1993, Lecture Notes in Comput. Sci. 664, Springer-Verlag, Berlin, 1993, pp. 289-305.

    Google Scholar 

  28. Muñoz, C.: Confluence and preservation of strong normalisation in an explicit substitutions calculus (extended abstract), in Proceedings of the Eleven Annual IEEE Symposium on Logic in Computer Science, New Brunswick, NJ, July 1996, IEEE Computer Society Press.

  29. Paulson, L. C.: Isabelle: The next 700 theorem provers, in P. Odifreddi (ed.), Logic and Computer Science, Academic Press, 1990, pp. 361-386.

  30. Ríos, A.: Contribution à l’étude des ?-calculs avec substitutions explicites, Ph.D. thesis, Université de Paris 7, 1993.

  31. Saïbi, A.: Formalisation of a ?-calculus with explicit substitutions in Coq, in P. Dybjer, B. Nordström and J. Smith (eds), Proceedings of the International Workshop on Types for Proofs and Programs, Båstad, Sweden, June 1994, LNCS 996, Springer-Verlag, pp. 183-202.

  32. Nordström, B., Altenkirch, T. and Gaspes, V.: A user’s guide to ALF, Technical report, University of Göteborg, 1994.

  33. Zantema, H.: Termination of term rewriting: interpretation and type elimination, J. Symbolic Comput. 17(1) (1994), 23-50. Conditional term rewriting systems (Pont-à-Mousson, 1992).

    Article  Google Scholar 

  34. Zantema, H.: Termination of term rewriting by semantic labelling, Fund. Inform. 24 (1995), 89-105.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematical and Computer Sciences, Heriot-Watt University, Edinburgh, UK

    Fairouz Kamareddine

  2. Computing Science, Chalmers University of Technology, Göteborg, Sweden

    Haiyan Qiao

Authors
  1. Fairouz Kamareddine
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Haiyan Qiao
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kamareddine, F., Qiao, H. Formalizing Strong Normalization Proofs of Explicit Substitution Calculi in ALF. Journal of Automated Reasoning 30, 59–98 (2003). https://doi.org/10.1023/A:1022527914293

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1022527914293

Search

Navigation