Theoretical Pearls:<i>Representing ‘undefined’ in lambda calculus</i> (Q4764617): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Classifying positive equivalence relations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The lambda calculus. Its syntax and semantics. Rev. ed. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5573961 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: \(\lambda\)-definability and recursiveness / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Theorie der Numerierungen I / rank | |||
Normal rank |
Revision as of 12:16, 23 May 2024
scientific article; zbMATH DE number 751121
Language | Label | Description | Also known as |
---|---|---|---|
English | Theoretical Pearls:<i>Representing ‘undefined’ in lambda calculus</i> |
scientific article; zbMATH DE number 751121 |
Statements
Theoretical Pearls:<i>Representing ‘undefined’ in lambda calculus</i> (English)
0 references
20 July 1995
0 references
\(\lambda\)-definability of partial recursive functions
0 references