Functions over free algebras definable in the simply typed lambda calculus

DOI10.1016/0304-3975(93)90092-8zbMath0792.03006OpenAlexW2071051275WikidataQ126839021 ScholiaQ126839021MaRDI QIDQ1314357

Daniel Leivant

Publication date: 20 July 1994

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(93)90092-8

zbMATH Keywords

free algebrasimply typed \(\lambda\)-calculusBöhm-Berarducci embeddingpredicative monotonic recurrencetiers

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Related Items (3)

Expressing computational complexity in constructive type theory ⋮ LAMBDA-REPRESENTABLE FUNCTIONS OVER TERM ALGEBRAS ⋮ Ordinals and ordinal functions representable in the simply typed lambda calculus

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(\lambda\)-definability of free algebras
• Automatic synthesis of typed \(\Lambda\)-programs on term algebras
• The realm of primitive recursion
• A new recursion-theoretic characterization of the polytime functions
• The typed lambda-calculus is not elementary recursive
• Definierbare Funktionen imλ-Kalkül mit Typen
• La prédicativité

This page was built for publication: Functions over free algebras definable in the simply typed lambda calculus