Some new results on easy lambda-terms
This paper is devoted to easy terms, that is \(\lambda\)-terms \(X\) such that for each \(\lambda\)-term \(Y\) the equation \(X= Y\) is consistent. Two methods are used for investigating such terms. First a sufficient condition for the consistency of certain equations \(X= Y\) is given, based on some Church-Rosser extensions of the \(\lambda\)-calculus. Then, the use of continuity properties of Böhm trees provides a means to ensure the above sufficient condition. The authors exploit these tools to give examples of easiness, investigate the more general notion of ``normal form easiness, and provide a very detailed study of the relations between the two notions.
- scientific article; zbMATH DE number 3648679 (Why is no real title available?)
- scientific article; zbMATH DE number 3916224 (Why is no real title available?)
- scientific article; zbMATH DE number 3672266 (Why is no real title available?)
- scientific article; zbMATH DE number 23772 (Why is no real title available?)
- scientific article; zbMATH DE number 65759 (Why is no real title available?)
- scientific article; zbMATH DE number 3556025 (Why is no real title available?)
- The lambda calculus, its syntax and semantics
- Theoretical Pearls:Representing ‘undefined’ in lambda calculus
- Infinite \(\lambda\)-calculus and types
- Some examples of non-existent combinators
- On the Jacopini technique
- From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models
- Consistency argument and classification problem in -calculus
- Consistency of a -theory with n-tuples and easy term
- A class of bounded functions, a database language and an extended lambda calculus
- Marginalia to a theorem of Jacopini
- A note on discriminability of lambda terms
- Simple easy terms
- Graph easy sets of mute lambda terms
- Easy lambda-terms are not always simple
- scientific article; zbMATH DE number 3916224 (Why is no real title available?)
- scientific article; zbMATH DE number 23772 (Why is no real title available?)
- 1998 European Summer Meeting of the Association for Symbolic Logic
- Collapsing partial combinatory algebras
- \(Y_C \Omega_{2n}\) are easy terms
This page was built for publication: Some new results on easy lambda-terms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1314346)
