Skip to main content
SpringerLink
Log in

A Coinductive Confluence Proof for Infinitary Lambda-Calculus

  • Conference paper
Book cover Rewriting and Typed Lambda Calculi (RTA 2014, TLCA 2014)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8560))

Abstract

We give a coinductive proof of confluence, up to equivalence of root-active subterms, of infinitary lambda-calculus. We also show confluence of Böhm reduction (with respect to root-active terms) in infinitary lambda-calculus. In contrast to previous proofs, our proof makes heavy use of coinduction and does not employ the notion of descendants.

Partly supported by NCN grant 2012/07/N/ST6/03398.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abel, A., Pientka, B.: Wellfounded recursion with copatterns: a unified approach to termination and productivity. In: Morrisett, G., Uustalu, T. (eds.) ICFP, pp. 185–196. ACM (2013)

    Google Scholar 

  2. Barendregt, H., Klop, J.W.: Applications of infinitary lambda calculus. Information and Computation 207(5), 559–582 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  3. Berarducci, A.: Infinite lambda-calculus and non-sensible models. In: Ursini, A., Aglianò, P. (eds.) Logic and Algebra. Lecture Notes in Pure and Applied Mathematics Series, vol. 180, pp. 339–378 (1996)

    Google Scholar 

  4. Chlipala, A.: Certified Programming with Dependent Types, ch. 5. The MIT Press (2013)

    Google Scholar 

  5. Endrullis, J., Hendriks, D., Klop, J.W.: Highlights in infinitary rewriting and lambda calculus. Theoretical Computer Science 464, 48–71 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  6. Endrullis, J., Polonsky, A.: Infinitary rewriting coinductively. In: Danielsson, N.A., Nordström, B. (eds.) TYPES. LIPIcs, vol. 19, pp. 16–27. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2011)

    Google Scholar 

  7. Giménez, E.: Codifying guarded definitions with recursive schemes. In: Smith, J., Dybjer, P., Nordström, B. (eds.) TYPES 1994. LNCS, vol. 996, pp. 39–59. Springer, Heidelberg (1995)

    Chapter  Google Scholar 

  8. Jacobs, B., Rutten, J.J.M.M.: An introduction to (co)algebras and (co)induction. In: Advanced Topics in Bisimulation and Coinduction, pp. 38–99. Cambridge University Press (2011)

    Google Scholar 

  9. Joachimski, F.: Confluence of the coinductive [lambda]-calculus. Theoretical Computer Science 311(1-3), 105–119 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  10. Kennaway, R., Klop, J.W., Sleep, M.R., de Vries, F.-J.: Infinitary lambda calculi and Böhm models. In: Hsiang, J. (ed.) RTA 1995. LNCS, vol. 914, pp. 257–270. Springer, Heidelberg (1995)

    Chapter  Google Scholar 

  11. Kennaway, R., Klop, J.W., Sleep, M.R., de Vries, F.-J.: Infinitary lambda calculus. Theoretical Computer Science 175(1), 93–125 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  12. Rutten, J.J.M.M.: Universal coalgebra: a theory of systems. Theoretical Computer Science 249(1), 3–80 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  13. Severi, P., de Vries, F.-J.: An extensional Böhm model. In: Tison, S. (ed.) RTA 2002. LNCS, vol. 2378, pp. 159–173. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  14. Terese: Term Rewriting Systems. Cambridge Tracts in Theoretical Computer Science, vol. 55. Cambridge University Press (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Informatics, University of Warsaw, Banacha 2, 02-097, Warszawa, Poland

    Łukasz Czajka

Authors
  1. Łukasz Czajka
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Inria, 23 avenue d’Italie, CS 81321, 75214, Paris Cedex 13, France

    Gilles Dowek

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Czajka, Ł. (2014). A Coinductive Confluence Proof for Infinitary Lambda-Calculus. In: Dowek, G. (eds) Rewriting and Typed Lambda Calculi. RTA TLCA 2014 2014. Lecture Notes in Computer Science, vol 8560. Springer, Cham. https://doi.org/10.1007/978-3-319-08918-8_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-08918-8_12

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-08917-1

  • Online ISBN: 978-3-319-08918-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation