On the public citation graph

A CPS-translation of the λμ-calculus

https://doi.org/10.1007/bfb0017475
0 signed · 46 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.1007/bfb0022575openalex-snapshot
Classical proofs as programs
inferredcites →https://doi.org/10.1007/bfb0037097openalex-snapshot
Extracting constructive content from classical logic via control-like reductions
inferredcites →https://doi.org/10.1016/0304-3975(75)90017-1openalex-snapshot
Call-by-name, call-by-value and 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.1017/cbo9780511609619openalex-snapshot
Compiling with Continuations
inferredcites →https://doi.org/10.1017/s0960129500001328openalex-snapshot
A new constructive logic: classic logic
inferredcites →https://doi.org/10.1109/lics.1991.151634openalex-snapshot
An evaluation semantics for classical proofs
inferredcites →https://doi.org/10.1109/lics.1992.185523openalex-snapshot
A computational analysis of Girard's translation and LC
inferredcites →https://doi.org/10.1109/lics.1993.287602openalex-snapshot
Strong normalization for second order classical natural deduction
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.1007/11417170_13openalex-snapshot
Arithmetical Proofs of Strong Normalization Results for the Symmetric λμ-Calculus
inferred← citeshttps://doi.org/10.1007/3-540-45413-6_17openalex-snapshot
Strong Normalization of Classical Natural Deduction with Disjunction
inferred← citeshttps://doi.org/10.1007/3-540-45413-6_26openalex-snapshot
Parigot’s Second Order λμ-Calculus and Inductive Types
inferred← citeshttps://doi.org/10.1007/3-540-45500-0_23openalex-snapshot
Strong Normalization of Second Order Symmetric Lambda-mu Calculus
inferred← citeshttps://doi.org/10.1007/3-540-46674-6_23openalex-snapshot
A CPS-Transform of Constructive Classical Logic
inferred← citeshttps://doi.org/10.1007/3-540-48959-2_13openalex-snapshot
Explicitly Typed λμ-Calculus for Polymorphism and Call-by-Value
inferred← citeshttps://doi.org/10.1007/3-540-49366-2_5openalex-snapshot
Cut Elimination for Classical Proofs as Continuation Passing Style Computation
inferred← citeshttps://doi.org/10.1007/3-540-58216-9_27openalex-snapshot
On the relation between the λμ-calculus and the syntactic theory of sequential control
inferred← citeshttps://doi.org/10.1007/978-3-319-08918-8_24openalex-snapshot
Reduction System for Extensional Lambda-mu Calculus
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-540-73228-0_8openalex-snapshot
An Arithmetical Proof of the Strong Normalization for the λ-Calculus with Recursive Equations on Types
inferred← citeshttps://doi.org/10.1007/978-3-540-76637-7_27openalex-snapshot
Call-by-Name and Call-by-Value in Normal Modal Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-00665-4_13openalex-snapshot
Quantifiers in Japanese
inferred← citeshttps://doi.org/10.1007/978-3-642-12032-9_26openalex-snapshot
A Hierarchy for Delimited Continuations in Call-by-Name
inferred← citeshttps://doi.org/10.1007/978-3-642-45221-5_19openalex-snapshot
Complexity Analysis in Presence of Control Operators and Higher-Order Functions
inferred← citeshttps://doi.org/10.1007/bfb0014054openalex-snapshot
A simple calculus of exception handling
inferred← citeshttps://doi.org/10.1016/j.apal.2012.05.005openalex-snapshot
The λμT -calculus
inferred← citeshttps://doi.org/10.1016/j.ic.2004.04.002openalex-snapshot
Strong normalization of the second-order symmetric λμ-calculus
inferred← citeshttps://doi.org/10.1016/s0049-237x(06)80007-8openalex-snapshot
Classical logic and control operators
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80170-7openalex-snapshot
A Notion of Classical Pure Type System (Preliminary version)
inferred← citeshttps://doi.org/10.1017/9781316755785.010openalex-snapshot
Stabilization — an alternative to double-negation translation for classical natural deduction
inferred← citeshttps://doi.org/10.1017/s0956796807006387openalex-snapshot
On one-pass CPS transformations
inferred← citeshttps://doi.org/10.1017/s0960129515000286openalex-snapshot
The approximation theorem for the Λμ-calculus
inferred← citeshttps://doi.org/10.1023/a:1005073330585openalex-snapshot
On Proof Terms and Embeddings of Classical Substructural Logics
inferred← citeshttps://doi.org/10.1051/ita:2000102openalex-snapshot
Domain-Freeλµ-Calculus
inferred← citeshttps://doi.org/10.1145/1328438.1328484openalex-snapshot
An approach to call-by-name delimited continuations
inferred← citeshttps://doi.org/10.1145/1328897.1328484openalex-snapshot
An approach to call-by-name delimited continuations
inferred← citeshttps://doi.org/10.1145/3531130.3532469openalex-snapshot
Resource approximation for the λμ-calculus
inferred← citeshttps://doi.org/10.1145/3759427.3760374openalex-snapshot
Untyped Logical Relations at Work: Control Operators, Contextual Equivalence and Full Abstraction
inferred← citeshttps://doi.org/10.1145/503032.503043openalex-snapshot
CPS translating inductive and coinductive types
inferred← citeshttps://doi.org/10.1145/509799.503043openalex-snapshot
CPS translating inductive and coinductive types
inferred← citeshttps://doi.org/10.1515/9783110324921.227openalex-snapshot
On the Relation Between Various Negative Translations
inferred← citeshttps://doi.org/10.32388/9fh6adopenalex-snapshot
Limitations of and Lessons from the Learning of Large Language Models
inferred← citeshttps://doi.org/10.4288/jafpos.33.0_109openalex-snapshot
Some Remarks on the Collapse Issues of Merging Different Logics ― with Classical, Intuitionistic, Finitist and Linear Logics
inferred← citeshttps://doi.org/10.48550/arxiv.1707.02056openalex-snapshot
Complete Call-by-Value Calculi of Control Operators, I
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.