Enumerators of lambda terms are reducing constructively (Q1891248): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: The lambda calculus, its syntax and semantics / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: <i>Theoretical Pearls</i>Enumerators of lambda terms are reducing / 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: Q5573961 / rank | |||
Normal rank | |||
Revision as of 14:41, 23 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Enumerators of lambda terms are reducing constructively |
scientific article |
Statements
Enumerators of lambda terms are reducing constructively (English)
0 references
27 August 1995
0 references
lambda calculus
0 references
reducing enumerator
0 references
intuitionistic version of Statman's proof
0 references
