Lambda-representable functions over term algebras
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 149520
- Theoretical Pearls:Representing ‘undefined’ in lambda calculus
- Lambda representation of operations between different term algebras
- Word operation definable in the typed -calculus
- Subrecursion and lambda representation over free algebras. Preliminary summary
Cites work
- \(\lambda\)-definability of free algebras
- A formulation of the simple theory of types
- A new recursion-theoretic characterization of the polytime functions
- Automatic synthesis of typed -programs on term algebras
- Definierbare Funktionen imλ-Kalkül mit Typen
- Functions over free algebras definable in the simply typed lambda calculus
- Rekursive Wortfunktionen
- The typed lambda-calculus is not elementary recursive
- Word operation definable in the typed -calculus
Cited in
(9)- A generalization of the lambda algebra
- Word operation definable in the typed -calculus
- On the representation of semigroups and other congruences in the lambda calculus
- scientific article; zbMATH DE number 3837991 (Why is no real title available?)
- scientific article; zbMATH DE number 149520 (Why is no real title available?)
- Subrecursion and lambda representation over free algebras. Preliminary summary
- A representation theorem for lambda abstraction algebras
- Lambda representation of operations between different term algebras
- A characterization of lambda definable tree operations
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)