378 search results - page 9 / 76 » Automating Mathematical Program Transformations |
LOPSTR
1994
Springer
15 years 1 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...
67
Voted
ASP
2001
Springer
15 years 2 months ago
2001
Springer
We define a reduction system Ë¿ which preserves the stable semantics. This system includes two types of transformation rules. One type (which we call ˾) preserves the stable...
ESOP
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. During the last two decades, monads have become an indispensable tool for structuring functional programs with computational effects. In this setting, the mathematical n...
MPC
2010
Springer
15 years 2 months ago
2010
Springer
Parser combinators are a popular tool for designing parsers in functional programming languages. If such combinators generate an abstract representation of the grammar as an interm...
LOPSTR
2001
Springer
15 years 1 months ago
2001
Springer
In this paper we define a sequent calculus to formally specify, simulate, debug and verify security protocols. In our sequents we distinguish between the current knowledge of prin...