On the public citation graph

Derivation and use of induction schemes in higher-order logic

https://doi.org/10.1007/bfb0028400
0 signed · 30 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-15975-4_48openalex-snapshot
Compiling pattern matching
inferredcites →https://doi.org/10.1007/978-1-4612-3658-0_9openalex-snapshot
Automating Recursive Type Definitions in Higher Order Logic
inferredcites →https://doi.org/10.1007/bfb0012826openalex-snapshot
The use of explicit plans to guide inductive proofs
inferredcites →https://doi.org/10.1007/bfb0014311openalex-snapshot
Automating induction over mutually recursive functions
inferredcites →https://doi.org/10.1007/bfb0055131openalex-snapshot
An interface between CLAM and HOL
inferredcites →https://doi.org/10.1007/bfb0105417openalex-snapshot
Function definition in higher-order logic
inferredcites →https://doi.org/10.1016/0167-6423(85)90009-7openalex-snapshot
Verifying the unification algorithm in LCF
inferredcites →https://doi.org/10.1016/b978-0-444-89880-7.50013-9openalex-snapshot
Unification-Based Induction
inferredcites →https://doi.org/10.1023/a:1005797629953openalex-snapshot
Termination of Nested and Mutually Recursive Algorithms

What points at this work

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

inferred← citeshttps://doi.org/10.1007/10721959_4openalex-snapshot
Wellfounded Schematic Definitions
inferred← citeshttps://doi.org/10.1007/11575467_19openalex-snapshot
Termination Analysis of Higher-Order Functional Programs
inferred← citeshttps://doi.org/10.1007/11591191_26openalex-snapshot
Verifying and Reflecting Quantifier Elimination for Presburger Arithmetic
inferred← citeshttps://doi.org/10.1007/3-540-44525-0_6openalex-snapshot
Reasoning Inductively about Z Specifications via Unification
inferred← citeshttps://doi.org/10.1007/3-540-44659-1_31openalex-snapshot
Another Look at Nested Recursion
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-48256-3_22openalex-snapshot
Lifted-FL: A Pragmatic Implementation of Combined Model Checking and Theorem Proving
inferred← citeshttps://doi.org/10.1007/3-540-48256-3_3openalex-snapshot
Inductive Datatypes in HOL — Lessons Learned in Formal-Logic Engineering
inferred← citeshttps://doi.org/10.1007/3-540-48256-3_6openalex-snapshot
Recursive Function Definition over Coinductive Types
inferred← citeshttps://doi.org/10.1007/978-3-540-24617-6_3openalex-snapshot
Using a Software Testing Technique to Improve Theorem Proving
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-45085-6_22openalex-snapshot
IsaPlanner: A Prototype Proof Planner in Isabelle
inferred← citeshttps://doi.org/10.1007/978-3-642-12002-2_18openalex-snapshot
Automated Termination Analysis for Programs with Second-Order Recursion
inferred← citeshttps://doi.org/10.1007/bfb0055131openalex-snapshot
An interface between CLAM and HOL
inferred← citeshttps://doi.org/10.1007/s10990-008-9038-0openalex-snapshot
Adapting functional programs to higher order logic
inferred← citeshttps://doi.org/10.1023/a:1006408829523openalex-snapshot
Induction Proofs with Partial Functions
inferred← citeshttps://doi.org/10.1093/logcom/exq052openalex-snapshot
Sequent calculi for induction and infinite descent
inferred← citeshttps://doi.org/10.1109/lics.2007.16openalex-snapshot
Complete Sequent Calculi for Induction and Infinite Descent
inferred← citeshttps://doi.org/10.1109/sefm.2005.15openalex-snapshot
Customised induction rules for proving correctness of imperative programs
inferred← citeshttps://doi.org/10.1109/tcad.2005.850814openalex-snapshot
An industrially effective environment for formal hardware verification
inferred← citeshttps://doi.org/10.48550/arxiv.2407.06924openalex-snapshot
foetus -- Termination Checker for Simple 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.