5499 search results - page 7 / 1100 » Generalized Rewrite Theories |
110
Voted
ENTCS
2008
14 years 11 months ago
2008
Reo is a language for coordinating autonomous components in distributed environments. Coordination in Reo is performed by circuit-like connectors, which are constructed from primi...
101
click to vote
DOCENG
2003
ACM
15 years 5 months ago
2003
ACM
XPath [3, 5] is a powerful and quite successful language able to perform complex node selection in trees through compact specifications. As such, it plays a growing role in many ...
101
click to vote
RTA
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. Interaction nets are a graphical formalism inspired by Linear Logic proof-nets often used for studying higher order rewriting e.g. β-reduction. Traditional presentations...
104
click to vote
MSCS
2007
14 years 11 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...
107
click to vote
ENTCS
2002
14 years 11 months ago
2002
The last few years have seen the development of a new calculus which can be considered as an outcome of the last decade of various researches on (higher order) term rewriting syst...