On the public citation graph
A simple calculus of exception handling
0 signed · 72 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.1006/inco.1996.0025openalex-snapshot
A Symmetric Lambda Calculus for Classical Program Extraction
inferredcites →https://doi.org/10.1007/3-540-57887-0_112openalex-snapshot
A symmetric lambda calculus for “classical” program extraction
inferredcites →https://doi.org/10.1007/3-540-58216-9_27openalex-snapshot
On the relation between the λμ-calculus and the syntactic theory of sequential control
inferredcites →https://doi.org/10.1007/bfb0013061openalex-snapshot
λμ-Calculus: An algorithmic interpretation of classical natural deduction
inferredcites →https://doi.org/10.1007/bfb0017475openalex-snapshot
A CPS-translation of the λμ-calculus
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/cbo9780511569807.014openalex-snapshot
Finding computational content in classical proofs
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
inferredcites →https://doi.org/10.7551/mitpress/2319.001.0001openalex-snapshot
The Definition of Standard ML
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.2002.3147openalex-snapshot
On the Strong Normalisation of Intuitionistic Natural Deduction with Permutation-Conversions
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/11417170_20openalex-snapshot
Reducibility and ⊤ ⊤-Lifting for Computation Types
inferred← citeshttps://doi.org/10.1007/3-540-44929-9_34openalex-snapshot
A Type-Theoretic Study on Partial Continuations
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-48321-7_35openalex-snapshot
A confluence result for a typed λ-calculus of exception handling with fixed-point
inferred← citeshttps://doi.org/10.1007/3-540-48685-2_4openalex-snapshot
On the Strong Normalization of Natural Deduction with Permutation-Conversions
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-63875-x_62openalex-snapshot
Calculus of classical proofs I
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-38916-0_6openalex-snapshot
A Declarative Debugger for Sequential Erlang Programs
inferred← citeshttps://doi.org/10.1007/bfb0055911openalex-snapshot
Polymorphic call-by-value calculus based on classical proofs
inferred← citeshttps://doi.org/10.1016/0167-6423(95)00029-1openalex-snapshot
Exceptions considered harmless
inferred← citeshttps://doi.org/10.1016/j.apal.2008.01.003openalex-snapshot
Strong normalization of classical natural deduction with disjunctions
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.06.020openalex-snapshot
Why the Usual Candidates of Reducibility Do Not Work for the Symmetric λμ-calculus
inferred← citeshttps://doi.org/10.1016/j.future.2009.05.021openalex-snapshot
Bulk synchronous parallel ML with exceptions
inferred← citeshttps://doi.org/10.1016/j.ipl.2006.03.009openalex-snapshot
Strong normalization proofs by CPS-translations
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/j.scico.2015.06.011openalex-snapshot
A zoom-declarative debugger for sequential Erlang programs
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.02.028openalex-snapshot
On natural deduction in classical first-order logic: Curry–Howard correspondence, strong normalization and Herbrand's theorem
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.01.022openalex-snapshot
On the concurrent computational content of intermediate logics
inferred← citeshttps://doi.org/10.1016/s0049-237x(06)80007-8openalex-snapshot
Classical logic and control operators
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/s0304-3975(01)00380-2openalex-snapshot
Confluency and strong normalizability of call-by-value λμ-calculus
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(05)80170-7openalex-snapshot
A Notion of Classical Pure Type System (Preliminary version)
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.1017/s0960129517000172openalex-snapshot
Validating Brouwer's continuity principle for numbers using named exceptions
inferred← citeshttps://doi.org/10.1023/a:1010020917337openalex-snapshot
Unchecked Exceptions Can Be Strictly More Powerful Than Call/CC
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.2017.8005076openalex-snapshot
Gödel logic: From natural deduction to parallel computation
inferred← citeshttps://doi.org/10.1145/2603088.2603163openalex-snapshot
Substitution, jumps, and algebraic effects
inferred← citeshttps://doi.org/10.1145/3354166.3354186openalex-snapshot
Exception Handling and Classical Logic
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.1184/r1/6591038openalex-snapshot
A modal calculus for effect handling
inferred← citeshttps://doi.org/10.1201/9781439865835-9openalex-snapshot
STABILIZATION—AN ALTERNATIVE TO DOUBLE-NEGATION TRANSLATION FOR CLASSICAL NATURAL DEDUCTION
inferred← citeshttps://doi.org/10.2178/jsl/1058448444openalex-snapshot
Strong normalization proof with CPS-translation for second order classical natural deduction
inferred← citeshttps://doi.org/10.2178/jsl/1067620187openalex-snapshot
A short proof of the strong normalization of classical natural deduction with disjunction
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.277.4openalex-snapshot
Classical Proofs as Parallel Programs
inferred← citeshttps://doi.org/10.4230/lipics.csl.2013.45openalex-snapshot
Realizability and Strong Normalization for a Curry-Howard Interpretation of HA + EM1
inferred← citeshttps://doi.org/10.48550/arxiv.0905.0762openalex-snapshot
Arithmetical proofs of strong normalization results for symmetric lambda calculi
inferred← citeshttps://doi.org/10.48550/arxiv.0905.1034openalex-snapshot
Arithmetical proofs of strong normalization results for the symmetric $λμ$-calculus
inferred← citeshttps://doi.org/10.48550/arxiv.0905.1554openalex-snapshot
Why the usual candidates of reducibility do not work for the symmetric $λμ$-calculus
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.48550/arxiv.1707.02056openalex-snapshot
Complete Call-by-Value Calculi of Control Operators, I
inferred← citeshttps://doi.org/10.48550/arxiv.1802.00961openalex-snapshot
Disjunctive Axioms and Concurrent $λ$-Calculi: a Curry-Howard Approach
inferred← citeshttps://doi.org/10.5555/3329995.3330011openalex-snapshot
Gödel logic: from natural deduction to parallel computation
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.