On graph rewritings

DOI10.1016/0304-3975(84)90021-5zbMath0551.68065MaRDI QIDQ800736

Jean Claude Raoult

Publication date: 1984

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(84)90021-5

zbMATH Keywords

graph rewriting; term rewriting; graph grammars; local confluence

Mathematics Subject Classification ID

68Q45: Formal languages and automata

68Q65: Abstract data types; algebraic specification

Related Items

A categorical manifesto, Confluence for graph transformations, Relational graph rewritings, On categorical graph grammars integrating structural transformations and operations on labels, Algebraic approach to single-pushout graph transformation, Parallel and distributed derivations in the single-pushout approach, Hyperedge replacement jungle rewriting for term-rewriting systems and logic programming, Categorical principles, techniques and results for high-level-replacement systems in computer science, On ``On graph rewritings, Comparison of two graph-rewrite systems, Conditional rewriting logic as a unified model of concurrency, Algebraic transformation of unary partial algebras II: Single-pushout approach, Term graph rewriting and garbage collection using opfibrations, Lambda calculus with explicit recursion, Generating irregular partitionable data structures, A small final coalgebra theorem, Relating graph and term rewriting via Böhm models, Properties of graphs preserved by relational graph rewritings, Implementing term rewriting by jungle evaluation, Graph expressions and graph rewritings, Unnamed Item

Cites Work

• The lambda calculus, its syntax and semantics
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• Unnamed Item
• Unnamed Item
• Unnamed Item