On the public citation graph

A computational interpretation of the λΜ-calculus

https://doi.org/10.1007/bfb0055783
0 signed · 26 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 this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bfb0013061openalex-snapshot
λμ-Calculus: An algorithmic interpretation of classical natural deduction
inferredcites →https://doi.org/10.1016/s0304-3975(99)00048-1openalex-snapshot
A classical linear λ-calculus
inferredcites →https://doi.org/10.1016/s1571-0661(04)80013-6openalex-snapshot
Bisimilarity as a Theory of Functional Programming
inferredcites →https://doi.org/10.1016/s1571-0661(05)80399-8openalex-snapshot
Towards a Classical Linear λ-calculus (Preliminary Report)
inferredcites →https://doi.org/10.1017/cbo9780511526619.007openalex-snapshot
Operationally-Based Theories of Program Equivalence
inferredcites →https://doi.org/10.1145/224164.224173openalex-snapshot
A generalization of exceptions and control in ML-like languages
inferredcites →https://doi.org/10.1145/263699.263722openalex-snapshot
A Curry-Howard foundation for functional computation with control
inferredcites →https://doi.org/10.1145/73560.73576openalex-snapshot
The theory and practice of first-class prompts
inferredcites →https://doi.org/10.1145/96709.96714openalex-snapshot
A formulae-as-type notion of control

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.2001.2947openalex-snapshot
Completeness of Continuation Models for λμ-Calculus
inferred← citeshttps://doi.org/10.1007/11591191_13openalex-snapshot
Strong Normalization of the Dual Classical Sequent Calculus
inferred← citeshttps://doi.org/10.1007/3-540-45061-0_68openalex-snapshot
Minimal Classical Logic and Control Operators
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/3-540-48959-2_26openalex-snapshot
Strong Normalisation of Cut-Elimination in Classical Logic
inferred← citeshttps://doi.org/10.1007/978-3-319-71237-6_11openalex-snapshot
Programming and Proving with Classical Types
inferred← citeshttps://doi.org/10.1007/978-3-642-04164-8_17openalex-snapshot
A Complete, Co-inductive Syntactic Theory of Sequential Control and State
inferred← citeshttps://doi.org/10.1007/978-3-642-21691-6_18openalex-snapshot
A Filter Model for the λμ-Calculus
inferred← citeshttps://doi.org/10.1007/978-3-642-28729-9_8openalex-snapshot
Applicative Bisimulations for Delimited-Control Operators
inferred← citeshttps://doi.org/10.1007/s10990-007-9007-zopenalex-snapshot
A proof-theoretic foundation of abortive continuations
inferred← citeshttps://doi.org/10.1016/j.apal.2010.04.010openalex-snapshot
Completeness and partial soundness results for intersection and union typing for λ¯μμ
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00281-6openalex-snapshot
A Third-Order Representation of the λμ-Calculus
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80878-8openalex-snapshot
Parallel Reduction in Type Free λμ-Calculus
inferred← citeshttps://doi.org/10.1051/ita:2004015openalex-snapshot
Termination checking with types
inferred← citeshttps://doi.org/10.1109/lics.2005.48openalex-snapshot
Separation with Streams in the ?µ-calculus
inferred← citeshttps://doi.org/10.1145/1190215.1190244openalex-snapshot
A complete, co-inductive syntactic theory of sequential control and state
inferred← citeshttps://doi.org/10.48550/arxiv.1112.3455openalex-snapshot
Resource control and strong normalisation
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.