scientific article; zbMATH DE number 234035
From MaRDI portal
Publication:5287535
Recommendations
- Essentials of term graph rewriting
- scientific article; zbMATH DE number 2016092
- scientific article; zbMATH DE number 1231508
- Proceedings of the 6th international workshop on computing with terms and graphs, TERMGRAPH 2011, Saarbrücken, Germany, April 2, 2011
- Proceedings of the 7th international workshop on computing with terms and graphs, TERMGRAPH 2013, Rome, Italy, March, 23, 2013
Cited in
(61)- Semantics and strong sequentiality of priority term rewriting systems
- Lambda calculus with explicit recursion
- A comparison of tree transductions defined by monadic second order logic and by attribute grammars
- Relating conflict-free stable transition and event models via redex families
- Comparing logics for rewriting: Rewriting logic, action calculi and tile logic
- Decidable call-by-need computations in term rewriting
- Bisimilarity in term graph rewriting.
- Descendants and origins in term rewriting.
- Efficient graph rewriting and its implementation
- Relating graph and term rewriting via Böhm models
- Highlights in infinitary rewriting and lambda calculus
- Transformation rules with nested application conditions: critical pairs, initial conflicts \& minimality
- Context-sensitive fusion grammars and fusion grammars with forbidden context are universal
- Labelled graph strategic rewriting for social networks
- GS theories: a syntax for higher-order graphs
- Using term-graph rewriting models to analyse relative space efficiency
- Term-graph rewriting in \textsc{Tom} using relative positions
- On term-graph rewrite strategies
- Towards a sharing strategy for the graph rewriting calculus
- Sharing in the graph rewriting calculus
- The first-order theory of ground tree rewrite graphs
- Term-Graph Rewriting Via Explicit Paths
- Embedding and Confluence of Graph Transformations with Negative Application Conditions
- Unfolding-Based Diagnosis of Systems with an Evolving Topology
- Proceedings of the first international workshop on term graph rewriting (TERMGRAPH 2002), Barcelona, Spain, October 7, 2002
- A Heterogeneous Pushout Approach to Term-Graph Transformation
- Towards ``mouldable code via nested code graph transformation
- scientific article; zbMATH DE number 1231508 (Why is no real title available?)
- scientific article; zbMATH DE number 1290294 (Why is no real title available?)
- scientific article; zbMATH DE number 2016092 (Why is no real title available?)
- scientific article; zbMATH DE number 1543055 (Why is no real title available?)
- Foreword: special issue on term and graph rewriting
- The contractum in algebraic graph rewriting
- Synchronized composition of graph grammar productions
- Term graph rewriting
- A complete proof system for nested term graphs
- Categorical rewriting of term-like structures
- Solving equations by graph transformation
- Essentials of term graph rewriting
- A dynamic logic for termgraph rewriting
- Rewriting on cyclic structures: Equivalence between the operational and the categorical description
- Proceedings of the 7th international workshop on computing with terms and graphs, TERMGRAPH 2013, Rome, Italy, March, 23, 2013
- Proceedings of the 6th international workshop on computing with terms and graphs, TERMGRAPH 2011, Saarbrücken, Germany, April 2, 2011
- Nested term graphs (work in progress)
- A simple parallel implementation of interaction nets in Haskell
- Semantics-preserving DPO-based term graph rewriting
- Lazy rewriting and eager machinery
- Semantics and strong sequentially of priority term rewriting systems
- Critical pairs in term graph rewriting
- Initial conflicts for transformation rules with nested application conditions
- Graph-based communication in Eden
- Lawvere categories as composed PROPs
- Compiling collapsing rules in certain constructor systems
- Interaction nets and term rewriting systems (extended abstract)
- Relative normalization in Deterministic Residual Structures
- Rewriting logic as a semantic framework for concurrency: a progress report
- On termination of graph rewriting
- Concurrent graph and term graph rewriting
- Locating the contractum in the double pushout approach
- Term rewriting: Some experimental results
- Programming with narrowing: a tutorial
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5287535)
