Sciweavers

3481 search results - page 289 / 697
» Higher-Order Logic Programming as Constraint Logic Programmi...
Sort
View
NMELP
1994
15 years 8 months 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
VLDB
1991
ACM
128views Database» more  VLDB 1991»
15 years 8 months ago
A Functional Programming Approach to Deductive Databases
We introduce a persistentfunctional languagecalled PFL which adapts functional programming to the area of deductive databases,much as logic-based deductive databaselanguagesadapt ...
Alexandra Poulovassilis, Carol Small
AO
2007
80views more  AO 2007»
15 years 4 months ago
Problems in the ontology of computer programs
As a first step in the larger project of charting the ontology of computer programs, we pose three central questions: (1) Can programs, hardware, and metaprograms be organized into...
Amnon H. Eden, Raymond Turner
ICCS
2009
Springer
15 years 11 months ago
Modular, Fine-Grained Adaptation of Parallel Programs
We present a modular approach to realizing fine-grained adaptation of program behavior in a parallel environment. Using a compositional framework based on function call intercepti...
Pilsung Kang 0002, Naresh K. C. Selvarasu, Naren R...
POPL
2007
ACM
16 years 4 months ago
Logic-flow analysis of higher-order programs
This work presents a framework for fusing flow analysis and theorem proving called logic-flow analysis (LFA). The framework itthe reduced product of two abstract interpretations: ...
Matthew Might