On the public citation graph
Boolean Algebras for Lambda Calculus
0 signed · 41 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/jabr.1996.0268openalex-snapshot
Varieties in Which the Pierce Stalks Are Directly Indecomposable
inferredcites →https://doi.org/10.1007/978-1-4613-8130-3openalex-snapshot
A Course in Universal Algebra
inferredcites →https://doi.org/10.1007/bf01448013openalex-snapshot
Über die Bausteine der mathematischen Logik
inferredcites →https://doi.org/10.1016/0022-0000(92)90040-popenalex-snapshot
An approximation theorem for topological lambda models and the topological incompleteness of lambda calculus
inferredcites →https://doi.org/10.1016/0168-0072(91)90065-topenalex-snapshot
Domain theory in logical form*
inferredcites →https://doi.org/10.1016/0304-3975(93)90094-aopenalex-snapshot
Set-theoretical and other elementary models of the λ-calculus
inferredcites →https://doi.org/10.1016/c2009-0-14341-6openalex-snapshot
The Lambda Calculus - Its Syntax and Semantics
inferredcites →https://doi.org/10.1016/s0168-0072(99)00015-9openalex-snapshot
Strong stability and the incompleteness of stable models for λ-calculus
inferredcites →https://doi.org/10.1016/s0304-3975(00)00057-8openalex-snapshot
From computation to foundations via functions and application: The λ-calculus and its webbed models
inferredcites →https://doi.org/10.1016/s0304-3975(00)00059-1openalex-snapshot
On the algebraic models of lambda calculus
inferredcites →https://doi.org/10.1016/s0304-3975(00)00371-6openalex-snapshot
On the construction of stable models of untyped λ-calculus
inferredcites →https://doi.org/10.1016/s0304-3975(02)00038-5openalex-snapshot
Order-incompleteness and finite lambda reduction models
inferredcites →https://doi.org/10.1017/s0960129506005123openalex-snapshot
Graph models of $\lambda$-calculus at work, and variations
inferredcites →https://doi.org/10.1023/a:1005018121791openalex-snapshot
Isomorphism and Equational Equivalence of Continuous λ-Models
inferredcites →https://doi.org/10.1090/memo/0070openalex-snapshot
Modules over commutative regular rings
inferredcites →https://doi.org/10.1093/logcom/14.3.373openalex-snapshot
The Lattice of Lambda Theories
inferredcites →https://doi.org/10.1109/lics.1991.151638openalex-snapshot
Sequentiality and strong stability
inferredcites →https://doi.org/10.1109/lics.2001.932509openalex-snapshot
A continuum of theories of lambda calculus without semantics
inferredcites →https://doi.org/10.1109/lics.2004.1319622openalex-snapshot
The sensible graph theories of lambda calculus
inferredcites →https://doi.org/10.1145/772062.772067openalex-snapshot
Topological incompleteness and order incompleteness of the lambda calculus
inferredcites →https://doi.org/10.2140/pjm.1971.38.29openalex-snapshot
Representations by algebras of sections over Boolean spaces
inferredcites →https://doi.org/10.2307/2273659openalex-snapshot
A filter lambda model and the completeness of type assignment
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-031-44490-6_13openalex-snapshot
Boolean-Like Algebras of Finite Dimension: From Boolean Products to Semiring Products
inferred← citeshttps://doi.org/10.1007/978-3-540-85238-4_39openalex-snapshot
From λ-Calculus to Universal Algebra and Back
inferred← citeshttps://doi.org/10.1007/978-3-642-15155-2_22openalex-snapshot
Resource Combinatory Algebras
inferred← citeshttps://doi.org/10.1016/j.ic.2008.03.027openalex-snapshot
On the completeness of order-theoretic models of the λ-calculus
inferred← citeshttps://doi.org/10.1017/s0960129509990053openalex-snapshot
Effective λ-models versus recursively enumerable λ-theories
inferred← citeshttps://doi.org/10.1017/s0960129515000377openalex-snapshot
Classical lambda calculus in modern dress
inferred← citeshttps://doi.org/10.1093/logcom/exn055openalex-snapshot
Nominal Algebra and the HSP Theorem
inferred← citeshttps://doi.org/10.1093/logcom/exn085openalex-snapshot
Applying Universal Algebra to Lambda Calculus
inferred← citeshttps://doi.org/10.4230/lipics.csl.2016.11openalex-snapshot
Models and theories of lambda calculus
inferred← citeshttps://doi.org/10.48550/arxiv.0806.2264openalex-snapshot
Effective lambda-models vs recursively enumerable lambda-theories
inferred← citeshttps://doi.org/10.48550/arxiv.1806.06537openalex-snapshot
Boolean-like algebras of finite dimension
inferred← citeshttps://doi.org/10.48550/arxiv.math/0701684openalex-snapshot
Lambda theories of effective lambda models
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.