Cantitate/Preț
Produs

Logic Program Synthesis and Transformation: 5th International Workshop, LOPSTR'95, Utrecht, The Netherlands, September 20-22, 1995. Proceedings: Lecture Notes in Computer Science, cartea 1048

Editat de Maurizio Proietti
en Limba Engleză Paperback – 6 mar 1996
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.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 33174 lei

Preț vechi: 41467 lei
-20% Nou

Puncte Express: 498

Preț estimativ în valută:
6349 6604$ 5321£

Carte tipărită la comandă

Livrare economică 14-28 martie

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540609391
ISBN-10: 3540609393
Pagini: 284
Ilustrații: X, 274 p.
Dimensiuni: 155 x 235 x 15 mm
Greutate: 0.4 kg
Ediția:1996
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

Ecological partial deduction: Preserving characteristic trees without constraints.- Memoing evaluation by source-to-source transformation.- Transformation of left terminating programs: The reordering problem.- Derivation of concurrent algorithms in Tempo.- An argumentation-theoretic 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 CLP(?) programs.- Ideal refinement of Datalog programs.- Guiding program development systems by a connection based proof strategy.- Towards an object-oriented methodology for deductive synthesis of logic 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 schema-based 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.