Some new results on easy lambda-terms
From MaRDI portal
Publication:1314346
DOI10.1016/0304-3975(93)90084-7zbMath0796.03022OpenAlexW1973343695MaRDI QIDQ1314346
Alessandro Berarducci, Benedetto Intrigila
Publication date: 3 March 1994
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(93)90084-7
Related Items
1998 European Summer Meeting of the Association for Symbolic Logic, Easy lambda-terms are not always simple, Graph easy sets of mute lambda terms, A class of bounded functions, a database language and an extended lambda calculus, On the Jacopini technique, Collapsing partial combinatory algebras, \(Y_C \Omega_{2n}\) are easy terms, Infinite \(\lambda\)-calculus and types, Simple Easy Terms, From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models, Some examples of non-existent combinators
Cites Work
