Lambda-representable functions over term algebras
From MaRDI portal
Publication:5249246
Recommendations
Cites work
- 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
- \(\lambda\)-definability of free algebras
Cited in
(9)- A generalization of the lambda algebra
- On the representation of semigroups and other congruences in the lambda calculus
- scientific article; zbMATH DE number 149520 (Why is no real title available?)
- scientific article; zbMATH DE number 2079020 (Why is no real title available?)
- scientific article; zbMATH DE number 176211 (Why is no real title available?)
- scientific article; zbMATH DE number 1333616 (Why is no real title available?)
- scientific article; zbMATH DE number 3837991 (Why is no real title available?)
- A characterization of lambda definable tree operations
- Word operation definable in the typed -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)