Lambda-calculus, types and models
Lambda-calculus, types and models
Lambda abstraction algebras: representation theorems
AMAST '93 Selected papers of the international conference on Algebraic methodology of software technology
Information and Computation
Enlargements of functional algebras for the lambda calculus
Theoretical Computer Science
Functionality, polymorphism, and concurrency: a mathematical investigation of programming paradigms
Functionality, polymorphism, and concurrency: a mathematical investigation of programming paradigms
A finite equational axiomatization of the functional algebras for the lambda calculus
Information and Computation
Lambda abstraction algebras: coordinatizing models of Lambda calculus
Fundamenta Informaticae
On the algebraic models of Lambda calculus
Theoretical Computer Science - Modern algebra and its applications
A Representation Theorem for Lambda Abstraction Algebras
MFCS '93 Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science
Dimension-Complemented Lambda Abstraction Algebras
AMAST '93 Proceedings of the Third International Conference on Methodology and Software Technology: Algebraic Methodology and Software Technology
Theoretical Computer Science - Algebraic methods in language processing
| Hi-index | 0.00 |
The variety (equational class) of lambda abstraction algebras was introduced to algebraize the untyped lambda calculus in the same way cylindric and polyadic algebras algebraize the first-order predicate logic. In this paper we prove that the lattice of lambda theories is not modular and that the variety generated by the term algebra of a semi-sensible lambda theory is not congruence modular. Another result of the paper is that the Mal'cev condition for congruence modularity is inconsistent with the lambda theory generated by equating all the unsolvable λ-terms.