On the public citation graph

Writing programs that construct proofs

0 signed · 49 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/3-540-11492-0openalex-snapshot
An Introduction to the PL/CV2 Programming Logic
inferredcites →https://doi.org/10.1007/978-3-7091-9459-1_5openalex-snapshot
Super-Exponential Complexity of Presburger Arithmetic
inferredcites →https://doi.org/10.1007/bfb0060623openalex-snapshot
The mathematical language AUTOMATH, its usage, and some of its extensions
inferredcites →https://doi.org/10.1016/0004-3702(77)90012-1openalex-snapshot
Non-resolution theorem proving
inferredcites →https://doi.org/10.1016/0004-3702(80)90015-6openalex-snapshot
Prolegomena to a theory of mechanized formal reasoning
inferredcites →https://doi.org/10.1016/0167-6423(85)90009-7openalex-snapshot
Verifying the unification algorithm in LCF
inferredcites →https://doi.org/10.1016/0898-1221(79)90044-0openalex-snapshot
Metamathematical extensibility for theorem verifiers and proof-checkers
inferredcites →https://doi.org/10.1126/science.35.890.110openalex-snapshot
A Letter of Lamarck
inferredcites →https://doi.org/10.1145/2363.2528openalex-snapshot
Proofs as programs
inferredcites →https://doi.org/10.1145/321250.321253openalex-snapshot
A Machine-Oriented Logic Based on the Resolution Principle
inferredcites →https://doi.org/10.1145/358746.358755openalex-snapshot
The Cornell program synthesizer
inferredcites →https://doi.org/10.1145/359104.359106openalex-snapshot
Social processes and proofs of theorems and programs
inferredcites →https://doi.org/10.21236/ada065698openalex-snapshot
Prolegomena to a Theory of Formal Reasoning
inferredcites →https://doi.org/10.2307/2270190openalex-snapshot
John McCarthy. Computer programs for checking mathematical proofs. Recursive function theory, Proceedings of symposia in pure mathematics, vol. 5, American Mathematical Society, Providence1962, pp. 219–227.
inferredcites →https://doi.org/10.2307/2334013openalex-snapshot
Grundlagen Der Analysis.
inferredcites →https://doi.org/10.48456/tr-39openalex-snapshot
Tactics and tacticals in Cambridge LCF

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/3-540-16780-3_108openalex-snapshot
Implementing number theory: An experiment with Nuprl
inferred← citeshttps://doi.org/10.1007/3-540-19129-1_6openalex-snapshot
PAP: a logic programming system based on a constructive logic
inferred← citeshttps://doi.org/10.1007/3-540-44659-1_16openalex-snapshot
Fast Tactic-Based Theorem Proving
inferred← citeshttps://doi.org/10.1007/3-540-51084-2_38openalex-snapshot
Aformal approach to some usually informal techniques used in mathematical reasoning
inferred← citeshttps://doi.org/10.1007/3-540-51237-3_12openalex-snapshot
A dynamic logic for program verification
inferred← citeshttps://doi.org/10.1007/3-540-51237-3_3openalex-snapshot
Building theories in Nuprl
inferred← citeshttps://doi.org/10.1007/3-540-56320-2_55openalex-snapshot
Formal theories and software systems: Fundamental connections between Computer Science and Logic
inferred← citeshttps://doi.org/10.1007/3-540-56804-2_44openalex-snapshot
Constructive matching methodology: Formally creative or Intelligent inductive theorem proving?
inferred← citeshttps://doi.org/10.1007/3-540-59155-9_8openalex-snapshot
On the use of constraints in automated deduction
inferred← citeshttps://doi.org/10.1007/3540634932_4openalex-snapshot
Structured incremental proof planning
inferred← citeshttps://doi.org/10.1007/978-3-540-49823-0_11openalex-snapshot
Recovery Oriented Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-73005-4_22openalex-snapshot
Program Verification by Symbolic Execution and Induction
inferred← citeshttps://doi.org/10.1007/978-3-7091-6355-9_1openalex-snapshot
Formal Methods and Tools: Introduction and Overview
inferred← citeshttps://doi.org/10.1007/bf01887198openalex-snapshot
Do-it-yourself type theory
inferred← citeshttps://doi.org/10.1007/bf02283736openalex-snapshot
A view of automated proof checking and proving
inferred← citeshttps://doi.org/10.1007/bfb0012828openalex-snapshot
Implementing verification strategies in the KIV-system
inferred← citeshttps://doi.org/10.1007/bfb0097791openalex-snapshot
Proof style
inferred← citeshttps://doi.org/10.1007/s10009-011-0200-3openalex-snapshot
Recovery oriented programming: runtime monitoring of safety and liveness
inferred← citeshttps://doi.org/10.1016/0004-3702(89)90048-9openalex-snapshot
Design by derivational analogy:Issues in the automated replay of design plans
inferred← citeshttps://doi.org/10.1016/0168-0072(88)90017-6openalex-snapshot
On church's formal theory of functions and functionals
inferred← citeshttps://doi.org/10.1016/0743-1066(86)90015-4openalex-snapshot
Natural deduction as higher-order resolution
inferred← citeshttps://doi.org/10.1016/j.jal.2005.10.005openalex-snapshot
Innovations in computational type theory using Nuprl
inferred← citeshttps://doi.org/10.1016/s0747-7171(85)80040-7openalex-snapshot
A Selected Bibliography on Constructive Mathematics, Intuitionistic Type Theory and Higher Order Deduction
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)01135-7openalex-snapshot
Writing Constructive Proofs Yielding Efficient Extracted Programs
inferred← citeshttps://doi.org/10.1017/s0960129500003236openalex-snapshot
HOL-λσ: an intentional first-order expression of higher-order logic
inferred← citeshttps://doi.org/10.1049/sej.1988.0002openalex-snapshot
A survey of mechanical support for formal reasoning
inferred← citeshttps://doi.org/10.1090/conm/106/1057826openalex-snapshot
Program development through proof transformation
inferred← citeshttps://doi.org/10.1109/lics.1989.39186openalex-snapshot
Elf: a language for logic definition and verified metaprogramming
inferred← citeshttps://doi.org/10.1145/1095810.1118594openalex-snapshot
Recovery oriented programming
inferred← citeshttps://doi.org/10.1145/44483.44484openalex-snapshot
A mechanical proof of the Church-Rosser theorem
inferred← citeshttps://doi.org/10.1145/64135.65006openalex-snapshot
The ergo support system: an integrated set of tools for prototyping integrated environments
inferred← citeshttps://doi.org/10.20868/upm.thesis.6258openalex-snapshot
Método incremental de compilación de conocimiento inteligente : MINNIE
inferred← citeshttps://doi.org/10.7916/d8k3630vopenalex-snapshot
Verbalization of high-level formal 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.