Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
My Menu
Marked Items 
Alerts
Order History
Saved Items
All
Favorites
    
Book Chapter Printable view
Every Unsolvable λ Term has a Decoration

Every Unsolvable λ Term has a Decoration

Book SeriesLecture Notes in Computer Science
PublisherSpringer Berlin / Heidelberg
ISSN0302-9743 (Print) 1611-3349 (Online)
VolumeVolume 1581/1999
BookTyped Lambda Calculi and Applications
DOI10.1007/3-540-48959-2
Copyright1999
ISBN978-3-540-65763-7
DOI10.1007/3-540-48959-2_9
Page643
Subject CollectionComputer Science
SpringerLink DateFriday, January 01, 1999
Add to marked items

9. Every Unsolvable λ Term has a Decoration

René David5 Contact Information

(5)  Laboratoire de Mathématiques, Université de Savoie F, 73376 Le Bourget du Lac, France
Abstract
I give a proof of the conjecture stated in [2] by R.Kerth: Every unsolvable λ term has a decoration.

Contact Information René David
Email: david@univ-savoie.fr
Fulltext Preview (Small, Large)
Image of the first page of the fulltext

References secured to subscribers.
more options
Find


Export this chapter
Export this chapter as RIS | Text
 
Frequently asked questions | General information on journals and books | Send us your feedback | Impressum | Contact
© Springer. Part of Springer Science+Business Media
Privacy, Disclaimer, Terms and Conditions, © Copyright Information
Remote Address: 38.107.191.109 • Server: mpweb01
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)