Sciweavers

94 search results - page 14 / 19
» Confluence of Conditional Rewrite Systems
Sort
View
LACL
2005
Springer
14 years 1 months ago
A Note on the Complexity of Constraint Interaction: Locality Conditions and Minimalist Grammars
Locality Conditions (LCs) on (unbounded) dependencies have played a major role in the development of generative syntax ever since the seminal work by Ross [22]. Descriptively, they...
Hans-Martin Gärtner, Jens Michaelis
ACL2
2006
ACM
14 years 1 months ago
Parameterized congruences in ACL2
Support for congruence-based rewriting is built into ACL2. This capability allows ACL2 to treat certain predicate relations ”just like equality” under appropriate conditions a...
David Greve
CADE
2010
Springer
13 years 6 months ago
Monotonicity Criteria for Polynomial Interpretations over the Naturals
Polynomial interpretations are a useful technique for proving termination of term rewrite systems. In an automated setting, termination tools are concerned with parametric polynomi...
Friedrich Neurauter, Aart Middeldorp, Harald Zankl
POPL
2007
ACM
14 years 7 months ago
Semantics of static pointcuts in aspectJ
In aspect-oriented programming, one can intercept events by writing patterns called pointcuts. The pointcut language of the most popular aspect-oriented programming language, Aspe...
Pavel Avgustinov, Elnar Hajiyev, Neil Ongkingco, O...
DLT
2004
13 years 9 months ago
On Competence in CD Grammar Systems
Abstract. We investigate the generative power of cooperating distributed grammar systems (CDGSs), if the cooperation protocol is based on the level of competence on the underlying ...
Maurice H. ter Beek, Erzsébet Csuhaj-Varj&u...