A characterization of lambda definable tree operations
- 1 November 1990
- journal article
- Published by Elsevier in Information and Computation
- Vol. 89 (1) , 35-46
- https://doi.org/10.1016/0890-5401(90)90019-e
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Word operation definable in the typed λ-calculusTheoretical Computer Science, 1987
- The typed λ-calculus is not elementary recursiveTheoretical Computer Science, 1979
- A unification algorithm for typed