Applying Universal Algebra to Lambda Calculus
From MaRDI portal
Publication:3583100
DOI10.1093/logcom/exn085zbMath1216.03030MaRDI 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
lambda calculus; stable semantics; central elements; Stone representation theorem; lambda abstraction algebras; Boolean products; combinatory algebras; lambda theories; indecomposable semantics; Scott-continuous semantics; strongly stable semantics
08A70: Applications of universal algebra in computer science
03B40: Combinatory logic and lambda calculus
Related Items
Boolean product representations of algebras via binary polynomials, Quasi-discriminator varieties, Imaginary groups: lazy monoids and reversible computation, Boolean-like algebras, Representation and duality of the untyped \(\lambda\)-calculus in nominal lattice and topological semantics, with a proof of topological completeness, On the completeness of order-theoretic models of the \(\lambda \)-calculus, Coextensive varieties via central elements, What is a categorical model of the differential and the resource λ-calculi?, Two-level nominal sets and semantic nominal terms: an extension of nominal set theory for handling meta-variables
