On the public citation graph
Function definition in higher-order logic
0 signed · 75 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-52885-7_84openalex-snapshot
Extensions to the rippling-out tactic for guiding inductive proofs
inferredcites →https://doi.org/10.1007/3-540-55602-8_217openalex-snapshot
PVS: A prototype verification system
inferredcites →https://doi.org/10.1007/3-540-58085-9_78openalex-snapshot
The Alf proof editor and its proof engine
inferredcites →https://doi.org/10.1007/3-540-60275-5_54openalex-snapshot
Non-primitive recursive function definitions
inferredcites →https://doi.org/10.1007/3-540-60360-3_38openalex-snapshot
Termination analysis for functional programs using term orderings
inferredcites →https://doi.org/10.1007/3-540-60579-7_5openalex-snapshot
A user's friendly syntax to define recursive functions as typed λ-terms
inferredcites →https://doi.org/10.1007/978-1-4612-2566-9_13openalex-snapshot
Ordinal Bounds for Programs
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/bf00246023openalex-snapshot
Proving termination of normalization functions for conditional expressions
inferredcites →https://doi.org/10.1007/bf01887212openalex-snapshot
Term rewriting and beyond — theorem proving in Isabelle
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/0004-3702(94)90063-9openalex-snapshot
On proving the termination of algorithms by machine
inferredcites →https://doi.org/10.1016/0167-6423(83)90008-4openalex-snapshot
A higher-order implementation of rewriting
inferredcites →https://doi.org/10.1016/0304-3975(94)00021-2openalex-snapshot
Automatizing termination proofs of recursively defined functions
inferredcites →https://doi.org/10.1016/b978-0-444-89880-7.50013-9openalex-snapshot
Unification-Based Induction
inferredcites →https://doi.org/10.1016/b978-0-444-89880-7.50014-0openalex-snapshot
Introducing well-founded function definitions in HOL
inferredcites →https://doi.org/10.1016/s0747-7171(86)80002-5openalex-snapshot
Constructing recursion operators in intuitionistic type theory
inferredcites →https://doi.org/10.1017/cbo9781139172066openalex-snapshot
Notes on Logic and Set Theory
inferredcites →https://doi.org/10.1023/a:1005702928286openalex-snapshot
Partial Functions in a Total Setting
inferredcites →https://doi.org/10.1093/comjnl/38.2.131openalex-snapshot
A mechanically verified verification condition generator
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/10930755_17openalex-snapshot
Inductive Invariants for Nested Recursion
inferred← citeshttps://doi.org/10.1007/11575467_19openalex-snapshot
Termination Analysis of Higher-Order Functional Programs
inferred← citeshttps://doi.org/10.1007/11814771_48openalex-snapshot
Partial Recursive Functions in Higher-Order Logic
inferred← citeshttps://doi.org/10.1007/3-540-39185-1_3openalex-snapshot
General Recursion in Type Theory
inferred← citeshttps://doi.org/10.1007/3-540-44659-1_1openalex-snapshot
Fix-Point Equations for Well-Founded Recursion in Type Theory
inferred← citeshttps://doi.org/10.1007/3-540-44659-1_2openalex-snapshot
Programming and Computing in HOL
inferred← citeshttps://doi.org/10.1007/3-540-44659-1_23openalex-snapshot
Functional Procedures in Higher-Order Logic
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_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/3-540-48737-9_4openalex-snapshot
Machine-Checking the Java Specification: Proving Type-Safety
inferred← citeshttps://doi.org/10.1007/978-3-319-08970-6_22openalex-snapshot
Recursive Functions on Lazy Lists via Domains and Topologies
inferred← citeshttps://doi.org/10.1007/978-3-319-21401-6_26openalex-snapshot
The Lean Theorem Prover (System Description)
inferred← citeshttps://doi.org/10.1007/978-3-540-74591-4_5openalex-snapshot
Finding Lexicographic Orders for Termination Proofs in Isabelle/HOL
inferred← citeshttps://doi.org/10.1007/978-3-642-02444-3_10openalex-snapshot
Local Theory Specifications in Isabelle/Isar
inferred← citeshttps://doi.org/10.1007/978-3-642-02444-3_14openalex-snapshot
Using Structural Recursion for Corecursion
inferred← citeshttps://doi.org/10.1007/978-3-642-60858-2_25openalex-snapshot
Tool Support for Logics of Programs
inferred← citeshttps://doi.org/10.1007/bfb0028400openalex-snapshot
Derivation and use of induction schemes in higher-order logic
inferred← citeshttps://doi.org/10.1007/bfb0028403openalex-snapshot
A comparative study of Coq and HOL
inferred← citeshttps://doi.org/10.1007/bfb0055130openalex-snapshot
Generating embeddings from denotational descriptions
inferred← citeshttps://doi.org/10.1007/bfb0105392openalex-snapshot
Theorem Proving in Higher Order Logics
inferred← citeshttps://doi.org/10.1007/s00165-007-0028-5openalex-snapshot
Proof producing synthesis of arithmetic and cryptographic hardware
inferred← citeshttps://doi.org/10.1007/s10817-009-9157-2openalex-snapshot
Partial and Nested Recursive Function Definitions in Higher-order Logic
inferred← citeshttps://doi.org/10.1016/b978-0-444-51624-4.50004-6openalex-snapshot
History of Interactive Theorem Proving
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.10.003openalex-snapshot
Automatic Formal Synthesis of Hardware from Higher Order Logic
inferred← citeshttps://doi.org/10.1016/j.jsc.2008.05.005openalex-snapshot
Shallow confluence of conditional term rewriting systems
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00118-8openalex-snapshot
An ordinal measure based procedure for termination of functions
inferred← citeshttps://doi.org/10.1017/s0960129514000115openalex-snapshot
Partiality and recursion in interactive theorem provers – an overview
inferred← citeshttps://doi.org/10.1023/a:1008763422061openalex-snapshot
Automatic Synthesis of Recursive Programs: The Proof-Planning Paradigm
inferred← citeshttps://doi.org/10.1093/comjnl/40.10.640openalex-snapshot
Treating Partiality in a Logic of Total Functions
inferred← citeshttps://doi.org/10.1093/jigpal/jzr048openalex-snapshot
Computer-assisted human-oriented inductive theorem proving by descente infinie--a manifesto
inferred← citeshttps://doi.org/10.1109/lics65433.2025.00052openalex-snapshot
Functional Stream Semantics for a Synchronous Block-Diagram Compiler
inferred← citeshttps://doi.org/10.1109/synasc.2010.64openalex-snapshot
A Purely Logical Approach to the Termination of Imperative Loops
inferred← citeshttps://doi.org/10.1109/synasc.2012.63openalex-snapshot
Soundness of a Logic-Based Verification Method for Imperative Loops
inferred← citeshttps://doi.org/10.1145/268946.268960openalex-snapshot
Javalight is type-safe---definitely
inferred← citeshttps://doi.org/10.15760/etd.113openalex-snapshot
HOLCF '11: A Definitional Domain Theory for Verifying Functional Programs
inferred← citeshttps://doi.org/10.3166/tsi.24.1161-1185openalex-snapshot
Vérification formelle d'extractions de racines entières
inferred← citeshttps://doi.org/10.4204/eptcs.43.1openalex-snapshot
Recursive Definitions of Monadic Functions
inferred← citeshttps://doi.org/10.48456/tr-601openalex-snapshot
Combining model checking and theorem proving
inferred← citeshttps://doi.org/10.48456/tr-682openalex-snapshot
Translating HOL functions to hardware
inferred← citeshttps://doi.org/10.48550/arxiv.2407.06924openalex-snapshot
foetus -- Termination Checker for Simple Functional Programs
inferred← citeshttps://doi.org/10.5525/gla.thesis.4609openalex-snapshot
Supporting formal reasoning about functional programs
inferred← citeshttps://doi.org/10.7551/mitpress/5641.003.0013openalex-snapshot
A Fixedpoint Approach to (Co)Inductive and (Co)Datatype Definitions
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.