Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Intrigila, Benedetto
Affiliations: V.le Parioli 41, 00197 Rome, Italy
Abstract: We say that a closed term M is easy in the λβη-calculus if for every term N the theory λβη+{M=N} is consistent. The main result of the paper is to show that, for a certain term P, the term P(ωω) is easy, while Pω is not. It follows that the easiness of a given M does not imply either easiness or non-easiness of PM, contradicting an earlier conjecture.
DOI: 10.3233/FI-1991-15109
Journal: Fundamenta Informaticae, vol. 15, no. 1, pp. 99-106, 1991
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
[email protected]
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office [email protected]
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
如果您在出版方面需要帮助或有任何建, 件至: [email protected]