On the public citation graph

Dactl: An experimental graph rewriting language

0 signed · 66 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.1002/spe.4380090105openalex-snapshot

A new implementation technique for applicative languages

inferredcites →https://doi.org/10.1007/3-540-16047-7_49openalex-snapshot

Syntax and informal semantics of DyNe, a parallel language

inferredcites →https://doi.org/10.1007/3-540-17220-3_8openalex-snapshot

Term rewriting systems with priorities

inferredcites →https://doi.org/10.1007/3-540-17943-7_132openalex-snapshot

Transputer-based experiments with the ZAPP architecture

inferredcites →https://doi.org/10.1007/3-540-17945-3_8openalex-snapshot

Term graph rewriting

inferredcites →https://doi.org/10.1007/3-540-18420-1_57openalex-snapshot

Specification of reduction strategies in term rewriting systems

inferredcites →https://doi.org/10.1007/3-540-18625-5_64openalex-snapshot

Lazy pattern matching in the ML language

inferredcites →https://doi.org/10.1007/3-540-18771-5_40openalex-snapshot

Tutorial introduction to the algebraic approach of graph grammars

inferredcites →https://doi.org/10.1007/3-540-52592-0_68openalex-snapshot

The specificity rule for lazy pattern-matching in ambiguous term rewrite systems

inferredcites →https://doi.org/10.1007/bf01448013openalex-snapshot

Über die Bausteine der mathematischen Logik

inferredcites →https://doi.org/10.1016/0167-8191(89)90126-9openalex-snapshot

LEAN: An intermediate language based on graph rewriting

inferredcites →https://doi.org/10.1016/0304-3975(80)90013-4openalex-snapshot

Computation on graph-like expressions

inferredcites →https://doi.org/10.1016/0304-3975(80)90051-1openalex-snapshot

Optimal evaluations of graph-like expressions

inferredcites →https://doi.org/10.1016/0304-3975(84)90021-5openalex-snapshot

On graph rewritings

inferredcites →https://doi.org/10.1016/0304-3975(87)90079-xopenalex-snapshot

On “on graph rewritings”

inferredcites →https://doi.org/10.1016/0304-3975(90)90036-hopenalex-snapshot

Implementing term rewrite languages in dactl

inferredcites →https://doi.org/10.1145/357153.357158openalex-snapshot

Programming with Equations

inferredcites →https://doi.org/10.1145/77606.77612openalex-snapshot

A correctness proof for combinator reduction with cycles

inferredcites →https://doi.org/10.1145/96709.96718openalex-snapshot

Interaction nets

inferredcites →https://doi.org/10.25405/ncl.34122060openalex-snapshot

Flagship Computational Models and Machine Architecture

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9781119228974.ch8openalex-snapshot

Case for Support

inferred← citeshttps://doi.org/10.1006/jagm.1996.0818openalex-snapshot

Directed Graph Pattern Matching and Topological Embedding

inferred← citeshttps://doi.org/10.1006/jcss.2001.1790openalex-snapshot

Hierarchical Graph Transformation

inferred← citeshttps://doi.org/10.1006/jvlc.1997.0033openalex-snapshot

A Graph-Rewriting Visual Language for Database Programming

inferred← citeshttps://doi.org/10.1007/3-540-45104-8_30openalex-snapshot

Graph Algorithm Animation with Grrr

inferred← citeshttps://doi.org/10.1007/3-540-45315-6_15openalex-snapshot

Computational Completeness of Programming Languages Based on Graph Transformation

inferred← citeshttps://doi.org/10.1007/3-540-55599-4_81openalex-snapshot

Asynchronous mobile processes and graph rewriting

inferred← citeshttps://doi.org/10.1007/3-540-60044-2_35openalex-snapshot

Pattern matching in directed graphs

inferred← citeshttps://doi.org/10.1007/3-540-61228-9_81openalex-snapshot

On the interleaving semantics of transformation units — A step into GRACE

inferred← citeshttps://doi.org/10.1007/978-3-319-27436-2_4openalex-snapshot

Compiling Collapsing Rules in Certain Constructor Systems

inferred← citeshttps://doi.org/10.1007/978-3-319-63139-4_6openalex-snapshot

A New Functional-Logic Compiler for Curry: Sprite

inferred← citeshttps://doi.org/10.1007/978-3-642-20551-4_1openalex-snapshot

Three Syntactic Theories for Combinatory Graph Reduction

inferred← citeshttps://doi.org/10.1007/978-3-642-24443-8_13openalex-snapshot

Toward a Version Control System for Aspect Oriented Software

inferred← citeshttps://doi.org/10.1007/978-3-662-21551-7_15openalex-snapshot

Relating graph and term rewriting via Böhm models

inferred← citeshttps://doi.org/10.1007/bf01293598openalex-snapshot

Relating graph and term rewriting via Böhm models

inferred← citeshttps://doi.org/10.1007/bfb0015447openalex-snapshot

Linear matching-time algorithm for the directed graph isomorphism problem

inferred← citeshttps://doi.org/10.1007/bfb0017408openalex-snapshot

Graph rewriting in some categories of partial morphisms

inferred← citeshttps://doi.org/10.1007/s001659970005openalex-snapshot

Graph Transformation Units with Interleaving Semantics

inferred← citeshttps://doi.org/10.1007/s10990-007-9015-zopenalex-snapshot

Strongly reducing variants of the Krivine abstract machine

inferred← citeshttps://doi.org/10.1007/s10990-014-9103-9openalex-snapshot

On graph rewriting, reduction, and evaluation in the presence of cycles

inferred← citeshttps://doi.org/10.1016/0304-3975(94)90090-6openalex-snapshot

Term graph rewriting and garbage collection using opfibrations

inferred← citeshttps://doi.org/10.1016/0950-5849(96)01093-2openalex-snapshot

Concurrent object-oriented programming using term graph rewriting techniques

inferred← citeshttps://doi.org/10.1016/j.entcs.2006.10.027openalex-snapshot

Modeling Pointer Redirection as Cyclic Term-graph Rewriting

inferred← citeshttps://doi.org/10.1016/j.scico.2016.06.003openalex-snapshot

Specifying and executing optimizations for generalized control flow graphs

inferred← citeshttps://doi.org/10.1016/s0020-0190(96)00150-0openalex-snapshot

Transitive term graph rewriting

inferred← citeshttps://doi.org/10.1016/s0141-9331(96)01123-4openalex-snapshot

Experience using an intermediate compiler target language for parallel machines

inferred← citeshttps://doi.org/10.1016/s0167-6423(98)00023-9openalex-snapshot

Graph transformation for specification and programming

inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00226-6openalex-snapshot

Generating irregular partitionable data structures

inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80204-xopenalex-snapshot

Proofs as Graphs

inferred← citeshttps://doi.org/10.1109/icapp.1995.472172openalex-snapshot

Essential features of a compiler target language for parallel machines

inferred← citeshttps://doi.org/10.1145/2528932openalex-snapshot

Three syntactic theories for combinatory graph reduction

inferred← citeshttps://doi.org/10.1145/266670.266709openalex-snapshot

Object graph rewriting

inferred← citeshttps://doi.org/10.1145/331697.332340openalex-snapshot

Implementing interaction nets in MONSTR

inferred← citeshttps://doi.org/10.1145/373256.373261openalex-snapshot

A logical framework for reasoning about access control models

inferred← citeshttps://doi.org/10.1145/605434.605437openalex-snapshot

A logical framework for reasoning about access control models

inferred← citeshttps://doi.org/10.1504/ijcat.2016.080484openalex-snapshot

Rewriting rule-based model for aspect-oriented software evolution

inferred← citeshttps://doi.org/10.15760/etd.7964openalex-snapshot

Making Curry with Rice: An Optimizing Curry Compiler

inferred← citeshttps://doi.org/10.2307/j.ctv36xvmkd.9openalex-snapshot

On Graph Rewriting, Reduction and Evaluation

inferred← citeshttps://doi.org/10.3217/jucs-002-04-0164openalex-snapshot

MONSTR I - Fundamental Issues and the Design of MONSTR

inferred← citeshttps://doi.org/10.3233/fi-1996-263401openalex-snapshot

EQUATIONAL TERM GRAPH REWRITING

inferred← citeshttps://doi.org/10.4204/eptcs.309.5openalex-snapshot

Rule-based Graph Repair

inferred← citeshttps://doi.org/10.48550/arxiv.1906.05170openalex-snapshot

Efficient Graph Rewriting

inferred← citeshttps://doi.org/10.48550/arxiv.1911.12884openalex-snapshot

Efficient Recognition of Graph Languages

inferred← citeshttps://doi.org/10.48550/arxiv.2002.02914openalex-snapshot

Improving the GP 2 Compiler

inferred← citeshttps://doi.org/10.48550/arxiv.cs/0503065openalex-snapshot

Data-Structure Rewriting

inferred← citeshttps://doi.org/10.5539/jpl.v5n1p109openalex-snapshot

Basic Concepts of Criminal Law and Setting up Incriminating Norms

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.