289 search results - page 9 / 58 » Program transformation by templates based on term rewriting |
AGTIVE
2007
Springer
14 years 1 months ago
2007
Springer
In this paper, we will define a custom term-graph reduction system for a simplified lazy functional language. Our custom system is geared towards flexibility, which is accomplis...
AGP
1997
IEEE
13 years 11 months 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 ...
HASKELL
2008
ACM
13 years 8 months ago
2008
ACM
Monads as an organizing principle for programming and semantics are notoriously difficult to grasp, yet they are a central and powerraction in Haskell. This paper introduces a do...
CAV
2012
Springer
11 years 9 months ago
2012
Springer
Abstract. In earlier work, we developed a technique to prove termination of Java programs automatically: first, Java programs are automatically transformed to term rewrite systems...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
c Modular Abstractions for Template Numerical Constraints David Monniaux May 26, 2010 We propose a method for automatically generating abstract transformstatic analysis by abstrac...