Skip to main content
SpringerLink
Log in

A left-linear variant of λσ

  • Lambda-Calculus
  • Conference paper
  • First Online:
Algebraic and Logic Programming (ALP 1997, HOA 1997)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1298))

  • 86 Accesses

Abstract

In this paper we consider λ-calculi of explicit substitutions that admit open expressions, i.e. expressions with meta-variables. In particular, we propose a variant of the λσ-calculus that we call λL. For this calculus and its simply-typed version, we study its meta-theoretical properties. The λL-calculus enjoys the same general characteristics as λσ, i.e. a simple and finitary first-order presentation, confluent on expressions with meta-variables of terms and weakly normalizing on typed expressions. Moreover, λL does not have the non-left-linear surjective pairing rule of λσ which raises technical problems in some frameworks.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Abadi, L. Cardelli, P.-L. Curien, and J.-J. Lévy. Explicit substitution. Journal of Functional Programming, 1(4):375–416, 1991.

    Google Scholar 

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

    Google Scholar 

  3. P.-L. Curien, T. Haxdin, and J.-J. Lévy. Confluence properties of weak and strong calculi of explicit substitutions. Journal of the ACM, 43(2):362–397, March 1996.

    Google Scholar 

  4. G. Dowek, T. Haxdin, and C. Kirchner. Higher-order unification via explicit substitutions (extended abstract). In Proceedings, Tenth Annual IEEE Symposium on Logic in Computer Science, pages 366–374, San Diego, California, 26–29 June 1995. IEEE Computer Society Press.

    Google Scholar 

  5. G. Dowek, T. Hardin, C. Kirchner, and F. Pfenning. Unification via explicit substitutions: The case of higher-order patterns. In M. Maher, editor, Proceedings of the Joint International Conference and Symposium on Logic Programming, Bonn, Germany, September 1996. MIT Press. To appear.

    Google Scholar 

  6. M. C. F. Ferreira, D. Kesner, and L. Puel. λ-calculi with explicit substitutions and composition which preserve β-strong normalization. LNCS, 1139, 1996.

    Google Scholar 

  7. H. Geuvers. A short and flexible proof of Strong Normalization for the Calculus of Constructions. In P. Dybjer and B. Nordström, editors, Types for Proofs and Programs, International Workshop TYPES'94, volume 996 of LNCS, pages 14–38, Båstad, Sweden, 1994. Springer.

    Google Scholar 

  8. J. Y. Giraxd, P. Taylor, and Y. Lafont. Proof and Types. Cambridge University Press, 1989.

    Google Scholar 

  9. J. Goubault-Larrecq. A proof of weak termination of typed λσ-calculi. Manuscript, 1997.

    Google Scholar 

  10. J. Goubault-Larrecq. Une preuve de terminaison faible du λσ-calcul. Technical Report RR-3090, Unité de recherche INRIA-Rocquencourt, Janvier 1997.

    Google Scholar 

  11. T. Hardin. Confluence results for the Pure Strong Categorical Logic CCC: λ-calculi as subsystems of CCL. Theoretical Computer Science, 65(2):291–342, 1989.

    Google Scholar 

  12. T. Hardin, L. Maranget, and B. Pagano.Functional back-ends and compilers within the lambda-sigma calculus. In Thomas Johnsson, editor, The Workshop on the Implementation of Functional Languages '95. Bastad, Sweden, September 1995.

    Google Scholar 

  13. G. Huet.Confluent reductions: Abstract properties and applications to term rewriting systems. J.A.C.M., 27(4), October 1980.

    Google Scholar 

  14. F. Kamareddine and A. Rios. A λ-calculus à la de Bruijn with explicit substitutions. In PLILP. LNCS, 1995.

    Google Scholar 

  15. D. Kapur, P. Narendran, and F. Otto. On ground-confluence of term rewriting systems. Information and Computation, 86(1):14–31, May 1990.

    Google Scholar 

  16. D. Kapur and H. Zhang. RRL: A rewrite rule laboratory-user's manual. Technical Report 89-03, Department of Computer Science, The University of Iowa, 1989.

    Google Scholar 

  17. D. Kesner. Confluence properties of extensional and non-extensional λ-calculi with explicit substitutions (extended abstract). In Harald Ganzinger, editor, Proceedings of the 7th International Conference on Rewriting Techniques and Applications (RTA-9B), volume 1103 of LNCS, pages 184–199, New Brunswick, NJ, USA, 1996. Springer-Verlag.

    Google Scholar 

  18. D. Kesner. Confluence of extensional and non-extensional λ-calculi with explicit substitutions. Preprint, 1997.

    Google Scholar 

  19. C. Kirchner and C. Ringeissen. Higher order equational unification via explicit substitutions. Preprint, 1996.

    Google Scholar 

  20. P. Lescanne. From λσ to λv a journey through calculi of explicit substitutions. In Proceedings of the 21st Annual ACMSIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 60–69, January 1994.

    Google Scholar 

  21. P. Lescanne and J. Rouyer-Degli. Explicit substitutions with de Bruijn's levels. In J. Hsiang, editor, Rewriting Techniques and Applications, volume 914 of LNCS, pages 294–308, Chapel Hill, North Carolina, 1995. Springer-Verlag.

    Google Scholar 

  22. L. Magnusson. The Implementation of ALF—A Proof Editor Based on Martin-Löf's Monomorphic Type Theory with Explicit Substitution. PhD thesis, Chalmers University of Technology and Göteborg University, January 1995.

    Google Scholar 

  23. P.-A. Melliès. Exemple de non terminaison forte dans un λσ-calcul typé où la priorité serait donnée aux deux règles shiftcons et varcons, modulo lois de monoïde. Preprint, 1995.

    Google Scholar 

  24. P.-A. Melliès. Typed λ-calculi with explicit substitutions may not terminate. In Typed Lambda Calculi and Applications, number 902 in LNCS. Second International Conference TLCA'95, Springer-Verlag, 1995.

    Google Scholar 

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

    Google Scholar 

  26. C. Muñoz. Proof representation in type theory: State of the art. In Proceedings, XXII Latinamerican Conference of Informatics CLEI Panel 96, Santafé de Bogotá, Colombia, June 1996.

    Google Scholar 

  27. C. Muñoz. Dependent types with explicit substitutions: A meta-theoretical development. Preprint electronically available at: http://pauillac.inria.fr/~cesar/Papers/typ96.ps.gz, 1997.

    Google Scholar 

  28. C. Muñoz. Meta-theoretical properties of λø: A left-linear variant of λσ Technical Report RR-3107, Unité de recherche INRIA-Rocquencourt, Février 1997.

    Google Scholar 

  29. G. Nadathur. A fine-grained notation for lambda terms and its use in intensional operations. Technical Report TR-96-13, Department of Computer Science, University of Chicago, May 30 1996.

    Google Scholar 

  30. G. Nadathur. The (SCons) rule. Personal communication, 1996.

    Google Scholar 

  31. B. Pagano. Confluent extensions of λ↙ Personal communication, 1996.

    Google Scholar 

  32. A. Ríos. Contributions à l'étude de λ-calculs avec des substitutions explicites. PhD thesis, U. Paris VII, 1993.

    Google Scholar 

  33. M. Schmidt-Schauss. Computational aspects of an order-sorted logic with term declarations, volume 395 of Lecture Notes in Computer Science and Lecture Notes in Artificial Intelligence. Springer-Verlag Inc., New York, NY, USA, 1989.

    Google Scholar 

  34. H. Yokouchi and T. Hikita. A rewriting system for categorical combinators with multiple arguments. SIAM Journal on Computing, 19(1):78–97, February 1990.

    Google Scholar 

  35. H. Zantema. Termination of term rewriting by semantic labelling. Fundamenta Informaticae, 24:89–105, 1995.

    Google Scholar 

  36. H. Zantema. Termination of ø and II ø by semantic labelling. Personal communication, 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. INRIA Rocquencourt, B.P. 105, 78153, Le Chesnay Cedex, France

    A. César & H. Muñoz

Authors
  1. A. César
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. H. Muñoz
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Michael Hanus Jan Heering Karl Meinke

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

César, A., Muñoz, H. (1997). A left-linear variant of λσ. In: Hanus, M., Heering, J., Meinke, K. (eds) Algebraic and Logic Programming. ALP HOA 1997 1997. Lecture Notes in Computer Science, vol 1298. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0027013

Download citation

  • DOI: https://doi.org/10.1007/BFb0027013

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63459-1

  • Online ISBN: 978-3-540-69555-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation