On the public citation graph
Extracting constructive content from classical logic via control-like reductions
0 signed · 41 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/3-540-55251-0_1openalex-snapshot
A constructive valuation interpretation for classical logic and its use in witness extraction
inferredcites →https://doi.org/10.1007/bfb0013061openalex-snapshot
λμ-Calculus: An algorithmic interpretation of classical natural deduction
inferredcites →https://doi.org/10.1007/bfb0103100openalex-snapshot
Classically and intuitionistically provably recursive functions
inferredcites →https://doi.org/10.1017/s0960129500001328openalex-snapshot
A new constructive logic: classic logic
inferredcites →https://doi.org/10.1145/96709.96714openalex-snapshot
A formulae-as-type notion of control
inferredcites →https://doi.org/10.2307/2964396openalex-snapshot
Mathematical significance of consistency proofs
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.200710046openalex-snapshot
Classical truth in higher types
inferred← citeshttps://doi.org/10.1006/inco.1996.0025openalex-snapshot
A Symmetric Lambda Calculus for Classical Program Extraction
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-45413-6_17openalex-snapshot
Strong Normalization of Classical Natural Deduction with Disjunction
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-58216-9_27openalex-snapshot
On the relation between the λμ-calculus and the syntactic theory of sequential control
inferred← citeshttps://doi.org/10.1007/3-540-63875-x_62openalex-snapshot
Calculus of classical proofs I
inferred← citeshttps://doi.org/10.1007/bfb0014054openalex-snapshot
A simple calculus of exception handling
inferred← citeshttps://doi.org/10.1007/bfb0017475openalex-snapshot
A CPS-translation of the λμ-calculus
inferred← citeshttps://doi.org/10.1007/bfb0055911openalex-snapshot
Polymorphic call-by-value calculus based on classical proofs
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-007-9007-zopenalex-snapshot
A proof-theoretic foundation of abortive continuations
inferred← citeshttps://doi.org/10.1016/j.apal.2004.10.006openalex-snapshot
Uniform Heyting arithmetic
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.11.071openalex-snapshot
Practical Program Extraction from Classical Proofs
inferred← citeshttps://doi.org/10.1016/j.jlap.2012.01.004openalex-snapshot
Deriving a Floyd–Hoare logic for non-local jumps from a formulæ-as-types notion of control
inferred← citeshttps://doi.org/10.1016/s0049-237x(06)80007-8openalex-snapshot
Classical logic and control operators
inferred← citeshttps://doi.org/10.1016/s0168-0072(01)00073-2openalex-snapshot
Refined program extraction from classical proofs
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00352-2openalex-snapshot
Strong normalizability of the non-deterministic catch/throw calculi
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80331-7openalex-snapshot
Multiple-Conclusion System as Communication Calculus
inferred← citeshttps://doi.org/10.1017/s0956796804005362openalex-snapshot
An intuitionistic λ-calculus with exceptions
inferred← citeshttps://doi.org/10.1017/s0956796899003512openalex-snapshot
A confluent λ-calculus with a catch/throw mechanism
inferred← citeshttps://doi.org/10.1093/logcom/14.4.529openalex-snapshot
A Formulae-as-Types Interpretation of Subtractive Logic
inferred← citeshttps://doi.org/10.1109/lics.1996.561323openalex-snapshot
A semantic view of classical proofs: type-theoretic, categorical, and denotational characterizations
inferred← citeshttps://doi.org/10.1145/1462179.1462184openalex-snapshot
Proofs, tests and continuation passing style
inferred← citeshttps://doi.org/10.1145/263699.263722openalex-snapshot
A Curry-Howard foundation for functional computation with control
inferred← citeshttps://doi.org/10.4204/eptcs.127.1openalex-snapshot
Strong Normalization for HA + EM1 by Non-Deterministic Choice
inferred← citeshttps://doi.org/10.4204/eptcs.212.1openalex-snapshot
A verified abstract machine for functional coroutines
inferred← citeshttps://doi.org/10.4204/eptcs.441.0openalex-snapshot
Proceedings Logics and Type Theory: essays dedicated to Stefano Berardi on the occasion of his 1000000th birthday
inferred← citeshttps://doi.org/10.4204/eptcs.441.0.1openalex-snapshot
Proceedings Logics and Type Theory: essays dedicated to Stefano Berardi on the occasion of his 1000000th birthday
inferred← citeshttps://doi.org/10.48550/arxiv.1112.1554openalex-snapshot
A program logic for higher-order procedural variables and non-local jumps
inferred← citeshttps://doi.org/10.5282/edoc.14030openalex-snapshot
Analysis of methods for extraction of programs from non-constructive proofs
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.