The lambda calculus is algebraic
From MaRDI portal
Recommendations
Cited in
(19)- Mechanized metatheory revisited
- C-system of a module over a \(Jf\)-relative monad
- scientific article; zbMATH DE number 5872263 (Why is no real title available?)
- A glimpse into the paradise of combinatory algebra
- Applying universal algebra to lambda calculus
- A Relational Model of a Parallel and Non-deterministic λ-Calculus
- A relational semantics for parallelism and non-determinism in a functional setting
- Execution time of λ-terms via denotational semantics and intersection types
- Relational graph models at work
- Addressing machines as models of \(\lambda\)-calculus
- Essential and relational models
- Classical lambda calculus in modern dress
- The internal operads of combinatory algebras
- Nominal Henkin semantics: simply-typed lambda-calculus models in nominal sets
- A weakly initial algebra for higher-order abstract syntax in Cedille
- Braids, twists, trace and duality in combinatory algebras
- Representation and duality of the untyped \(\lambda\)-calculus in nominal lattice and topological semantics, with a proof of topological completeness
- On combinatory algebras and their expansions
- An initial algebra approach to term rewriting systems with variable binders
This page was built for publication: The lambda calculus is algebraic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4709842)
