Cantitate/Preț
Produs

Logic Program Synthesis and Transformation: 6th International Workshop, LOPSTR'96, Stockholm, Sweden, August 28-30, 1996, Proceedings: Lecture Notes in Computer Science, cartea 1207

Editat de John Gallagher
en Limba Engleză Paperback – 12 mar 1997
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.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 33515 lei

Preț vechi: 41894 lei
-20%

Puncte Express: 503

Preț estimativ în valută:
6421 6955$ 5506£

Carte tipărită la comandă

Livrare economică 06-11 mai

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540627180
ISBN-10: 3540627189
Pagini: 340
Ilustrații: IX, 331 p.
Dimensiuni: 155 x 235 x 18 mm
Greutate: 1.06 kg
Ediția:1997
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

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{R}$$ ).- 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.