On the public citation graph
Classical proofs as programs: How, what and why
0 signed · 32 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/bfb0103100openalex-snapshot
Classically and intuitionistically provably recursive functions
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.1080/01445348708837109openalex-snapshot
On the principle of the excluded middle
inferredcites →https://doi.org/10.1109/lics.1991.151634openalex-snapshot
An evaluation semantics for classical proofs
inferredcites →https://doi.org/10.1145/15022.15026openalex-snapshot
On some extensions of syntactic error recovery technique based on phrase markers
inferredcites →https://doi.org/10.1145/15042.15043openalex-snapshot
Revised 3 report on the algorithmic language scheme
inferredcites →https://doi.org/10.1145/290229.290234openalex-snapshot
Revised 5 report on the algorithmic language scheme
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/11538363_6openalex-snapshot
Distributed Control Flow with Classical Modal Logic
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-48958-4_5openalex-snapshot
Synthesis of Programs in Abstract Data Types
inferred← citeshttps://doi.org/10.1007/978-3-031-08740-0_3openalex-snapshot
Maximal Ideals in Countable Rings, Constructively
inferred← citeshttps://doi.org/10.1007/bfb0013061openalex-snapshot
λμ-Calculus: An algorithmic interpretation of classical natural deduction
inferred← citeshttps://doi.org/10.1007/bfb0021092openalex-snapshot
Bringing mathematics education into the algorithmic age
inferred← citeshttps://doi.org/10.1016/b978-0-444-89880-7.50039-5openalex-snapshot
Executing HOL Specifications: Towards an Evaluation Semantics for Classical Higher Order Logic
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.tcs.2006.08.002openalex-snapshot
Categorical proof theory of classical propositional calculus
inferred← citeshttps://doi.org/10.1017/s0956796899003512openalex-snapshot
A confluent λ-calculus with a catch/throw mechanism
inferred← citeshttps://doi.org/10.1017/s0960129599002911openalex-snapshot
Sequent combinators: a Hilbert system for the lambda calculus
inferred← citeshttps://doi.org/10.1109/lics.1992.185523openalex-snapshot
A computational analysis of Girard's translation and LC
inferred← citeshttps://doi.org/10.1145/169725.169716openalex-snapshot
The deductive synthesis of database transactions
inferred← citeshttps://doi.org/10.1145/3209108.3209132openalex-snapshot
Around Classical and Intuitionistic Linear Logics
inferred← citeshttps://doi.org/10.17077/etd.vibd09toopenalex-snapshot
The semantic analysis of advanced programming languages
inferred← citeshttps://doi.org/10.3233/com-230454openalex-snapshot
Reifying dynamical algebra: Maximal ideals in countable rings, constructively
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.