74 search results - page 12 / 15 » Extending Context-Sensitivity in Term Rewriting |
JLP
2010
13 years 3 months ago
2010
K is an executable semantic framework in which programming languages, calculi, as well as type systems or formal analysis tools can be defined making use of configurations, comput...
IDEAS
2009
IEEE
14 years 3 months ago
2009
IEEE
This paper is concerned with a transformation-based approach to update propagation in an extended version of Codd’s relational algebra which allows for defining derived relatio...
ACMSE
2005
ACM
14 years 1 months ago
2005
ACM
A simple extension to the relational model that permits metadata (more generally metaknowledge) to be stored and manipulated as first class data is proposed. The accompanying que...
JAR
2006
13 years 8 months ago
2006
The dependency pair technique [1, 11, 12] is a powerful method for automated termination and innermost termination proofs of term rewrite systems (TRSs). For any TRS, it generates ...
CONCUR
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. An impure language is one that combines functional and imperative constructs. We propose a method for ensuring termination of impure concurrent languages that makes it po...