A higher-order calculus for graph transformation

Detalhes bibliográficos
Autor(a) principal: Fernández, Maribel
Data de Publicação: 2007
Outros Autores: Mackie, Ian, Pinto, Jorge Sousa
Tipo de documento: Artigo
Idioma: eng
Título da fonte: Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
Texto Completo: http://hdl.handle.net/1822/2226
Resumo: 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.
id RCAP_ef1edac47b6d9ccaadc9f7f7685075d0
oai_identifier_str oai:repositorium.sdum.uminho.pt:1822/2226
network_acronym_str RCAP
network_name_str Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
repository_id_str
spelling A higher-order calculus for graph transformationGraph transformationInteraction netsCombinatory reduction SystemsCombinatory Reduction Systemgraph rewriting systemHigher-order systemThis 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.(undefined)Elsevier B.V.Universidade do MinhoFernández, MaribelMackie, IanPinto, Jorge Sousa20072007-01-01T00:00:00Zinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttp://hdl.handle.net/1822/2226eng1571-066110.1016/j.entcs.2002.09.005info:eu-repo/semantics/openAccessreponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãoinstacron:RCAAP2023-07-21T11:53:54ZPortal AgregadorONG
dc.title.none.fl_str_mv A higher-order calculus for graph transformation
title A higher-order calculus for graph transformation
spellingShingle A higher-order calculus for graph transformation
Fernández, Maribel
Graph transformation
Interaction nets
Combinatory reduction Systems
Combinatory Reduction System
graph rewriting system
Higher-order system
title_short A higher-order calculus for graph transformation
title_full A higher-order calculus for graph transformation
title_fullStr A higher-order calculus for graph transformation
title_full_unstemmed A higher-order calculus for graph transformation
title_sort A higher-order calculus for graph transformation
author Fernández, Maribel
author_facet Fernández, Maribel
Mackie, Ian
Pinto, Jorge Sousa
author_role author
author2 Mackie, Ian
Pinto, Jorge Sousa
author2_role author
author
dc.contributor.none.fl_str_mv Universidade do Minho
dc.contributor.author.fl_str_mv Fernández, Maribel
Mackie, Ian
Pinto, Jorge Sousa
dc.subject.por.fl_str_mv Graph transformation
Interaction nets
Combinatory reduction Systems
Combinatory Reduction System
graph rewriting system
Higher-order system
topic Graph transformation
Interaction nets
Combinatory reduction Systems
Combinatory Reduction System
graph rewriting system
Higher-order system
description 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.
publishDate 2007
dc.date.none.fl_str_mv 2007
2007-01-01T00:00:00Z
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/article
format article
status_str publishedVersion
dc.identifier.uri.fl_str_mv http://hdl.handle.net/1822/2226
url http://hdl.handle.net/1822/2226
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv 1571-0661
10.1016/j.entcs.2002.09.005
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.publisher.none.fl_str_mv Elsevier B.V.
publisher.none.fl_str_mv Elsevier B.V.
dc.source.none.fl_str_mv reponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
instacron:RCAAP
instname_str Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
instacron_str RCAAP
institution RCAAP
reponame_str Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
collection Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1777303638543171584

Registros relacionados