Skip to main content
SpringerLink
Log in

Infinitary lambda calculi and böhm models

  • Regular Papers
  • Conference paper
  • First Online:
Rewriting Techniques and Applications (RTA 1995)

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

Included in the following conference series:

Abstract

In a previous paper we have established the theory of transfinite reduction for orthogonal term rewriting systems. In this paper we perform the same task for the lambda calculus. This results in several new Böhm-like models of the lambda calculus, and new descriptions of existing models.

The authors were partially supported by SEMAGRAPH II (ESPRIT working group 6345). Richard Kennaway was also supported by a SERC Advanced Fellowship, and by SERC Grant no. GR/F 91582. From July 1995 Fer-Jan de Vries will be at the Hitachi Advanced Research Laboratory, Hatoyama, Saitama 350-03, Japan.

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. Z.M. Ariola, J.R. Kennaway, J.W. Klop, M.R. Sleep, and F.J. de Vries. Syntactic definitions of undefined: On defining the undefined. In Int. Symp. on Theoretical Aspects of Computer Software, Sendai, pages 543–554, 1994. Lecture Notes in Computer Science, vol. 789.

    Google Scholar 

  2. S. Abramsky and L. Ong. Full abstraction in the lazy lambda calculus. Inf. and Comp., 105:159–267, 1993.

    Article  Google Scholar 

  3. H.P. Barendregt. The Lambda Calculus, its Syntax and Semantics. North-Holland, 2nd edition, 1984.

    Google Scholar 

  4. A. Berarducci. Infinite λ-calculus and non-sensible models. Presented to the conference in honour of Roberto Magari, Siena 1994.

    Google Scholar 

  5. A. Berarducci and B. Intrigila. Church-rosser λ-theories, infinite λ-terms and consistency problems. Dipartimento di Matematica, Università di Pisa, October 1994.

    Google Scholar 

  6. J.R. Kennaway. On transfinite abstract reduction systems. Technical Report CS-9205, CWI, Amsterdam, 1992.

    Google Scholar 

  7. J.R. Kennaway, J.W. Klop, M.R. Sleep, and F.J. de Vries. Transfinite reductions in orthogonal term rewriting systems. Information and Computation, 199-. To appear; available by ftp from ftp::/ftp.sys.uea.ac.uk/pub/kennaway/transfinite. {dvi,ps}.Z.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Information Systems, University of East Anglia, NR4 7TJ, Norwich, UK

    Richard Kennaway & Ronan Sleep

  2. Department of Software Technology, CWI, P.O. Box 94079, 1090, GB Amsterdam, The Netherlands

    Jan Willem Klop

  3. NTT Communication Science Laboratories, Hikaridai, Seika-cho, Soraku-gun, 619-02, Kyoto, Japan

    Fer-Jan de Vries

Authors
  1. Richard Kennaway
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jan Willem Klop
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ronan Sleep
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Fer-Jan de Vries
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jieh Hsiang

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kennaway, R., Klop, J.W., Sleep, R., de Vries, FJ. (1995). Infinitary lambda calculi and böhm models. In: Hsiang, J. (eds) Rewriting Techniques and Applications. RTA 1995. Lecture Notes in Computer Science, vol 914. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59200-8_62

Download citation

  • DOI: https://doi.org/10.1007/3-540-59200-8_62

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-49223-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation