The lambda calculus is algebraic

DOI10.1017/S0956796801004294zbMath1040.68023OpenAlexW2060305077MaRDI QIDQ4709842

Peter Selinger

Publication date: 2002

Published in: Journal of Functional Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0956796801004294

zbMATH Keywords

untyped lambda calculus\(\xi\)-rule

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Related Items (11)

An initial algebra approach to term rewriting systems with variable binders ⋮ Execution time of λ-terms via denotational semantics and intersection types ⋮ A relational semantics for parallelism and non-determinism in a functional setting ⋮ C-system of a module over a \(Jf\)-relative monad ⋮ A Relational Model of a Parallel and Non-deterministic λ-Calculus ⋮ Representation and duality of the untyped \(\lambda\)-calculus in nominal lattice and topological semantics, with a proof of topological completeness ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Mechanized metatheory revisited ⋮ Essential and relational models ⋮ Classical lambda calculus in modern dress

This page was built for publication: The lambda calculus is algebraic