2000 search results - page 214 / 400 » Program Transformation and Proof Transformation |
165
click to vote
CC
2009
Springer
15 years 1 months ago
2009
Springer
We present the architecture of the Rosser toolkit that allows optimisations to be specified in a domain specific language, then compiled and deployed towards optimising object prog...
136
click to vote
ENTCS
2010
14 years 11 months ago
2010
This is a study of a technique for deriving the session type of a program written in a statically typed imperative language from its control flow. We impose on our unlabelled sess...
153
click to vote
GECCO
2009
Springer
15 years 10 months ago
2009
Springer
We describe a methodology for evolving Java bytecode, enabling the evolution of extant, unrestricted Java programs, or programs in other languages that compile to Java bytecode. B...
134
click to vote
ICFP
2005
ACM
15 years 9 months ago
2005
ACM
Narrowing-driven partial evaluation is a powerful technique for the specialization of (first-order) functional and functional logic programs. However, although it gives good resu...
146
click to vote
RR
2010
Springer
15 years 2 months ago
2010
Springer
Defeasible reasoning has been studied extensively in the last two decades and many different and dissimilar approaches are currently on the table. This multitude of ideas has made...