2000 search results - page 183 / 400 » Program Transformation and Proof Transformation |
137
Voted
PPDP
2004
Springer
15 years 9 months ago
2004
Springer
We introduce the theoretical basis for tracing lazy functional logic computations in a declarative multi-paradigm language like Curry. Tracing computations is a difficult task due...
143
click to vote
PLILP
1998
Springer
15 years 8 months ago
1998
Springer
Abstract. We address the problem of term normalisation modulo associativecommutative (AC) theories, and describe several techniques for compiling many-to-one AC matching and reduce...
111
click to vote
ICCAD
1995
IEEE
15 years 7 months ago
1995
IEEE
With an ever-increasing portion of the delay in highspeed CMOS chips attributable to the interconnect, interconnect-circuit design automation continues to grow in importance. By t...
117
click to vote
IASTEDSEA
2004
15 years 5 months ago
2004
Today's software faces escalating technical and business difficulties, yet it continues to be coded in static, inflexible structures that are not prepared for automation and ...
119
click to vote
INFSOF
1998
15 years 3 months ago
1998
Changing the internal structure of a program without changing its behavior is called restructuring. This paper presents a transformation called tuck for restructuring programs by ...