Locating the contractum in the double pushout approach

DOI10.1016/0304-3975(94)00301-4zbMATH Open0872.68077OpenAlexW1995569542MaRDI QIDQ672236FDOQ672236

Authors: Richard Banach 

Publication date: 27 February 1997

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

Full work available at URL: https://doi.org/10.1016/0304-3975(94)00301-4

Recommendations

• The contractum in algebraic graph rewriting
• scientific article; zbMATH DE number 1638662
• scientific article; zbMATH DE number 177420
• scientific article; zbMATH DE number 139800
• scientific article; zbMATH DE number 177452

zbMATH Keywords

algebraic graph rewritingdouble pushout graph rewritingterm graph rewriting

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Cites Work

• Title not available (Why is that?)
• LEAN: An intermediate language based on graph rewriting
• Title not available (Why is that?)
• Title not available (Why is that?)
• Term graph rewriting and garbage collection using opfibrations
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Pushout-Properties: An analysis of gluing constructions for graphs
• Parallelism and concurrency in high-level replacement systems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Canonical derivations for high-level replacement systems

Cited In (2)

• The contractum in algebraic graph rewriting
• Regular relations and bicartesian squares

This page was built for publication: Locating the contractum in the double pushout approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q672236)