79 search results - page 8 / 16 » Graph Rewriting in Computational Origami |
GG
2004
Springer
14 years 26 days ago
2004
Springer
Refactorings are transformations that change the structure of a program, while preserving the behavior. The topic has attracted a lot of attention recently, since it is a promising...
RTA
2007
Springer
14 years 1 months ago
2007
Springer
We investigate garbage collection of unreachable parts of rooted graphs from a categorical point of view. First, we define this task as the right adjoint of an inclusion functor. ...
MSCS
2007
13 years 7 months ago
2007
Introduced at the end of the nineties, the Rewriting Calculus (ρ-calculus, for short) is a simple calculus that fully integrates term-rewriting and λ-calculus. The rewrite rules...
MFCS
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. The description of a single state of a modelled system is often complex in practice, but few procedures for synthesis address this problem in depth. We study systems in w...
FOSSACS
2004
Springer
14 years 27 days ago
2004
Springer
Several types of term rewriting systems can be distinguished by the way their rules overlap. In particular, we define the classes of prefix, suffix, bottom-up and top-down system...