LAMBDA-REPRESENTABLE FUNCTIONS OVER TERM ALGEBRAS
From MaRDI portal
Publication:5249246
DOI10.1142/S0129054101000394zbMath1320.03038OpenAlexW2018999162MaRDI QIDQ5249246
Publication date: 30 April 2015
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054101000394
term algebrasrecursion-theoretic characterizationfree structuresrecursive word functions\(\lambda_{\to}\)-representable functions
Functional programming and lambda calculus (68N18) Recursive functions and relations, subrecursive hierarchies (03D20) Combinatory logic and lambda calculus (03B40)
Cites Work
- \(\lambda\)-definability of free algebras
- Automatic synthesis of typed \(\Lambda\)-programs on term algebras
- Word operation definable in the typed \(\lambda\)-calculus
- A new recursion-theoretic characterization of the polytime functions
- The typed lambda-calculus is not elementary recursive
- Functions over free algebras definable in the simply typed lambda calculus
- Rekursive Wortfunktionen
- Definierbare Funktionen imλ-Kalkül mit Typen
- A formulation of the simple theory of types
This page was built for publication: LAMBDA-REPRESENTABLE FUNCTIONS OVER TERM ALGEBRAS