On the public citation graph
An interface between CLAM and HOL
0 signed · 43 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-60275-5_58openalex-snapshot
Combining decision procedures in the HOL system
inferredcites →https://doi.org/10.1007/3-540-63104-6_23openalex-snapshot
Ωmega: Towards a mathematical assistant
inferredcites →https://doi.org/10.1007/3-540-63104-6_34openalex-snapshot
Hybrid interactive theorem proving using nuprl and HOL
inferredcites →https://doi.org/10.1007/bf00249016openalex-snapshot
Experiments with proof plans for induction
inferredcites →https://doi.org/10.1007/bfb0028400openalex-snapshot
Derivation and use of induction schemes in higher-order logic
inferredcites →https://doi.org/10.1007/bfb0031813openalex-snapshot
PVS: Combining specification, proof checking, and model checking
inferredcites →https://doi.org/10.1007/bfb0105417openalex-snapshot
Function definition in higher-order logic
inferredcites →https://doi.org/10.1016/0004-3702(93)90079-qopenalex-snapshot
Rippling: A heuristic for guiding inductive proofs
inferredcites →https://doi.org/10.1016/0378-4754(89)90181-xopenalex-snapshot
A computational logic handbook
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jsco.2000.0468openalex-snapshot
MBase: Representing Knowledge and Context for the Integration of Mathematical Software Systems
inferred← citeshttps://doi.org/10.1007/11826095openalex-snapshot
OMDoc – An Open Markup Format for Mathematical Documents [version 1.2]
inferred← citeshttps://doi.org/10.1007/3-540-44659-1_8openalex-snapshot
A Prototype Proof Translator from HOL to Coq
inferred← citeshttps://doi.org/10.1007/3-540-44957-4_42openalex-snapshot
Automatic Derivation and Application of Induction Schemes for Mutually Recursive Functions
inferred← citeshttps://doi.org/10.1007/3-540-44990-6_3openalex-snapshot
OMDoc: Towards an Internet Standard for the Administration, Distribution, and Teaching of Mathematical Knowledge
inferred← citeshttps://doi.org/10.1007/3-540-45744-5_34openalex-snapshot
JProver: Integrating Connection-Based Theorem Proving into Interactive Proof Assistants
inferred← citeshttps://doi.org/10.1007/3-540-45988-x_2openalex-snapshot
Integrating HOL-CASL into the Development Graph Manager MAYA
inferred← citeshttps://doi.org/10.1007/3-540-48256-3_12openalex-snapshot
Isar — A Generic Interpretative Approach to Readable Formal Proof Documents
inferred← citeshttps://doi.org/10.1007/978-3-030-77879-8_5openalex-snapshot
Proof Mechanization: From Dream to Reality
inferred← citeshttps://doi.org/10.1007/978-3-540-30142-4_7openalex-snapshot
Higher Order Rippling in IsaPlanner
inferred← citeshttps://doi.org/10.1007/978-3-540-30210-0_4openalex-snapshot
Planning and Patching Proof
inferred← citeshttps://doi.org/10.1007/978-3-540-30498-2_37openalex-snapshot
A Rippling-Based Difference Reduction Technique to Automatically Prove Security Protocol Goals
inferred← citeshttps://doi.org/10.1007/978-3-540-32254-2_17openalex-snapshot
Bridging Theorem Proving and Mathematical Knowledge Retrieval
inferred← citeshttps://doi.org/10.1007/978-3-540-45085-6_22openalex-snapshot
IsaPlanner: A Prototype Proof Planner in Isabelle
inferred← citeshttps://doi.org/10.1007/978-3-540-45085-6_26openalex-snapshot
Proof Search and Proof Check for Equational and Inductive Theorems
inferred← citeshttps://doi.org/10.1007/bfb0028400openalex-snapshot
Derivation and use of induction schemes in higher-order logic
inferred← citeshttps://doi.org/10.1007/bfb0054255openalex-snapshot
System description: An interface between CLAM and HOL
inferred← citeshttps://doi.org/10.1007/bfb0055125openalex-snapshot
Theorem Proving in Higher Order Logics
inferred← citeshttps://doi.org/10.1007/s10515-006-5467-3openalex-snapshot
Combining Proof Plans with Partial Order Planning for Imperative Program Synthesis
inferred← citeshttps://doi.org/10.1007/s10817-009-9125-xopenalex-snapshot
On Process Equivalence = Equation Solving in CCS
inferred← citeshttps://doi.org/10.1007/s10817-009-9144-7openalex-snapshot
Computer Assisted Reasoning
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50020-5openalex-snapshot
Proof-Assistants Using Dependent Type Systems
inferred← citeshttps://doi.org/10.1017/s0956796899003391openalex-snapshot
Transparent optimisation of rewriting combinators
inferred← citeshttps://doi.org/10.1023/a:1018913028597openalex-snapshot
TAME: Using PVS strategies for special-purpose theorem proving
inferred← citeshttps://doi.org/10.1023/a:1018940332714openalex-snapshot
Making a productive use of failure to generate witnesses for coinduction from divergent proof attempts
inferred← citeshttps://doi.org/10.1023/a:1018969728171openalex-snapshot
Proof planning for strategy development
inferred← citeshttps://doi.org/10.1023/a:1021975117537openalex-snapshot
External Rewriting for Skeptical Proof Assistants
inferred← citeshttps://doi.org/10.1109/ase.1999.802091openalex-snapshot
Towards automatic imperative program synthesis through proof planning
inferred← citeshttps://doi.org/10.5525/gla.thesis.4609openalex-snapshot
Supporting formal reasoning about functional programs
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.