Applying Universal Algebra to Lambda Calculus

DOI10.1093/LOGCOM/EXN085zbMath1216.03030OpenAlexW2020095493MaRDI QIDQ3583100

Giulio Manzonetto, Antonino Salibra

Publication date: 26 August 2010

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/10a5565be5302c1be4f6f91e12a7e8fff7d99204

zbMATH Keywords

lambda calculusstable semanticscentral elementsStone representation theoremlambda abstraction algebrasBoolean productscombinatory algebraslambda theoriesindecomposable semanticsScott-continuous semanticsstrongly stable semantics

Mathematics Subject Classification ID

Applications of universal algebra in computer science (08A70) Combinatory logic and lambda calculus (03B40)

Related Items (9)

What is a categorical model of the differential and the resource λ-calculi? ⋮ Boolean-like algebras ⋮ Boolean product representations of algebras via binary polynomials ⋮ Imaginary groups: lazy monoids and reversible computation ⋮ Quasi-discriminator varieties ⋮ Representation and duality of the untyped \(\lambda\)-calculus in nominal lattice and topological semantics, with a proof of topological completeness ⋮ Coextensive varieties via central elements ⋮ On the completeness of order-theoretic models of the \(\lambda \)-calculus ⋮ Two-level nominal sets and semantic nominal terms: an extension of nominal set theory for handling meta-variables

This page was built for publication: Applying Universal Algebra to Lambda Calculus