Logic Program Synthesis and Transformation 6th International Workshop, LOPSTR'96, Stockholm, Sweden, August 28-30, 1996, Proceedings /
Logic Program Synthesis and Transformation 6th International Workshop, LOPSTR'96, Stockholm, Sweden, August 28-30, 1996, Proceedings / [electronic resource] :
edited by John Gallagher.
- 1st ed. 1997.
- IX, 331 p. online resource.
- Lecture Notes in Computer Science, 1207 1611-3349 ; .
- Lecture Notes in Computer Science, 1207 .
Refining specifications to logic programs -- Symbolic verification with gap-order constraints -- Specification-based automatic verification of Prolog programs -- Logic program specialisation: 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 -- Enhancing partial deduction via unfold/fold rules -- Abstract specialization and its application to program parallelization -- Reductions of petri nets and unfolding of propositional logic programs -- Inferring argument size relationships with CLP( $$\mathcal$$ ) -- Typed norms for typed logic programs -- Partial deduction in the framework of structural synthesis of programs -- Extensible logic program schemata -- Specialising meta-level compositions of logic programs -- Forms of logic specifications: A preliminary study -- Synthesis of proof procedures for default reasoning.
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.
9783540684947
10.1007/3-540-62718-9 doi
Computer science.
Compilers (Computer programs).
Computer programming.
Artificial intelligence.
Machine theory.
Theory of Computation.
Compilers and Interpreters.
Programming Techniques.
Artificial Intelligence.
Formal Languages and Automata Theory.
Computer Science Logic and Foundations of Programming.
QA75.5-76.95
004.0151
Refining specifications to logic programs -- Symbolic verification with gap-order constraints -- Specification-based automatic verification of Prolog programs -- Logic program specialisation: 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 -- Enhancing partial deduction via unfold/fold rules -- Abstract specialization and its application to program parallelization -- Reductions of petri nets and unfolding of propositional logic programs -- Inferring argument size relationships with CLP( $$\mathcal$$ ) -- Typed norms for typed logic programs -- Partial deduction in the framework of structural synthesis of programs -- Extensible logic program schemata -- Specialising meta-level compositions of logic programs -- Forms of logic specifications: A preliminary study -- Synthesis of proof procedures for default reasoning.
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.
9783540684947
10.1007/3-540-62718-9 doi
Computer science.
Compilers (Computer programs).
Computer programming.
Artificial intelligence.
Machine theory.
Theory of Computation.
Compilers and Interpreters.
Programming Techniques.
Artificial Intelligence.
Formal Languages and Automata Theory.
Computer Science Logic and Foundations of Programming.
QA75.5-76.95
004.0151