Sciweavers

882 search results - page 5 / 177
» A Taste of Rewrite Systems
Sort
View
CADE
2008
Springer
14 years 7 months ago
Modularity of Confluence
We present a novel proof of Toyama's famous modularity of confluence result for term rewriting systems. Apart from being short and intuitive, the proof is modular itself in th...
Vincent van Oostrom
COLING
2010
13 years 2 months ago
Data-Driven Parsing with Probabilistic Linear Context-Free Rewriting Systems
This paper presents a first efficient implementation of a weighted deductive CYK parser for Probabilistic Linear ContextFree Rewriting Systems (PLCFRS), together with context-summ...
Laura Kallmeyer, Wolfgang Maier
TCS
2010
13 years 2 months ago
A compact fixpoint semantics for term rewriting systems
María Alpuente, Marco Comini, Santiago Esco...
RTA
2010
Springer
13 years 11 months ago
Higher-Order (Non-)Modularity
We show that, contrary to the situation in first-order term rewriting, almost none of the usual properties of rewriting are modular for higher-order rewriting, irrespective of the...
Claus Appel, Vincent van Oostrom, Jakob Grue Simon...