23201 search results - page 94 / 4641 » Rewriting Systems with Data |
313
click to vote
LICS
1994
IEEE
15 years 9 months ago
1994
IEEE
Higher-order narrowing is a general method for higher-order equational reasoning and serves for instance as the foundation for the integration of functional and logic programming. ...
159
click to vote
RTA
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. In this paper we introduce a modular framework which allows to infer (feasible) upper bounds on the (derivational) complexity of term rewrite systems by combining differ...
159
click to vote
CORR
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. This paper presents two new approaches to prove termination of rewrite systems with the Knuth-Bendix order efficiently. The constraints for the weight function and for th...
171
click to vote
FCT
1999
Springer
15 years 9 months ago
1999
Springer
The aim of this paper is to investigate the relation between two models of concurrent systems: tile rewrite systems and coalgebras. Tiles are rewrite rules with side e ects which a...
130
click to vote
VLDB
1997
ACM
15 years 9 months ago
1997
ACM
In recentyears,databaseresearchandproduct developmentactivities havefocusedonsupport for non-traditional data types, such astext or multi-media documents.This paper describes an a...