Sciweavers

378 search results - page 19 / 76
» Higher-order transformation of logic programs
Sort
View
PPDP
2009
Springer
14 years 3 months ago
Relational semantics for effect-based program transformations: higher-order store
We give a denotational semantics to a type and effect system tracking reading and writing to global variables holding values that may include higher-order effectful functions. Reļ...
Nick Benton, Andrew Kennedy, Lennart Beringer, Mar...
NMELP
1994
14 years 16 days ago
Static Semantics as Program Transformation and Well-founded Computation
In this paper, we propose a new constructive characterization of those semantics for disjunctive logic programs which are extensions of the well-founded semantics for normal progra...
Stefania Costantini, Gaetano Aurelio Lanzarone
CLIMA
2007
13 years 10 months ago
EVOLP: Tranformation-Based Semantics
Over the years, Logic Programming has proved to be a good and natural tool for expressing, querying and manipulating explicit knowledge in many areas of computer science. However, ...
Martin Slota, João Leite
CORR
2010
Springer
140views Education» more  CORR 2010»
13 years 8 months ago
Automated Termination Analysis for Logic Programs with Cut
Termination is an important and well-studied property for logic programs. However, almost all approaches for automated termination analysis focus on definite logic programs, where...
Peter Schneider-Kamp, Jürgen Giesl, Thomas St...
LOPSTR
2007
Springer
14 years 2 months ago
Denotation by Transformation
Abstract. It has often been observed that a point-free style of programvides a more abstract view on programs. We aim to use the gain in abstraction to obtain a denotational semant...
Bernd Braßel, Jan Christiansen