Towards a Sharing Strategy for the Graph Rewriting Calculus
From MaRDI portal
Publication:2873680
DOI10.1016/j.entcs.2008.03.057zbMath1279.68111OpenAlexW2161662583MaRDI QIDQ2873680
Claude Kirchner, Horatiu Cirstea, Paolo Baldan, Clara Bertolissi
Publication date: 24 January 2014
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.entcs.2008.03.057
confluencesharingreduction strategiesrewriting calculusterm graphsmatching and unification constraints
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lambda calculus with explicit recursion
- Distributive ρ-calculus
- Pure patterns type systems
- Completion of a Set of Rules Modulo a Set of Equations
- Complete Sets of Reductions for Some Equational Theories
- Rewriting on cyclic structures: Equivalence between the operational and the categorical description
- Term rewriting in CTΣ
- A rewriting calculus for cyclic higher-order term graphs
- Theoretical Computer Science
- Types for Proofs and Programs
This page was built for publication: Towards a Sharing Strategy for the Graph Rewriting Calculus