On the public citation graph

Equational completion in order-sorted algebras extended abstract

https://doi.org/10.1007/bfb0026103
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.
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_26openalex-snapshot
Miranda: A non-strict functional language with polymorphic types
inferredcites →https://doi.org/10.1007/3-540-15976-2_9openalex-snapshot
Termination
inferredcites →https://doi.org/10.1007/3-540-15984-3_295openalex-snapshot
ERIL — Equational reasoning: an interactive laboratory
inferredcites →https://doi.org/10.1007/3-540-15984-3_296openalex-snapshot
Implementation of a general completion procedure parameterized by built-in theories and strategies
inferredcites →https://doi.org/10.1007/3-540-16780-3_118openalex-snapshot
Unification in many-sorted equational theories
inferredcites →https://doi.org/10.1007/3-540-19242-5_17openalex-snapshot
Confluent term rewriting systems with membership conditions
inferredcites →https://doi.org/10.1007/3-540-19488-6_123openalex-snapshot
Operational semantics of OBJ-3
inferredcites →https://doi.org/10.1007/978-0-387-34768-4_11openalex-snapshot
Termination of a Set of Rules Modulo a Set of Equations
inferredcites →https://doi.org/10.1007/978-0-387-34768-4_17openalex-snapshot
A General Inductive Completion Algorithm and Application to Abstract Data Types
inferredcites →https://doi.org/10.1007/978-3-642-81955-1_23openalex-snapshot
Simple Word Problems in Universal Algebras
inferredcites →https://doi.org/10.1007/bf00264228openalex-snapshot
Rewrite systems on a lattice of types
inferredcites →https://doi.org/10.1007/bfb0015747openalex-snapshot
Operational semantics for order-sorted algebra
inferredcites →https://doi.org/10.1007/bfb0036919openalex-snapshot
Rewrite methods for clausal and non-clausal theorem proving
inferredcites →https://doi.org/10.1016/0022-0000(81)90002-7openalex-snapshot
A complete proof of correctness of the Knuth-Bendix completion algorithm
inferredcites →https://doi.org/10.1016/0022-0000(82)90006-xopenalex-snapshot
Proofs by induction in equational theories with constructors
inferredcites →https://doi.org/10.1016/0167-6423(87)90004-9openalex-snapshot
Reveur-3: the implementation of a general completion procedure parameterized by built-in theories and strategies
inferredcites →https://doi.org/10.1016/0304-3975(82)90026-3openalex-snapshot
Orderings for term-rewriting systems
inferredcites →https://doi.org/10.1016/0304-3975(86)90019-8openalex-snapshot
Abstract data types with exception handling: An initial approach based on a distinction between exceptions and errors
inferredcites →https://doi.org/10.1016/0304-3975(89)90003-0openalex-snapshot
Completion for rewriting modulo a congruence
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(89)80036-7openalex-snapshot
Order-sorted unification
inferredcites →https://doi.org/10.1038/190864b0openalex-snapshot
Journal of the Association for Computing Machinery
inferredcites →https://doi.org/10.1137/0215084openalex-snapshot
Completion of a Set of Rules Modulo a Set of Equations
inferredcites →https://doi.org/10.1145/24714.24719openalex-snapshot
Remarks on remarks on many-sorted equational logic
inferredcites →https://doi.org/10.1145/318593.318610openalex-snapshot
Principles of OBJ2
inferredcites →https://doi.org/10.1145/322217.322230openalex-snapshot
Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
inferredcites →https://doi.org/10.1145/322248.322251openalex-snapshot
Complete Sets of Reductions for Some Equational Theories
inferredcites →https://doi.org/10.1145/357153.357158openalex-snapshot
Programming with Equations
inferredcites →https://doi.org/10.1145/800017.800519openalex-snapshot
Completion of a set of rules modulo a set of equations
inferredcites →https://doi.org/10.1145/800087.802799openalex-snapshot
HOPE
inferredcites →https://doi.org/10.1145/947864.947865openalex-snapshot
Completeness of many-sorted equational logic
inferredcites →https://doi.org/10.2307/1968867openalex-snapshot
On Theories with a Combinatorial Definition of "Equivalence"

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-49253-4_15openalex-snapshot
Term Rewriting in a Logic of Special Relations
inferred← citeshttps://doi.org/10.1007/3-540-50939-9_136openalex-snapshot
Order-sorted completion: The many-sorted way
inferred← citeshttps://doi.org/10.1007/3-540-55253-7_11openalex-snapshot
ELIOS-OBJ theorem proving in a specification language
inferred← citeshttps://doi.org/10.1007/3-540-56393-8_30openalex-snapshot
Completeness and confluence of order-sorted term rewriting
inferred← citeshttps://doi.org/10.1007/bfb0014447openalex-snapshot
What is an Abstract Data Type, after all?
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90105-qopenalex-snapshot
Order-sorted completion: the many-sorted way
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90322-7openalex-snapshot
Semantics of order-sorted specifications
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.03.012openalex-snapshot
Abstract canonical presentations
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80013-1openalex-snapshot
Rewriting Logic as a Logic of Special Relations
inferred← citeshttps://doi.org/10.1109/lics.2003.1210046openalex-snapshot
Abstract saturation-based inference
inferred← citeshttps://doi.org/10.5555/100296.100318openalex-snapshot
System support for modular order-sorted horn clause specifications
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.