74 search results - page 9 / 15 » Program Transformation with Scoped Dynamic Rewrite Rules |
AGP
1997
IEEE
14 years 4 days ago
1997
IEEE
Abstract. Functional logic languages with a complete operational semantics are based on narrowing, a generalization of term rewriting where unification replaces matching. In this ...
CADE
2004
Springer
14 years 8 months ago
2004
Springer
Formal semantic definitions of concurrent languages, when specified in a well-suited semantic framework and supported by generic and efficient formal tools, can be the basis of pow...
POPL
1995
ACM
13 years 11 months ago
1995
ACM
Program slicing is a technique for isolating computational threads in programs. In this paper, we show how to mechanically extract a family of practical algorithms for computing s...
ICCL
1998
IEEE
14 years 5 days ago
1998
IEEE
The monadic style of language speci cation has the advantages of modularity and extensibility: it is simple to add or change features in an interpreter to re ect modi cations in t...
PEPM
2004
ACM
14 years 1 months ago
2004
ACM
Advanced typing, matching, and evaluation strategy features, as well as very general conditional rules, are routinely used in equational programming languages such as, for example...