Logic Program Synthesis and Transformation: 5th International Workshop, LOPSTR'95, Utrecht, The Netherlands, September 20-22, 1995. Proceedings, Volume 5
Springer Science & Business Media, Mar 6, 1996 - Computers - 266 pages
This 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.
Preserving Characteristic Trees Without Constraints
Memoing Evaluation by SourcetoSource Transformation
the Reordering Problem
Derivation of Concurrent Algorithms in Tempo
An ArgumentationTheoretic Approach to Logic Program Transformation
Complexity of Horn Programs
Studying the Cost of Logic Languages in an Abstract Interpretation Framework for Granularity Analysis
Towards Automatic Control for CLPx Programs
Logic Program Synthesis by Induction over Horn Clauses
Logic Program Transformation through Generalization Schemata Extended Abstract
An Opportunistic Approach for Logic Program Analysis and Optimisation Using Enhanced SchemaBased Transformations
Solving Deductive Planning Problems Using Program Analysis and Transformation
Towards a Complete Proof Procedure to Prove Properties of Normal Logic Programs under the Completion
Termination of Logic Programs Using Semantic Unification
On the Mechanics of Metasystem Hierarchies in Program Transformation
Efficient Translation of Lazy Functional Logic Programs into Prolog
Other editions - View all
abstract interpretation algorithm analysis append applied argument argumentation framework Artificial Intelligence bottom-up rules characteristic atoms characteristic trees Comp(P complete Computer Science constraint constructive corresponding Datalog Datalog clauses defined definitional tree denotes dependency pairs derivation downward refinement efficient example execution exists extended finite framework function given goal Horn clauses implementation inductively infinite instantiated lazy narrowing left recursion left terminating Lemma literals logic pro magic sets member(a metacode metacomputation metaprogramming metasystem metasystem transition metavariables method node normal logic programming object-oriented programming obtained parameters partial deduction partial evaluation predicate problem procedure Prog program synthesis program transformation programming language Prolog Prolog programs proof search properties prove termination query recursive refinement operators relation replacement result rewrite system schema self-application semantics sequence sequent calculus sequent proof set of assumptions simplification specialised step strategy subgoals substitution symbols technique Tempo tuple unifiers variables