Sciweavers

2000 search results - page 191 / 400
» Program Transformation and Proof Transformation
Sort
View
HASKELL
2008
ACM
15 years 4 months ago
Making monads first-class with template haskell
Monads as an organizing principle for programming and semantics are notoriously difficult to grasp, yet they are a central and powerraction in Haskell. This paper introduces a do...
Pericles S. Kariotis, Adam M. Procter, William L. ...
ICFP
2008
ACM
16 years 3 months ago
Compiling self-adjusting programs with continuations
Self-adjusting programs respond automatically and efficiently to input changes by tracking the dynamic data dependences of the computation and incrementally updating the output as...
Ruy Ley-Wild, Matthew Fluet, Umut A. Acar
LPNMR
2001
Springer
15 years 8 months ago
plp: A Generic Compiler for Ordered Logic Programs
Abstract This paper describes a generic compiler, called plp, for translating ordered logic programs into standard logic programs under the answer set semantics. In an ordered logi...
James P. Delgrande, Torsten Schaub, Hans Tompits
JUCS
2006
135views more  JUCS 2006»
15 years 3 months ago
Operational/Interpretive Unfolding of Multi-adjoint Logic Programs
Abstract: Multi-adjoint logic programming represents a very recent, extremely flexible attempt for introducing fuzzy logic into logic programming. In this setting, the execution of...
Pascual Julián, Ginés Moreno, Jaime ...
PASTE
1999
ACM
15 years 8 months ago
Identifying Procedural Structure in Cobol Programs
The principal control-flow abstraction mechanism in the Cobol language is the PERFORM statement. Normally, PERFORM statements are used in a straightforward manner to define para...
John Field, G. Ramalingam