668 search results - page 14 / 134 » Operational semantics for multi-language programs |
125
Voted
CEC
2009
IEEE
15 years 9 months ago
2009
IEEE
—Using semantic analysis, we present a technique known as semantically driven mutation which can explicitly detect and apply behavioural changes caused by the syntactic changes i...
126
click to vote
LOPSTR
1994
Springer
15 years 6 months ago
1994
Springer
The unfold/fold transformation system defined by Tamaki and Sato was meant for definite programs. It transforms a program into an equivalent one in the sense of both the least tter...
116
click to vote
CORR
2010
Springer
14 years 11 months ago
2010
Springer
The paper presents a simple and concise proof of correctness of the magic transformation. We believe it may provide a useful example of formal reasoning about logic programs. The ...
111
click to vote
ICFP
2006
ACM
16 years 2 months ago
2006
ACM
Monads are widely used in Haskell for modeling computational effects, but defining monads remains a daunting challenge. Since every part of a monad's definition depends on it...
123
click to vote
META
1992
15 years 6 months ago
1992
The replacement transformation operation, already defined in [28], is studied wrt normal programs. We give applicability conditions able to ensure the correctness of the operation ...