On the public citation graph

Rewrite systems on a lattice of types

https://doi.org/10.1007/bf00264228
0 signed · 34 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-08342-1_36openalex-snapshot
Data types as objects
inferredcites →https://doi.org/10.1007/3-540-10828-9_61openalex-snapshot
On the algebraic specification of nondeterministic programming languages
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/bfb0079432openalex-snapshot
Data types as lattices
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/c2013-0-11758-8openalex-snapshot
A Many-Sorted Calculus Based on Resolution and Paramodulation
inferredcites →https://doi.org/10.1109/tc.1976.1674701openalex-snapshot
A Search Technique for Clause Interconnectivity Graphs
inferredcites →https://doi.org/10.1137/0205037openalex-snapshot
Data Types as Lattices
inferredcites →https://doi.org/10.1145/321250.321253openalex-snapshot
A Machine-Oriented Logic Based on the Resolution Principle
inferredcites →https://doi.org/10.1145/359657.359666openalex-snapshot
Abstract data types and software validation
inferredcites →https://doi.org/10.21236/ada239419openalex-snapshot
Mathematical Theory of Computation
inferredcites →https://doi.org/10.2307/1968867openalex-snapshot
On Theories with a Combinatorial Definition of "Equivalence"
inferredcites →https://doi.org/10.2307/2005152openalex-snapshot
Computational Problems in Abstract Algebra

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-16780-3_117openalex-snapshot
A classification of many-sorted unification problems
inferred← citeshttps://doi.org/10.1007/3-540-16780-3_118openalex-snapshot
Unification in many-sorted equational theories
inferred← citeshttps://doi.org/10.1007/3-540-16780-3_96openalex-snapshot
Using narrowing to do isolation in symbolic equation solving — an experiment in automated reasoning
inferred← citeshttps://doi.org/10.1007/3-540-52292-1_11openalex-snapshot
Introduction to PROGRESS, an attribute graph grammar based specification language
inferred← citeshttps://doi.org/10.1007/3-540-52337-6_17openalex-snapshot
Many-sorted inferences in automated theorem proving
inferred← citeshttps://doi.org/10.1007/978-3-642-71145-9_9openalex-snapshot
Unification in a Many-sorted Calculus with Declarations
inferred← citeshttps://doi.org/10.1007/978-3-642-83739-5_4openalex-snapshot
Many-Sorted Resolution
inferred← citeshttps://doi.org/10.1007/bf00128778openalex-snapshot
Taxonomic reasoning with many-sorted logics
inferred← citeshttps://doi.org/10.1007/bf00243207openalex-snapshot
A more expressive formulation of many sorted logic
inferred← citeshttps://doi.org/10.1007/bf01211433openalex-snapshot
Generator induction in order sorted algebras
inferred← citeshttps://doi.org/10.1007/bfb0012856openalex-snapshot
Program synthesis by completion with dependent subtypes
inferred← citeshttps://doi.org/10.1007/bfb0015747openalex-snapshot
Operational semantics for order-sorted algebra
inferred← citeshttps://doi.org/10.1007/bfb0017419openalex-snapshot
Progress: A VHL-language based on graph grammars
inferred← citeshttps://doi.org/10.1007/bfb0026103openalex-snapshot
Equational completion in order-sorted algebras extended abstract
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90034-fopenalex-snapshot
Equational completion in order-sorted algebras
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90302-vopenalex-snapshot
Order-sorted algebra I: equational deduction for multiple inheritance, overloading, exceptions and partial operations
inferred← citeshttps://doi.org/10.1016/b978-0-12-046371-8.50016-xopenalex-snapshot
Order-Sorted Equational Computation
inferred← citeshttps://doi.org/10.1016/b978-0-273-08718-2.50019-5openalex-snapshot
References
inferred← citeshttps://doi.org/10.1016/b978-0-444-88074-1.50011-1openalex-snapshot
Rewrite Systems
inferred← citeshttps://doi.org/10.1145/42267.45071openalex-snapshot
Many-sorted unification
inferred← citeshttps://doi.org/10.1515/9783112720875openalex-snapshot
A Model Theoretic Oriented Approach to Partial Algebras
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.