Applying universal algebra to lambda calculus

DOI10.1093/LOGCOM/EXN085MaRDI QIDQ3583100zbMATH OpenOpenAlexFDO

Authors 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

Boolean productscentral elementscombinatory algebrasindecomposable semanticslambda abstraction algebraslambda calculuslambda theoriesScott-continuous semanticsstable semanticsStone representation theoremstrongly stable semantics

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1183249
• scientific article; zbMATH DE number 1136648
• The lambda calculus is algebraic
• scientific article; zbMATH DE number 1333616
• On the algebraic models of lambda calculus

Cited in

(23)

• On the completeness of order-theoretic models of the \(\lambda \)-calculus
• A generalization of the lambda algebra
• Algebra of constructions. I. The word problem for partial algebras
• Adding algebraic rewriting to the untyped lambda calculus
• Consistency argument and classification problem in -calculus
• Coextensive varieties via central elements
• What is a categorical model of the differential and the resource \(\lambda \)-calculi?
• Two-level nominal sets and semantic nominal terms: an extension of nominal set theory for handling meta-variables
• A glimpse into the paradise of combinatory algebra
• Boolean-like algebras
• From λ-Calculus to Universal Algebra and Back
• scientific article; zbMATH DE number 1222100 (Why is no real title available?)
• Boolean product representations of algebras via binary polynomials
• The lambda calculus is algebraic
• The Lattice of Lambda Theories
• -groupoid generated by an arbitrary topological -model
• Quasi-discriminator varieties
• Imaginary groups: lazy monoids and reversible computation
• Types for Proofs and Programs
• Boolean-like algebras of finite dimension: from Boolean products to semiring products
• Nominal Henkin semantics: simply-typed lambda-calculus models in nominal sets
• Universal algebra in UniMath
• Representation and duality of the untyped \(\lambda\)-calculus in nominal lattice and topological semantics, with a proof of topological completeness

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)