2000 search results - page 203 / 400 » Program Transformation and Proof Transformation |
216
click to vote
POPL
2002
ACM
16 years 4 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...
126
click to vote
ICFP
2004
ACM
16 years 4 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...
129
click to vote
POPL
1999
ACM
15 years 8 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...
105
click to vote
ALP
1990
Springer
15 years 8 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 ...
138
click to vote
ECAI
2010
Springer
15 years 5 months ago
2010
Springer
Nested Monte-Carlo search is a general algorithm that gives good results in single player games. Genetic Programming evaluates and combines trees to discover expressions that maxim...