Skip to main content
SpringerLink
Log in

An abstract property of confluence applied to the study of the lazy partial lambda calculus

  • Conference paper
  • First Online:
Logical Foundations of Computer Science (LFCS 1994)

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

Included in the following conference series:

Abstract

The partial λ-calculus, introduced by E. Moggi, is a formalism well adapted to study the logic of programs in which the evaluation mechanism is call-by-value. In this paper we consider a lazy version of the partial λ-calculus. The main result is the Church-Rosser property for the class of strongly normalizable terms. First, we find sufficient conditions for confluence in an abstract framework. Then, we prove that our calculus satisfies those conditions.

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. Barendregt, H. (1984), “The Lambda Calculus: Its Syntax and Semantics”. North-Holland. Amsterdam. 1984.

    Google Scholar 

  2. Huet, G. (1980), Confluent Reductions: Abstract properties and application to term rewrite systems. Journal of ACM. vol. 27 no 4, pp797–821. 1980.

    Google Scholar 

  3. Moggi, E. (1988), The Partial Lambda Calculus, Ph.D. Thesis, University of Edinburgh.

    Google Scholar 

  4. Pino Pérez, R. (1991), A Strict Partial Combinatory Algebra Based on Lambda Terms. In “Proceedings of the Symposium Mathematical Foundations of Computer Science' 91”. September 9–13, 1991. Kazimierz Dolny, Poland. Lecture Notes in Computer Science. Vol. 520. Springer-Verlag. Berlin. 1991

    Google Scholar 

  5. Pino Pérez, R. (1992), Contribution à l'étude du Lambda Calcul Partiel, Ph.D. Thesis, University of Paris VII.

    Google Scholar 

  6. Plotkin, G. (1975), Call-by-name, call-by-value and the λ-calculus. Theoretical Computer Science (1), 1975.

    Google Scholar 

  7. Sethi, R. (1974), Testing for Church-Rosser Property. Journal of ACM. vol. 21, pp797–821. 1974.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Université de Lille I and LIFL U.A. 369 du CNRS, Cité Scientifique, 59655, Villeneuve d'Ascq, France

    Ramón Pino Pérez & Christian Even

Authors
  1. Ramón Pino Pérez
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Christian Even
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Anil Nerode Yu. V. Matiyasevich

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pérez, R.P., Even, C. (1994). An abstract property of confluence applied to the study of the lazy partial lambda calculus. In: Nerode, A., Matiyasevich, Y.V. (eds) Logical Foundations of Computer Science. LFCS 1994. Lecture Notes in Computer Science, vol 813. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58140-5_27

Download citation

  • DOI: https://doi.org/10.1007/3-540-58140-5_27

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58140-6

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation