You are viewing a javascript disabled version of the site. Please enable Javascript for this site to function properly.
Go to headerGo to navigationGo to searchGo to contentsGo to footer
In content section. Select this link to jump to navigation

Easy Terms in the Lambda Calculus

Article type: Research Article

Authors: Jacopini, Giuseppe | Venturini Zilli, Marisa

Affiliations: Istituto per le Applicazioni del Calcolo, CNR-Roma

Abstract: This paper, a revised version of the one [4] presented at the Logic Colloquium ’82, concerns closed unsolvable λ-terms, named easy, which are terms such that they can be consistently equated to arbitrary closed ones. Some general results are obtained, mainly sufficient or necessary conditions for proving that an unsolvable λ-term is easy.

Keywords: lambda calculus, unsolvable terms, easy terms, extension of a theory

DOI: 10.3233/FI-1985-8205

Journal: Fundamenta Informaticae, vol. 8, no. 2, pp. 225-233, 1985

Received 30 March 1984
|
Published: 1 April 1985
Price: EUR 27.50
Show more