E-Books durchsuchen

Logic Program Synthesis and Transformation [1993]

1
Logic Program Synthesis via Proof Planning
15
Deductive Synthesis of Programs for Query Answering
30
Synthesis of Narrowing Programs
46
A Unifying View of Structural Induction and Computation Induction for Logic Programs
61
Proof Nets
80
The LOPS Approach: A Transformational Point of View
82
Best-first Strategies for Incremental Transformations of Logic Programs
99
Deriving Transformations of Logic Programs Using Abstract Interpretation
118
A Rationalisation of the ATMS in Terms of Partial Evaluation
132
Intensional Query Answering: An Application of Partial Evaluation
151
Deletion of Redundant Unary Type Predicates from Logic Programs
168
Automatic Termination Analysis
184
Applications of Unfolding in Prolog Programming
199
An Unfold Rule for Full Prolog
214
Logimix: A Self-Applicable Partial Evaluator for Prolog
228
Towards Optimization of Full Prolog Programs Guided by Abstract Interpretation
242
On the Transformation of a Prolog Program to a more efficient binary Program
253
Efficient Compilation of Lazy Narrowing into Prolog
Feedback