On the public citation graph

Implementing parallel rewriting

https://doi.org/10.1007/bfb0024172
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-08531-9openalex-snapshot
Computing in systems described by equations
inferredcites →https://doi.org/10.1007/3-540-17220-3_3openalex-snapshot
A compiler for conditional term rewriting systems
inferredcites →https://doi.org/10.1007/3-540-18420-1_50openalex-snapshot
Concurrent term rewriting as a model of computation
inferredcites →https://doi.org/10.1007/3-540-19242-5_10openalex-snapshot
Compiling conditional rewriting systems
inferredcites →https://doi.org/10.1007/3-540-19242-5_22openalex-snapshot
An introduction to OBJ 3
inferredcites →https://doi.org/10.1007/3-540-51081-8_140openalex-snapshot
A parallel implementation of rewriting and narrowing
inferredcites →https://doi.org/10.1007/bfb0039072openalex-snapshot
Rewriting as a unified model of concurrency
inferredcites →https://doi.org/10.1016/0010-4485(78)90044-1openalex-snapshot
Computing in systems described by equations
inferredcites →https://doi.org/10.1016/0743-1066(89)90030-7openalex-snapshot
An implementation of narrowing
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/b978-0-444-88074-1.50011-1openalex-snapshot
Rewrite Systems
inferredcites →https://doi.org/10.1016/s0019-9958(85)80003-6openalex-snapshot
Computing with rewrite systems
inferredcites →https://doi.org/10.1093/comjnl/34.1.20openalex-snapshot
Implementations of Term Rewriting Systems
inferredcites →https://doi.org/10.1145/318593.318610openalex-snapshot
Principles of OBJ2
inferredcites →https://doi.org/10.1145/322290.322295openalex-snapshot
Pattern Matching in Trees
inferredcites →https://doi.org/10.1145/62297.62338openalex-snapshot
Trillium operating system
inferredcites →https://doi.org/10.21236/ada210528openalex-snapshot
The Rewrite Rule Machine Project

What points at this work

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

inferred← citeshttps://doi.org/10.1006/jsco.1999.0288openalex-snapshot
Elimination of Conditions
inferred← citeshttps://doi.org/10.1007/3-540-56503-5_17openalex-snapshot
On fairness in distributed automated deduction
inferred← citeshttps://doi.org/10.1007/3-540-58184-7_138openalex-snapshot
Rewriting: An effective model of concurrency
inferred← citeshttps://doi.org/10.1007/3-540-59200-8_53openalex-snapshot
Concurrent garbage collection for concurrent rewriting
inferred← citeshttps://doi.org/10.1007/3-540-60381-6_11openalex-snapshot
How to transform canonical decreasing CTRSs into equivalent canonical TRSs
inferred← citeshttps://doi.org/10.1007/3-540-61604-7_64openalex-snapshot
Rewriting logic as a semantic framework for concurrency: a progress report
inferred← citeshttps://doi.org/10.1007/3-540-61629-2_40openalex-snapshot
Experiments with partial evaluation domains for rewrite specifications
inferred← citeshttps://doi.org/10.1007/3-540-61697-7_17openalex-snapshot
A master-slave approach to parallel term rewriting on a hierarchical multiprocessor
inferred← citeshttps://doi.org/10.1007/3-540-61735-3_1openalex-snapshot
Toward the concurrent implementation of computational systems
inferred← citeshttps://doi.org/10.1007/978-3-0348-8800-4_1openalex-snapshot
Parallel Completion Techniques
inferred← citeshttps://doi.org/10.1007/978-3-319-63516-3_6openalex-snapshot
Parallel Theorem Proving
inferred← citeshttps://doi.org/10.1007/978-3-642-58622-4_10openalex-snapshot
Research Directions in Rewriting Logic
inferred← citeshttps://doi.org/10.1007/bf00881910openalex-snapshot
Parallelization of deduction strategies: An analytical study
inferred← citeshttps://doi.org/10.1007/bfb0002874openalex-snapshot
Design and implementation of parallel TRAM
inferred← citeshttps://doi.org/10.1007/bfb0013183openalex-snapshot
Distributed deduction by Clause-Diffusion: the aquarius prover
inferred← citeshttps://doi.org/10.1007/bfb0013825openalex-snapshot
Definitional trees
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00032-5openalex-snapshot
ELAN
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00036-2openalex-snapshot
Distributed Logic Objects
inferred← citeshttps://doi.org/10.1023/a:1018932114059openalex-snapshot
A taxonomy of parallel strategies for deduction
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.