2000 search results - page 102 / 400 » Program Transformation and Proof Transformation |
130
click to vote
ALP
1994
Springer
15 years 7 months ago
1994
Springer
This paper studies the relationship between logic programs and term rewriting systems (TRSs). A compositional transform is de ned which given a logic program computes a TRS. For a...
90
Voted
EUROPAR
2003
Springer
15 years 8 months ago
2003
Springer
Abstract. Trees are useful data structures, but to design efficient parallel programs over trees is known to be more difficult than to do over lists. Although several important tre...
129
click to vote
ICFP
1998
ACM
15 years 7 months ago
1998
ACM
If the continuations in functional data-structure-generating programs are made explicit and represented as records, they can be recycled." Once they have served their purpose...
231
Voted
FROCOS
2011
Springer
14 years 3 months ago
2011
Springer
Abstract. Isabelle/HOL is a popular interactive theorem prover based on higherorder logic. It owes its success to its ease of use and powerful automation. Much of the automation is...
114
Voted
IPPS
2007
IEEE
15 years 9 months ago
2007
IEEE
This paper presents a new approach for the execution of coarse-grain (tiled) parallel SPMD code for applications derived from the explicit discretization of 2-dimensional PDE prob...