Logic Program Synthesis and Transformation: 6th International Workshop, LOPSTR'96, Stockholm, Sweden, August 28-30, 1996, Proceedings, Volume 6
Sweden) International Workshop on Logic Program Synthesis and Transformation (6th : 1996 : Stockholm
Springer Science & Business Media, Mar 12, 1997 - Computers - 324 pages
This book constitutes the strictly refereed post-workshop proceedings of the Sixth International Workshop on Logic Program Synthesis and Transformation, LOPSTR'96, held on board a ship sailing from Stockholm to Helsinki, in August 1996.
The 17 revised full papers were carefully selected from a total of initially 27 submissions. The topics covered range over the areas of synthesis of programs from specifications, verification, transformation, specialization, and analysis of programs, and the use of program schemata in program development.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Refining Specifications to Logic Programs
Symbolic Verification with GapOrder Constraints
SpecificationBased Automatic Verification of Prolog Programs
How to Be More Specific
Conjunctive Partial Deduction in Practice
Redundant Argument Filtering of Logic Programs
Replacement Can Preserve Termination
A Transformation Tool for Pure Prolog Programs
Reductions of Petri Nets and Unfolding of Prepositional Logic Programs
Inferring Argument Size Relationships with
Typed Norms for Typed Logic Programs
Partial Deduction in the Framework of Structural Synthesis of Programs
Extensible Logic Program Schemata
Specialising Metalevel Compositions of Logic Programs
A Preliminary Study
Synthesis of Proof Procedures for Default Reasoning
Enhancing Partial Deduction via UnfoldFold Rules
Abstract Specialization and Its Application to Program Parallelization
Other editions - View all
Logic Program Synthesis and Transformation: 6th International Workshop ...
No preview available - 1997
abstract algorithm allows analysis applied approach argument atoms body clause complete Computer conjunctive consider constraints construct contains correct corresponding defined definition denoted derivation domain editor efficient equivalent example execution expression extended fails finite folding framework function given goal head implementation initial input instance interpretation introduce invariant Italy iteration language length List literal logic programs means method norm Note object obtained occurring operation partial deduction partial evaluation performed possible predicate presented problem procedure Proceedings produce Prolog proof prove query recursive refinement relation replacement represented respect Result rule safe satisfied Science selected semantics sequence specialisation specialization specification standard statements step strategy substitution symbols synthesis techniques termination transformation transitions unfolding University values variables widening