1385 search results - page 65 / 277 » Natural Rewriting for General Term Rewriting Systems |
155
click to vote
RTA
2010
Springer
15 years 4 months ago
2010
Springer
Polynomial interpretations are a useful technique for proving termination of term rewrite systems. They come in various flavors: polynomial interpretations with real, rational and...
293
click to vote
POPL
2004
ACM
16 years 6 months ago
2004
ACM
For decades we have been using Chomsky's generative system of grammars, particularly context-free grammars (CFGs) and regular expressions (REs), to express the syntax of prog...
167
click to vote
TLCA
2007
Springer
16 years 7 days ago
2007
Springer
The lambda-Pi-calculus allows to express proofs of minimal predicate logic. It can be extended, in a very simple way, by adding computation rules. This leads to the lambda-Pi-calcu...
160
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
String diagrams are a powerful tool for reasoning about physical processes, logic circuits, tensor networks, and many other compositional structures. The distinguishing feature of...
161
click to vote
ENTCS
2006
15 years 6 months ago
2006
We present an operational semantics for a component composition language called Reo. Reo connectors exogenously compose and coordinate the interactions among individual components...