Logic Program Synthesis and Transformation: 5th International Workshop, LOPSTR'95, Utrecht, The Netherlands, September 20-22, 1995. Proceedings, Volume 5This book constitutes the refereed proceedings of the 5th International Workshop on Logic Program Synthesis and Transformation, LOPSTR'95, held in Utrecht, The Netherlands in September 1995. The 19 papers included were selected from 40 workshop submissions; they offer a unique up-to-date account of the use of formal synthesis and transformation techniques for computer-aided development of logic programs. Among the topics addressed are deductive and inductive program synthesis, synthesis models based on constructive type theory, program specification, program analysis, theorem proving, and applications to various types of programs. |
What people are saying - Write a review
We haven't found any reviews in the usual places.
Contents
Preserving Characteristic Trees Without Constraints | 1 |
Memoing Evaluation by SourcetoSource Transformation | 17 |
the Reordering Problem | 33 |
Derivation of Concurrent Algorithms in Tempo | 46 |
An ArgumentationTheoretic Approach to Logic Program Transformation | 61 |
Complexity of Horn Programs | 76 |
Studying the Cost of Logic Languages in an Abstract Interpretation Framework for Granularity Analysis | 91 |
Towards Automatic Control for CLPx Programs | 106 |
Logic Program Synthesis by Induction over Horn Clauses | 170 |
Logic Program Transformation through Generalization Schemata Extended Abstract | 171 |
An Opportunistic Approach for Logic Program Analysis and Optimisation Using Enhanced SchemaBased Transformations | 174 |
Solving Deductive Planning Problems Using Program Analysis and Transformation | 189 |
Towards a Complete Proof Procedure to Prove Properties of Normal Logic Programs under the Completion | 204 |
Termination of Logic Programs Using Semantic Unification | 219 |
On the Mechanics of Metasystem Hierarchies in Program Transformation | 234 |
Efficient Translation of Lazy Functional Logic Programs into Prolog | 252 |
Ideal Refinement of Datalog Programs | 120 |
Guiding Program Development Systems by a Connection Based Proof Strategy | 137 |
Towards an ObjectOriented Methodology for Deductive Synthesis of Logic Programs | 152 |
Other editions - View all
Logic Program Synthesis and Transformation: 5th International Workshop ... Maurizio Proietti No preview available - 2014 |
Common terms and phrases
abstract algorithm allows analysis applied approach approximation argument assume atoms body bottom-up called characteristic clause Comp(P complete computation consider consists constraint constructive contains correctness corresponding cost defined definition denotes dependency derivation described efficient equational evaluation example execution exists expression extended fact finite formula framework function given goal implementation inductively infinite instance interpreter introduced language literals logic programs means metacode method narrowing normal Note obtained occur operation parameters partial deduction path performed position possible predicate presented preserve problem procedure Prolog proof properties proposed prove query recursive refinement relation replacement represented respect result rewrite rules schema semantics sequence solution specialization specification standard step structure substitution symbols technique termination theorem theory transformation tree true unfolding University valid variables