74 search results - page 9 / 15 » Extending Context-Sensitivity in Term Rewriting |
CSL
2005
Springer
14 years 1 months ago
2005
Springer
Since Val Tannen's pioneering work on the combination of simply-typed λ-calculus and rst-order rewriting [11], many authors have contributed to this subject by extending it ...
FORTE
2004
13 years 9 months ago
2004
Abstract Peer-to-peer markets going mobile spur spontaneity in trading considerably. Spontaneity, however, imposes severe informational requirements on the market participants. Inf...
GG
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Hierarchical graph transformation as defined in [1, 2] extends double-pushout graph transformation in the spirit of term rewriting: Graphs are provided with hierarchical...
RTA
2010
Springer
14 years 9 days ago
2010
Springer
Abstract. Declarative debugging is a semi-automatic technique that starts from an incorrect computation and locates a program fragment responsible for the error by building a tree ...
LICS
1999
IEEE
14 years 21 days ago
1999
IEEE
This paper extends the termination proof techniques based on reduction orderings to a higher-order setting, by adapting the recursive path ordering definition to terms of a typed ...