A higher-order calculus for graph transformation
This paper presents a formalism for defining higher-order systems based on the notion of graph transformation (by rewriting or interaction). The syntax is inspired by the Combinatory Reduction Systems of Klop. The rewrite rules can be used to define first-order systems, such as graph or term-graph r...
| Autor principal: | |
|---|---|
| Outros Autores: | , |
| Formato: | article |
| Idioma: | eng |
| Publicado em: |
2007
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/1822/2226 |
| País: | Portugal |
| Oai: | oai:repositorium.sdum.uminho.pt:1822/2226 |