Some new results on easy lambda-terms (Q1314346): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0304-3975(93)90084-7 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1973343695 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3206926 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The lambda calculus, its syntax and semantics / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Theoretical Pearls:<i>Representing ‘undefined’ in lambda calculus</i> / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3982064 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4128535 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3869319 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3691635 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4010370 / rank | |||
Normal rank |
Latest revision as of 13:03, 22 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Some new results on easy lambda-terms |
scientific article |
Statements
Some new results on easy lambda-terms (English)
0 references
3 March 1994
0 references
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.
0 references
lambda calculus
0 references
easy terms
0 references
Böhm trees
0 references
easiness
0 references