Sciweavers

273 search results - page 1 / 55
» A Compositional Semantics for Conditional Term Rewriting Sys...
Sort
View
94
Voted
AGP
1994
IEEE
15 years 1 months ago
A Compositional Semantics for Conditional Term Rewriting Systems
This paper considers compositions of conditional term rewriting systems as a basis for a modular approach to the design and analysis of equational logic programs. In this context,...
María Alpuente, Moreno Falaschi, Marí...
74
Voted
FSTTCS
2008
Springer
14 years 11 months ago
A Hierarchy of Semantics for Non-deterministic Term Rewriting Systems
ABSTRACT. Formalisms involving some degree of nondeterminism are frequent in computer science. In particular, various programming or specification languages are based on term rewr...
Juan Rodríguez-Hortalá
ENTCS
2008
85views more  ENTCS 2008»
14 years 10 months ago
Innermost Termination of Rewrite Systems by Labeling
Semantic labeling is a powerful transformation technique for proving termination of term rewrite systems. The semantic part is given by a model or a quasi-model of the rewrite rul...
René Thiemann, Aart Middeldorp
ENTCS
2006
135views more  ENTCS 2006»
14 years 10 months ago
Formal Semantics and Analysis of Component Connectors in Reo
We present an operational semantics for a component composition language called Reo. Reo connectors exogenously compose and coordinate the interactions among individual components...
Mohammad Reza Mousavi, Marjan Sirjani, Farhad Arba...