79 search results - page 7 / 16 » Graph Rewriting in Computational Origami |
110
Voted
GG
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. Hierarchical graph transformation as defined in [1, 2] extends double-pushout graph transformation in the spirit of term rewriting: Graphs are provided with hierarchical...
119
Voted
PODC
2009
ACM
16 years 3 months ago
2009
ACM
In 2004, Klavins et al. introduced the use of graph grammars to describe--and to program--systems of self-assembly. It turns out that these graph grammars can be embedded in a gra...
118
click to vote
RELMICS
2009
Springer
15 years 10 months ago
2009
Springer
We define collagories essentially as “distributive allegories without zero morphisms”, and show that they are sufficient for accommodating the relation-algebraic approach to ...
119
click to vote
RTA
2009
Springer
15 years 10 months ago
2009
Springer
We address the problem of cyclic termgraph rewriting. We propose a new framework where rewrite rules are tuples of the form (L, R, τ, σ) such that L and R are termgraphs represen...
127
click to vote
ENTCS
2007
15 years 3 months ago
2007
The tracer Hat records in a detailed trace the computation of a program written in the lazy functional language Haskell. The trace can then be viewed in various ways to support pr...