Applying universal algebra to lambda calculus
From MaRDI portal
Publication:3583100
Recommendations
Cited in
(20)- From λ-Calculus to Universal Algebra and Back
- The lambda calculus is algebraic
- A generalization of the lambda algebra
- Boolean-like algebras
- Coextensive varieties via central elements
- A glimpse into the paradise of combinatory algebra
- Adding algebraic rewriting to the untyped lambda calculus
- The Lattice of Lambda Theories
- Consistency argument and classification problem in \(\lambda\)-calculus
- Boolean product representations of algebras via binary polynomials
- What is a categorical model of the differential and the resource \(\lambda \)-calculi?
- Quasi-discriminator varieties
- On the completeness of order-theoretic models of the \(\lambda \)-calculus
- Imaginary groups: lazy monoids and reversible computation
- Representation and duality of the untyped \(\lambda\)-calculus in nominal lattice and topological semantics, with a proof of topological completeness
- Algebra of constructions. I. The word problem for partial algebras
- Two-level nominal sets and semantic nominal terms: an extension of nominal set theory for handling meta-variables
- Types for Proofs and Programs
- \(\infty\)-groupoid generated by an arbitrary topological \(\lambda\)-model
- scientific article; zbMATH DE number 1222100 (Why is no real title available?)
This page was built for publication: Applying universal algebra to lambda calculus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3583100)