On the public citation graph

Higher-order annotated terms for proof search

https://doi.org/10.1007/bfb0105418
0 signed · 36 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-52885-7_123openalex-snapshot
The OYSTER-CLAM system
inferredcites →https://doi.org/10.1007/3-540-56610-4_77openalex-snapshot
About the theory of tree embedding
inferredcites →https://doi.org/10.1007/3-540-58156-1_34openalex-snapshot
Termination orderings for rippling
inferredcites →https://doi.org/10.1007/3-540-60381-6_2openalex-snapshot
A calculus for rippling
inferredcites →https://doi.org/10.1007/3-540-63104-6_30openalex-snapshot
A colored version of the λ-calculus
inferredcites →https://doi.org/10.1007/978-94-009-1675-3_5openalex-snapshot
A Calculus for and Termination of Rippling
inferredcites →https://doi.org/10.1007/bf00244493openalex-snapshot
Challenge problems in elementary calculus
inferredcites →https://doi.org/10.1007/bf00881900openalex-snapshot
Implementing tactics and tacticals in a higher-order logic programming language
inferredcites →https://doi.org/10.1007/bfb0012826openalex-snapshot
The use of explicit plans to guide inductive proofs
inferredcites →https://doi.org/10.1007/bfb0013606openalex-snapshot
A logic programming approach to implementing higher-Order term rewriting
inferredcites →https://doi.org/10.1007/bfb0038698openalex-snapshot
A logic programming language with lambda-abstraction, function variables, and simple unification
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/0743-1066(86)90015-4openalex-snapshot
Natural deduction as higher-order resolution
inferredcites →https://doi.org/10.1093/logcom/1.4.497openalex-snapshot
A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification
inferredcites →https://doi.org/10.1109/lics.1991.151658openalex-snapshot
Higher-order critical pairs
inferredcites →https://doi.org/10.1145/138027.138060openalex-snapshot
A framework for defining logics
inferredcites →https://doi.org/10.2307/2185110openalex-snapshot
The | lambda-Calculus.

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11829263_5openalex-snapshot
Best-First Rippling
inferred← citeshttps://doi.org/10.1007/3-540-36078-6_7openalex-snapshot
Proof Planning for Feature Interactions: A Preliminary Report
inferred← citeshttps://doi.org/10.1007/3-540-44755-5_14openalex-snapshot
Ordinal Arithmetic: A Case Study for Rippling in a Higher Order Domain
inferred← citeshttps://doi.org/10.1007/3-540-45470-5_28openalex-snapshot
Inductive Theorem Proving and Computer Algebra in the MathWeb Software Bus
inferred← citeshttps://doi.org/10.1007/3-540-45685-6_13openalex-snapshot
A Comparison of Two Proof Critics: Power vs. Robustness
inferred← citeshttps://doi.org/10.1007/3-540-48958-4_15openalex-snapshot
Invariant Discovery via Failed Proof Attempts
inferred← citeshttps://doi.org/10.1007/3-540-63104-6_30openalex-snapshot
A colored version of the λ-calculus
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-642-14052-5_21openalex-snapshot
Case-Analysis for Rippling and Inductive Proof
inferred← citeshttps://doi.org/10.1007/978-3-642-17172-7_6openalex-snapshot
Dynamic Rippling, Middle-Out Reasoning and Lemma Discovery
inferred← citeshttps://doi.org/10.1007/bfb0054254openalex-snapshot
System description: Proof planning in higher-order logic with λClam
inferred← citeshttps://doi.org/10.1007/s10817-010-9177-yopenalex-snapshot
The Use of Embeddings to Provide a Clean Separation of Term and Annotation for Higher Order Rippling
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.11.028openalex-snapshot
Poitín: Distilling Theorems From Conjectures
inferred← citeshttps://doi.org/10.1017/s0956796899003408openalex-snapshot
Automatic verification of functions with accumulating parameters
inferred← citeshttps://doi.org/10.1023/a:1006282725324openalex-snapshot
Managing Structural Information by Higher-Order Colored Unification
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/ase.1999.802091openalex-snapshot
Towards automatic imperative program synthesis through proof planning
inferred← citeshttps://doi.org/10.3233/fi-2010-305openalex-snapshot
Automation for Dependently Typed Functional Programming
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.