Sciweavers

2000 search results - page 143 / 400
» Program Transformation and Proof Transformation
Sort
View
144
Voted
LANMR
2007
15 years 5 months ago
Equivalence for the G3'-stable models semantics
Abstract We study the notion of strong equivalence between two disjunctive logic programs under the G3-stable model semantics, also called the P-stable semantics, and we show how s...
José Luis Carballido, José Arrazola,...
138
Voted
FUIN
2006
85views more  FUIN 2006»
15 years 3 months ago
Higher Order Deforestation
Wadler's deforestation algorithm eliminates intermediate data structures from functional programs. To be suitable for inclusion in a compiler, it must terminate on all progra...
Geoff W. Hamilton
158
Voted
AI
2011
Springer
14 years 10 months ago
Stable models and circumscription
The concept of a stable model provided a declarative semantics for Prolog programs with negation as failure and became a starting point for the development of answer set programmi...
Paolo Ferraris, Joohyung Lee, Vladimir Lifschitz
ATVA
2005
Springer
130views Hardware» more  ATVA 2005»
15 years 9 months ago
Approximate Reachability for Dead Code Elimination in Esterel
Esterel is an imperative synchronous programming language for the design of reactive systems. Esterel extends Esterel with a noninstantaneous jump instruction (compatible with conc...
Olivier Tardieu, Stephen A. Edwards
139
Voted
FPCA
1995
15 years 7 months ago
The Functional Side of Logic Programming
In this paper we study the relationships between logic programming and functional programming, trying to answer the following basic question: to what extent is logic programming j...
Massimo Marchiori