On the public citation graph
Classical proofs as programs
0 signed · 82 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-55460-2_27openalex-snapshot
Free deduction: An analysis of “Computations” in classical logic
inferredcites →https://doi.org/10.1007/978-3-642-74884-4_3openalex-snapshot
Assigning Meaning to Proofs: a semantic basis for problem solving environments
inferredcites →https://doi.org/10.1007/bf01792986openalex-snapshot
Opérateurs de mise en mémoire et traduction de Gödel
inferredcites →https://doi.org/10.1007/bfb0012823openalex-snapshot
Specifying theorem provers in a higher-order logic programming language
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.1016/0890-5401(88)90005-3openalex-snapshot
The calculus of constructions
inferredcites →https://doi.org/10.1016/s0049-237x(08)70740-7openalex-snapshot
Mathematics as a Numerical Language
inferredcites →https://doi.org/10.1017/s0960129500001328openalex-snapshot
A new constructive logic: classic logic
inferredcites →https://doi.org/10.1109/lics.1993.287602openalex-snapshot
Strong normalization for second order classical natural deduction
inferredcites →https://doi.org/10.1109/sfcs.1983.50openalex-snapshot
Reasoning about functional programs and complexity classes associated with type disciplines
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.1002/1521-3870(200204)48:3<357::aid-malq357>3.0.co;2-lopenalex-snapshot
Non Deterministic Classical Logic: Theλμ++ -calculus
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-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/3-540-63875-x_62openalex-snapshot
Calculus of classical proofs I
inferred← citeshttps://doi.org/10.1007/978-3-031-51406-7_12openalex-snapshot
A New Conjecture About Identity of Proofs
inferred← citeshttps://doi.org/10.1007/978-3-031-69940-5_14openalex-snapshot
Proofs with Star and Perp
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-87531-4_13openalex-snapshot
On the Relations between the Syntactic Theories of λμ-Calculi
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/s001530050076openalex-snapshot
La valeur d'un entier classique en $\lambda\mu$ -calcul
inferred← citeshttps://doi.org/10.1007/s001530050147openalex-snapshot
Mixed logic and storage operators
inferred← citeshttps://doi.org/10.1007/s001530200007openalex-snapshot
Strong normalization of a symmetric lambda calculus for second-order classical logic
inferred← citeshttps://doi.org/10.1007/s10988-005-6580-7openalex-snapshot
Explaining Crossover and Superiority as Left-to-right Evaluation
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.011openalex-snapshot
Control structures in programs and computational complexity
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/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.entcs.2009.02.031openalex-snapshot
Intuitionistic Letcc via Labelled Deduction
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/j.tcs.2006.08.002openalex-snapshot
Categorical proof theory of classical propositional calculus
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.12.023openalex-snapshot
Musings around the geometry of interaction, and coherence
inferred← citeshttps://doi.org/10.1016/s0020-0190(02)00300-9openalex-snapshot
An interpretation of -calculus in -calculus
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(02)00051-9openalex-snapshot
Church–Rosser property of a simple reduction for full first-order classical natural deduction
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00297-3openalex-snapshot
Polarized proof-nets and λμ-calculus
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00169-3openalex-snapshot
Proof-search in type-theoretic languages: an introduction
inferred← citeshttps://doi.org/10.1016/s0764-4442(97)83922-5openalex-snapshot
Un plongement de la logique classique du 2nd ordre dans AF2
inferred← citeshttps://doi.org/10.1017/s0956796899003512openalex-snapshot
A confluent λ-calculus with a catch/throw mechanism
inferred← citeshttps://doi.org/10.1017/s0960129508006762openalex-snapshot
Computation with classical sequents
inferred← citeshttps://doi.org/10.1017/s096012952200041xopenalex-snapshot
Normalization in the simply typed -calculus
inferred← citeshttps://doi.org/10.1023/a:1005073330585openalex-snapshot
On Proof Terms and Embeddings of Classical Substructural Logics
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.1993.287602openalex-snapshot
Strong normalization for second order classical natural deduction
inferred← citeshttps://doi.org/10.1142/9781848164581_0005openalex-snapshot
Curry–Howard Correspondence
inferred← citeshttps://doi.org/10.1145/1516507.1516508openalex-snapshot
Sequent calculi and abstract machines
inferred← citeshttps://doi.org/10.1145/263699.263722openalex-snapshot
A Curry-Howard foundation for functional computation with control
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.18778/0138-0680.2023.6openalex-snapshot
Structural Rules in Natural Deduction with Alternatives
inferred← citeshttps://doi.org/10.2307/2275572openalex-snapshot
A new deconstructive logic: linear logic
inferred← citeshttps://doi.org/10.23638/lmcs-13(3:13)2017openalex-snapshot
A revised completeness result for the simply typed $\lambda\mu$-calculus using realizability semantics
inferred← citeshttps://doi.org/10.23638/lmcs-13(3:34)2017openalex-snapshot
Strong normalization of lambda-Sym-Prop- and lambda-bar-mu-mu-tilde-star- calculi
inferred← citeshttps://doi.org/10.23638/lmcs-14(2:17)2018openalex-snapshot
An estimation for the lengths of reduction sequences of the $\lambda\mu\rho\theta$-calculus
inferred← citeshttps://doi.org/10.3765/salt.v0i20.2569openalex-snapshot
Principles of interdimensional meaning interaction
inferred← citeshttps://doi.org/10.3765/salt.v20i0.2569openalex-snapshot
Principles of interdimensional meaning interaction
inferred← citeshttps://doi.org/10.4000/books.psorbonne.315openalex-snapshot
Règles et signification : le point de vue de la logique classique
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.45.3openalex-snapshot
Sound and Complete Typing for lambda-mu
inferred← citeshttps://doi.org/10.4204/eptcs.97.2openalex-snapshot
A call-by-value lambda-calculus with lists and control
inferred← citeshttps://doi.org/10.46298/lmcs-19(2:12)2023openalex-snapshot
Adding Negation to Lambda Mu
inferred← citeshttps://doi.org/10.46298/lmcs-20(2:4)2024openalex-snapshot
A Strong Bisimulation for a Classical Term Calculus
inferred← citeshttps://doi.org/10.48550/arxiv.0905.0552openalex-snapshot
La Valeur d'un Entier Classique en $λμ$-Calcul
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.70675/953c72dbz8517z4bd3zb29fz9f7def5a3a18openalex-snapshot
Lawvere-Tierney sheafification in Homotopy Type Theory
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.