Lambda-representable functions over term algebras
DOI10.1142/S0129054101000394zbMATH Open1320.03038OpenAlexW2018999162MaRDI QIDQ5249246FDOQ5249246
Authors: Masako Takahashi 
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
Recommendations
term algebrasrecursion-theoretic characterizationfree structuresrecursive word functions\(\lambda_{\to}\)-representable functions
Combinatory logic and lambda calculus (03B40) Functional programming and lambda calculus (68N18) Recursive functions and relations, subrecursive hierarchies (03D20)
Cites Work
- A new recursion-theoretic characterization of the polytime functions
- The typed lambda-calculus is not elementary recursive
- A formulation of the simple theory of types
- \(\lambda\)-definability of free algebras
- Automatic synthesis of typed \(\Lambda\)-programs on term algebras
- Word operation definable in the typed \(\lambda\)-calculus
- Rekursive Wortfunktionen
- Definierbare Funktionen imλ-Kalkül mit Typen
- Functions over free algebras definable in the simply typed lambda calculus
Cited In (9)
- A generalization of the lambda algebra
- On the representation of semigroups and other congruences in the lambda calculus
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A characterization of lambda definable tree operations
- Word operation definable in the typed \(\lambda\)-calculus
This page was built for publication: Lambda-representable functions over term algebras
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5249246)
