A characterization of lambda definable tree operations
From MaRDI portal
Publication:918191
DOI10.1016/0890-5401(90)90019-EzbMath0705.68029MaRDI QIDQ918191
Publication date: 1990
Published in: Information and Computation (Search for Journal in Brave)
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (2)
\(\lambda\)-definability of free algebras ⋮ Implicit computation complexity in higher-order programming languages
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Word operation definable in the typed \(\lambda\)-calculus
- The lambda calculus, its syntax and semantics
- On the existence of closed terms in the typed lambda calculus II: Transformations of unification problems
- A unification algorithm for typed \(\overline\lambda\)-calculus
- The typed lambda-calculus is not elementary recursive
- λ-definable functionals andβη conversion
This page was built for publication: A characterization of lambda definable tree operations
