On the public citation graph

Term rewriting and beyond — theorem proving in Isabelle

https://doi.org/10.1007/bf01887212
0 signed · 41 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-09724-4openalex-snapshot
Edinburgh LCF
inferredcites →https://doi.org/10.1007/3-540-16780-3_142openalex-snapshot
REVE a rewrite rule laboratory
inferredcites →https://doi.org/10.1007/3-540-50939-9_143openalex-snapshot
Inductive proofs by resolution and paramodulation
inferredcites →https://doi.org/10.1007/3-540-51081-8_105openalex-snapshot
An overview of LP, the Larch Prover
inferredcites →https://doi.org/10.1007/3-540-52559-9_79openalex-snapshot
Formal verification of data type refinement — Theory and practice
inferredcites →https://doi.org/10.1007/bf00248324openalex-snapshot
The foundation of a generic theorem prover
inferredcites →https://doi.org/10.1007/bf00264598openalex-snapshot
Proving and applying program transformations expressed with second-order patterns
inferredcites →https://doi.org/10.1016/0167-6423(83)90008-4openalex-snapshot
A higher-order implementation of rewriting
inferredcites →https://doi.org/10.1016/0167-6423(89)90038-5openalex-snapshot
Equational reasoning in Isabelle
inferredcites →https://doi.org/10.1016/0378-4754(89)90181-xopenalex-snapshot
A computational logic handbook
inferredcites →https://doi.org/10.1016/0743-1066(86)90015-4openalex-snapshot
Natural deduction as higher-order resolution
inferredcites →https://doi.org/10.1016/b978-0-12-115350-2.50017-8openalex-snapshot
Equations and Rewrite Rules: A Survey
inferredcites →https://doi.org/10.1016/s0747-7171(87)80027-5openalex-snapshot
Complexity of matching problems
inferredcites →https://doi.org/10.1017/cbo9780511526602openalex-snapshot
Logic and Computation
inferredcites →https://doi.org/10.1109/lics.1990.113754openalex-snapshot
Proof transformations for equational theories
inferredcites →https://doi.org/10.1145/318593.318610openalex-snapshot
Principles of OBJ2
inferredcites →https://doi.org/10.1145/321992.321996openalex-snapshot
A Transformation System for Developing Recursive Programs
inferredcites →https://doi.org/10.1145/357162.357169openalex-snapshot
An Efficient Unification Algorithm
inferredcites →https://doi.org/10.1145/960116.54010openalex-snapshot
Higher-order abstract syntax
inferredcites →https://doi.org/10.48456/tr-133openalex-snapshot
A preliminary users manual for Isabelle

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-52559-9_79openalex-snapshot
Formal verification of data type refinement — Theory and practice
inferred← citeshttps://doi.org/10.1007/3-540-57826-9_154openalex-snapshot
AC unification in HOL90
inferred← citeshttps://doi.org/10.1007/3-540-60117-1_3openalex-snapshot
Mathematics of software engineering
inferred← citeshttps://doi.org/10.1007/3-540-63104-6_36openalex-snapshot
RALL: Machine-supported proofs for relation algebra
inferred← citeshttps://doi.org/10.1007/978-3-031-63498-7_1openalex-snapshot
Automated Reasoning for Mathematics
inferred← citeshttps://doi.org/10.1007/978-3-642-24559-6_42openalex-snapshot
Term Rewriting in Logics of Partial Functions
inferred← citeshttps://doi.org/10.1007/978-3-642-78486-6_4openalex-snapshot
Korrekte Software: Vom Experiment zur Anwendung
inferred← citeshttps://doi.org/10.1007/bf00709138openalex-snapshot
Experiences with software specification and verification using LP, the Larch proof assistant
inferred← citeshttps://doi.org/10.1007/bfb0015453openalex-snapshot
Correct software: From experiments to applications
inferred← citeshttps://doi.org/10.1007/bfb0015460openalex-snapshot
KORSO reference languages concepts and application domains
inferred← citeshttps://doi.org/10.1007/bfb0105417openalex-snapshot
Function definition in higher-order logic
inferred← citeshttps://doi.org/10.1007/s10817-009-9120-2openalex-snapshot
Formal Verification of C Systems Code
inferred← citeshttps://doi.org/10.1007/s10817-018-9465-5openalex-snapshot
Introduction to Milestones in Interactive Theorem Proving
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.01.006openalex-snapshot
Strategic Issues, Problems and Challenges in Inductive Theorem Proving
inferred← citeshttps://doi.org/10.1145/1599410.1599423openalex-snapshot
An Isabelle/HOL-based model of stratego-like traversal strategies
inferred← citeshttps://doi.org/10.1561/2500000045openalex-snapshot
QED at Large: A Survey of Engineering of Formally Verified Software
inferred← citeshttps://doi.org/10.26190/unsworks/17927openalex-snapshot
Formal memory models for verifying C systems code
inferred← citeshttps://doi.org/10.3929/ethz-a-006750722openalex-snapshot
Term rewriting in logics of partial functions
inferred← citeshttps://doi.org/10.4204/eptcs.338.3openalex-snapshot
The Specification Language Server Protocol: A Proposal for Standardised LSP Extensions
inferred← citeshttps://doi.org/10.48550/arxiv.2009.01326openalex-snapshot
Check Your (Students') Proofs-With Holes
inferred← citeshttps://doi.org/10.6100/ir641816openalex-snapshot
Efficient rewriting techniques
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.