Utilize este identificador para referenciar este registo:
https://hdl.handle.net/1822/2226| Título: | A higher-order calculus for graph transformation |
| Autor(es): | Fernández, Maribel Mackie, Ian Pinto, Jorge Sousa |
| Palavras-chave: | Graph transformation Interaction nets Combinatory reduction Systems Combinatory Reduction System graph rewriting system Higher-order system |
| Data: | 2007 |
| Editora: | Elsevier B.V. |
| Revista: | Electronic Notes in Theoretical Computer Science |
| Resumo(s): | 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 rewriting systems, Lafont's interaction nets, the interaction systems of Asperti and Laneve, the non-deterministic nets of Alexiev, or a process calculus. They can also be used to specify higher-order systems such as hierarchical graphs and proof nets of Linear Logic, or to specify the operational semantics of graph-based languages. |
| Tipo: | Artigo |
| URI: | https://hdl.handle.net/1822/2226 |
| DOI: | 10.1016/j.entcs.2002.09.005 |
| ISSN: | 1571-0661 |
| Arbitragem científica: | yes |
| Acesso: | Acesso aberto |
| Aparece nas coleções: | DI/CCTC - Artigos (papers) |
