A characterization of lambda definable tree operations

DOI10.1016/0890-5401(90)90019-EMaRDI QIDQ918191zbMATH OpenFDO

Authors Marek Zaionc

Publication date 1990

Published in Information and Computation (Search for Journal in Brave)

zbMATH Keywords

binary treestyped lambda calculus

Mathematics Subject Classification ID

Theory of programming languages (68N15) Data structures (68P05) Combinatory logic and lambda calculus (03B40)

Recommendations

• scientific article; zbMATH DE number 475247
• Lambda-representable functions over term algebras
• scientific article; zbMATH DE number 149520
• scientific article; zbMATH DE number 4072354
• \(\lambda\)-definability of free algebras

Cites work

• scientific article; zbMATH DE number 3928956 (Why is no real title available?)
• scientific article; zbMATH DE number 3935004 (Why is no real title available?)
• scientific article; zbMATH DE number 3485758 (Why is no real title available?)
• scientific article; zbMATH DE number 3280068 (Why is no real title available?)
• A unification algorithm for typed -calculus
• On the existence of closed terms in the typed lambda calculus II: Transformations of unification problems
• The lambda calculus, its syntax and semantics
• The typed lambda-calculus is not elementary recursive
• Word operation definable in the typed -calculus
• λ-definable functionals andβη conversion

Cited in

(6)

• Implicit computation complexity in higher-order programming languages
• scientific article; zbMATH DE number 2113953 (Why is no real title available?)
• scientific article; zbMATH DE number 149520 (Why is no real title available?)
• A Characterisation of Lambda Definability with Sums Via ⊤ ⊤-Closure Operators
• \(\lambda\)-definability of free algebras
• scientific article; zbMATH DE number 475247 (Why is no real title available?)

This page was built for publication: A characterization of lambda definable tree operations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q918191)