1882 search results - page 176 / 377 » Transformational Programming and Forests |
POPL
2010
ACM
14 years 10 months ago
2010
ACM
In this paper, we explore the potential of the theory of nested words for partial correctness proofs of recursive programs. Our conceptual contribution is a simple framework that ...
153
click to vote
POPL
2002
ACM
15 years 10 months ago
2002
ACM
Many classical compiler optimizations can be elegantly expressed using rewrite rules of form: I = I if , where I, I are intermediate language instructions and is a property expre...
ICFP
2004
ACM
15 years 10 months ago
2004
ACM
It is possible to extend the basic notion of "function call" to allow functions to have multiple return points. This turns out to be a surprisingly useful mechanism. Thi...
POPL
1999
ACM
15 years 2 months ago
1999
ACM
Superfluous variables are often produced as the byproducts of program transformations, compilation, and poorly written code. These variables are irrelevant to the computational o...
58
Voted
ALP
1990
Springer
15 years 2 months ago
1990
Springer
Conditional Equational Programming is an elegant way to uniformly integrate important features of functional and logic programming. Efficientmethods for equation solving are thus ...