113 search results - page 11 / 23 » Reduction Strategies for Left-Linear Term Rewriting Systems |
120
click to vote
ENTCS
2007
15 years 9 days ago
2007
Narrowing was originally introduced to solve equational E-unification problems. It has also been recognized as a key mechanism to unify functional and logic programming. In both ...
AMAST
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. Declarative debugging has been applied to many declarative programming paradigms; in this paper, a declarative debugger for rewriting logic specifications, embodied in th...
WFLP
2000
Springer
15 years 3 months ago
2000
Springer
Constructor Systems (CSs) are an important subclass of Term Rewriting Systems (TRSs) which can be used stract model of some programming languages. While normalizing strategies are...
104
click to vote
LFP
1990
15 years 1 months ago
1990
PCF, as considered in this paper, is a lazy typed lambda calculus with functions, pairing, fixed-point operators and arbitrary algebraic data types. The natural equational axioms ...
201
Voted
POPL
2003
ACM
16 years 20 days ago
2003
ACM
We introduce a new framework of algebraic pure type systems in which we consider rewrite rules as lambda terms with patterns and rewrite rule application as abstraction applicatio...