On the public citation graph

The λ-calculus is ω-incomplete

0 signed · 34 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.
Claim with ORCID
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.
See reference health

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/malq.19800261902openalex-snapshot
Lambda‐Calculus Models and Extensionality
inferred← citeshttps://doi.org/10.1007/11417170_4openalex-snapshot
Untyped Algorithmic Equality for Martin-Löf’s Logical Framework with Surjective Pairs
inferred← citeshttps://doi.org/10.1007/11523468_61openalex-snapshot
A Finite Basis for Failure Semantics
inferred← citeshttps://doi.org/10.1007/11601548_18openalex-snapshot
Finite Equational Bases in Process Algebra: Results and Open Questions
inferred← citeshttps://doi.org/10.1007/11817949_28openalex-snapshot
On Finite Alphabets and Infinite Bases III: Simulation
inferred← citeshttps://doi.org/10.1007/3-540-10699-5_99openalex-snapshot
On the definition of lambda-calculus models
inferred← citeshttps://doi.org/10.1007/978-3-540-24727-2_14openalex-snapshot
On Finite Alphabets and Infinite Bases: From Ready Pairs to Possible Worlds
inferred← citeshttps://doi.org/10.1007/978-3-540-73228-0_14openalex-snapshot
The Omega Rule is $\mathbf{\Pi_{1}^{1}}$ -Complete in the λβ-Calculus
inferred← citeshttps://doi.org/10.1007/978-3-540-74915-8_24openalex-snapshot
Not Enough Points Is Enough
inferred← citeshttps://doi.org/10.1007/978-3-642-17511-4_14openalex-snapshot
A Simple Class of Kripke-Style Models in Which Logic and Computation Have Equal Standing
inferred← citeshttps://doi.org/10.1007/978-3-642-28869-2_18openalex-snapshot
Reasoning about Multi-stage Programs
inferred← citeshttps://doi.org/10.1007/s10990-006-8747-5openalex-snapshot
An initial algebra approach to term rewriting systems with variable binders
inferred← citeshttps://doi.org/10.1016/0168-0072(87)90040-6openalex-snapshot
Implication and analysis in classical frege structures
inferred← citeshttps://doi.org/10.1016/0304-3975(86)90173-8openalex-snapshot
Partial evaluation and ω-completeness of algebraic specifications
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90083-6openalex-snapshot
Constructive proofs of the range property in lambda calculus
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90057-4openalex-snapshot
Which data types have ω-complete initial algebra specifications?
inferred← citeshttps://doi.org/10.1016/0890-5401(90)90033-eopenalex-snapshot
Tools for proving inductive equalities, relative completeness, and ω-completeness
inferred← citeshttps://doi.org/10.1016/b978-0-444-87508-2.50035-6openalex-snapshot
References
inferred← citeshttps://doi.org/10.1016/j.ic.2007.09.003openalex-snapshot
On finite alphabets and infinite bases
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.04.054openalex-snapshot
Partial combinatory algebra and generalized numberings
inferred← citeshttps://doi.org/10.1016/s0019-9958(82)80087-9openalex-snapshot
What is a model of the lambda calculus?
inferred← citeshttps://doi.org/10.1016/s0019-9958(82)90796-3openalex-snapshot
Models of the lambda calculus
inferred← citeshttps://doi.org/10.1016/s0019-9958(86)80017-1openalex-snapshot
Retraction map categories and their applications to the construction of lambda calculus models
inferred← citeshttps://doi.org/10.1016/s1385-7258(76)80001-7openalex-snapshot
Representability In Lambda Algebras
inferred← citeshttps://doi.org/10.1016/s1874-5857(09)70018-4openalex-snapshot
Lambda-Calculus and Combinators in the 20th Century
inferred← citeshttps://doi.org/10.1017/s0956796801004294openalex-snapshot
The lambda calculus is algebraic
inferred← citeshttps://doi.org/10.1017/s0956796816000253openalex-snapshot
Reasoning about multi-stage programs
inferred← citeshttps://doi.org/10.1093/logcom/exz013openalex-snapshot
The fixed point property and a technique to harness double fixed point combinators
inferred← citeshttps://doi.org/10.1145/265943.265944openalex-snapshot
Toward a complete transformational toolkit for compilers
inferred← citeshttps://doi.org/10.1145/3371069openalex-snapshot
Taylor subsumes Scott, Berry, Kahn and Plotkin
inferred← citeshttps://doi.org/10.1145/3426471openalex-snapshot
α β-Relations and the Actual Meaning of α-Renaming
inferred← citeshttps://doi.org/10.2168/lmcs-10(1:3)2014openalex-snapshot
About the range property for H
inferred← citeshttps://doi.org/10.2168/lmcs-5(2:6)2009openalex-snapshot
The Omega Rule is $\mathbf{\Pi_{1}^{1}}$-Complete in the $\lambda\beta$-Calculus
inferred← citeshttps://doi.org/10.4230/lipics.csl.2016.11openalex-snapshot
Models and theories of lambda calculus
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.