On the public citation graph
λ-Calculus and Computer Science Theory
0 signed · 29 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 points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-08860-1_29openalex-snapshot
On constructing efficient evaluators for attribute grammars
inferred← citeshttps://doi.org/10.1007/3-540-54317-1_79openalex-snapshot
Extended term rewriting systems
inferred← citeshttps://doi.org/10.1007/3-540-57182-5_6openalex-snapshot
Some results on the full abstraction problem for restricted lambda calculi
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-85762-4_12openalex-snapshot
A Complete Realisability Semantics for Intersection Types and Arbitrary Expansion Variables
inferred← citeshttps://doi.org/10.1007/978-3-642-29822-6_4openalex-snapshot
Call-by-Value Solvability, Revisited
inferred← citeshttps://doi.org/10.1007/978-94-011-5638-7_6openalex-snapshot
DRT and Many-Valued Logics
inferred← citeshttps://doi.org/10.1007/978-94-017-9673-6_6openalex-snapshot
Sets, Truth, and Recursion
inferred← citeshttps://doi.org/10.1007/bf00967869openalex-snapshot
Functionals computable in series and in parallel
inferred← citeshttps://doi.org/10.1007/bf02917403openalex-snapshot
Consistency argument and classification problem in λ-calculus
inferred← citeshttps://doi.org/10.1007/bfb0017128openalex-snapshot
Functional programming and combinatory algebras
inferred← citeshttps://doi.org/10.1016/0890-5401(89)90014-xopenalex-snapshot
Unique normal forms for lambda calculus with surjective pairing
inferred← citeshttps://doi.org/10.1016/s0019-3577(99)80012-3openalex-snapshot
Conditional linearization
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)71254-0openalex-snapshot
Some Philosophical Aspects of Combinatory Logic
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00235-6openalex-snapshot
Filter models for conjunctive-disjunctive λ-calculi
inferred← citeshttps://doi.org/10.1017/s0956796813000324openalex-snapshot
On the complexity of stream equality
inferred← citeshttps://doi.org/10.1023/a:1018983515535openalex-snapshot
Pinnacles of software engineering: 25 years of formal methods
inferred← citeshttps://doi.org/10.1109/sew.2008.8openalex-snapshot
An Extended MDA Architecture for Ensuring Semantics-Preserving Transformations
inferred← citeshttps://doi.org/10.1145/1283920.1283932openalex-snapshot
Logic and programming languages
inferred← citeshttps://doi.org/10.1145/359810.359826openalex-snapshot
Logic and programming languages
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.2307/2273659openalex-snapshot
A filter lambda model and the completeness of type assignment
inferred← citeshttps://doi.org/10.2307/2275638openalex-snapshot
A sufficient condition for completability of partial combinatory algebras
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.