On the public citation graph
Lambda-calculus schemata
0 signed · 63 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.1007/bf01019460openalex-snapshot
The next 700 formal language descriptions
inferredcites →https://doi.org/10.1007/bf01019462openalex-snapshot
Reasoning about programs in continuation-passing style
inferredcites →https://doi.org/10.1016/s0019-9958(71)90355-xopenalex-snapshot
Proving algorithms by tail functions
inferredcites →https://doi.org/10.1016/s0022-0000(70)80022-8openalex-snapshot
On formalised computer programs
inferredcites →https://doi.org/10.1016/s0022-0000(71)80036-3openalex-snapshot
Translating recursion equations into flow charts
inferredcites →https://doi.org/10.1016/s0049-237x(08)72018-4openalex-snapshot
A Basis for a Mathematical Theory of Computation )
inferredcites →https://doi.org/10.1016/s0049-237x(08)x7102-2openalex-snapshot
Computer Programming and Formal Systems
inferredcites →https://doi.org/10.1017/s0960129500001535openalex-snapshot
Representing Control: a Study of the CPS Transformation
inferredcites →https://doi.org/10.1093/comjnl/6.4.308openalex-snapshot
The Mechanical Evaluation of Expressions
inferredcites →https://doi.org/10.1145/1093410.1093411openalex-snapshot
The function of FUNCTION in LISP or why the FUNARG problem should be called the environment problem
inferredcites →https://doi.org/10.1145/361532.361558openalex-snapshot
A bonus from van Wijngaarden's device
inferredcites →https://doi.org/10.1145/800157.805041openalex-snapshot
Block structure (Extended Abstract)
inferredcites →https://doi.org/10.1145/800169.805438openalex-snapshot
Pushdown store machines and real-time computation
inferredcites →https://doi.org/10.1145/800186.810604openalex-snapshot
PAL---a language designed for teaching programming linguistics
inferredcites →https://doi.org/10.1145/800194.805852openalex-snapshot
Definitional interpreters for higher-order programming languages
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/inco.1999.2828openalex-snapshot
Relational Interpretations of Recursive Types in an Operational Setting
inferred← citeshttps://doi.org/10.1006/inco.2002.3153openalex-snapshot
Conservation and Uniform Normalization in Lambda Calculi with Erasing Reductions
inferred← citeshttps://doi.org/10.1007/3-540-45793-3_33openalex-snapshot
A Proof Theoretical Account of Continuation Passing Style
inferred← citeshttps://doi.org/10.1007/978-3-540-73147-4_8openalex-snapshot
Remarks on Semantic Completeness for Proof-Terms with Laird’s Dual Affine/Intuitionistic λ-Calculus
inferred← citeshttps://doi.org/10.1007/978-3-540-74255-5_22openalex-snapshot
Delimited Continuations in Operating Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-03034-5_1openalex-snapshot
J Is for JavaScript: A Direct-Style Correspondence between Algol-Like Languages and JavaScript Using First-Class Continuations
inferred← citeshttps://doi.org/10.1007/bfb0014563openalex-snapshot
Relational interpretations of recursive types in an operational setting (Summary)
inferred← citeshttps://doi.org/10.1007/s10849-006-0541-6openalex-snapshot
Types as Graphs: Continuations in Type Logical Grammar
inferred← citeshttps://doi.org/10.1007/s10990-007-9006-0openalex-snapshot
A type-theoretic foundation of delimited continuations
inferred← citeshttps://doi.org/10.1007/s10990-009-9048-6openalex-snapshot
Peter J. Landin (1930–2009)
inferred← citeshttps://doi.org/10.1007/s11023-007-9082-2openalex-snapshot
Consistency, Turing Computability and Gödel’s First Incompleteness Theorem
inferred← citeshttps://doi.org/10.1016/j.ipl.2005.02.002openalex-snapshot
CPS transformation of beta-redexes
inferred← citeshttps://doi.org/10.1016/j.jlap.2004.03.009openalex-snapshot
The origins of structural operational semantics
inferred← citeshttps://doi.org/10.1016/s1567-8326(04)00026-8openalex-snapshot
The origins of structural operational semantics
inferred← citeshttps://doi.org/10.1017/s0956796800001581openalex-snapshot
Proving the correctness of compiler optimisations based on a global analysis: a study of strictness analysis †
inferred← citeshttps://doi.org/10.1017/s0956796800001775openalex-snapshot
Operational interpretations of an extension of F ω with control operators
inferred← citeshttps://doi.org/10.1017/s0956796801004221openalex-snapshot
CPS in little pieces: composing partial continuations
inferred← citeshttps://doi.org/10.1017/s0956796807006387openalex-snapshot
On one-pass CPS transformations
inferred← citeshttps://doi.org/10.1023/a:1010016816429openalex-snapshot
Implementation Strategies for First-Class Continuations
inferred← citeshttps://doi.org/10.1023/a:1010026413531openalex-snapshot
Continuations: A Mathematical Semantics for Handling Full Jumps
inferred← citeshttps://doi.org/10.1145/1459352.1459358openalex-snapshot
Comments on temporal logics for real-time system specification
inferred← citeshttps://doi.org/10.1145/224164.224175openalex-snapshot
Unboxed values and polymorphic typing revisited
inferred← citeshttps://doi.org/10.1145/2951913.2951922openalex-snapshot
Deriving a probability density calculator (functional pearl)
inferred← citeshttps://doi.org/10.1145/3022670.2951922openalex-snapshot
Deriving a probability density calculator (functional pearl)
inferred← citeshttps://doi.org/10.1145/3110267openalex-snapshot
No-brainer CPS conversion (functional pearl)
inferred← citeshttps://doi.org/10.1145/349214.349219openalex-snapshot
Generation of LR parsers by partial evaluation
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0512099openalex-snapshot
Mathematical Models in Schema Theory
inferred← citeshttps://doi.org/10.5860/choice.46-1527openalex-snapshot
Essentials of programming languages
inferred← citeshttps://doi.org/10.70675/34ac95cbz6413z46ddz9d2az3cb8a1a7497dopenalex-snapshot
On information-centric routing and forwarding in the internet of things
inferred← citeshttps://doi.org/10.70675/e6654da0zbd5ez4eb1z9a61z3a679c1fbb38openalex-snapshot
On the lambda calculus with constructors
inferred← citeshttps://doi.org/10.7146/aul.214.152openalex-snapshot
An Analytical Approach to Programs as Data Objects
inferred← citeshttps://doi.org/10.7146/brics.v14i6.21929openalex-snapshot
On One-Pass CPS Transformations
inferred← citeshttps://doi.org/10.7146/brics.v3i19.19981openalex-snapshot
Thunks and the lambda-Calculus
inferred← citeshttps://doi.org/10.7146/brics.v7i35.20170openalex-snapshot
CPS Transformation of Beta-Redexes
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.