Skip to main content
SpringerLink
Log in

Every Unsolvable λ Term has a Decoration

  • Conference paper
  • First Online:
Typed Lambda Calculi and Applications (TLCA 1999)

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

Included in the following conference series:

  • 468 Accesses

Abstract

I give a proof of the conjecture stated in [2] by R.Kerth: Every unsolvable λ term has a decoration.

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. R. Kerth “Isomorphisme et équivalence équationnelle entre modèles du λ calcul” Ph.D. thesis Université Paris 7, 1995.

    Google Scholar 

  2. R. Kerth “The interpretation of Unsolvable λ Terms in Models of Untyped λ Calculus”. To appear in the JSL 98

    Google Scholar 

  3. R. Kerth “On the Construction of Stable Models of Untyped λ Calculus”. To appear in TCS

    Google Scholar 

  4. R. David & K. Nour “Storage operators and directed λ calculus”. JSL 60,n°4; 1054–1086, 1995.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire de Mathématiques, Université de Savoie F, 73376, Le Bourget du Lac, France

    René David

Authors
  1. René David
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. CNRS - UPR9016, Institut de Mathématiques de Luminy, 163 Avenue de Luminy, case 907, F-13288, Marseille cedex 9, France

    Jean-Yves Girard

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

David, R. (1999). Every Unsolvable λ Term has a Decoration. In: Girard, JY. (eds) Typed Lambda Calculi and Applications. TLCA 1999. Lecture Notes in Computer Science, vol 1581. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48959-2_9

Download citation

  • DOI: https://doi.org/10.1007/3-540-48959-2_9

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65763-7

  • Online ISBN: 978-3-540-48959-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation