\(\lambda\)-definability of free algebras

DOI10.1016/0168-0072(91)90019-IzbMath0727.03010OpenAlexW2086662978MaRDI QIDQ803116

Marek Zaionc

Publication date: 1991

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0168-0072(91)90019-i

zbMATH Keywords

representabilityfree algebrastyped lambda-calculus\(\lambda \) -language over a simple type structuresecond-order types

Mathematics Subject Classification ID

Free algebras (08B20) Combinatory logic and lambda calculus (03B40)

Related Items

Infiniteness of \(\text{proof}(\alpha)\) is polynomial-space complete, LAMBDA-REPRESENTABLE FUNCTIONS OVER TERM ALGEBRAS, Ordinals and ordinal functions representable in the simply typed lambda calculus, Functions over free algebras definable in the simply typed lambda calculus, Implicit computation complexity in higher-order programming languages

Cites Work

• A characterization of lambda definable tree operations
• Automatic synthesis of typed \(\Lambda\)-programs on term algebras
• 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
• Intuitionistic propositional logic is polynomial-space complete
• Definierbare Funktionen imλ-Kalkül mit Typen
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item