Cantitate/Preț
Produs

Logic Program Synthesis and Transformation: 7th International Workshop, LOPSTR ’97, Leuven, Belgium, July 10–12, 1997 Proceedings: Lecture Notes in Computer Science, cartea 1463

Editat de Norbert E. Fuchs
en Limba Engleză Paperback – 9 sep 1998
This volume contains the papers from the Seventh International Workshop on Logic Program Synthesis and Transformation, LOPSTR '97, that took place in Leuven, Belgium, on July 10–12, 1997, 'back to back' with the Fourteenth International Conference on Logic Programming, ICLP '97. Both ICLP and LOPSTR were organised by the K.U. Leuven Department of Computer Science. LOPSTR '97 was sponsored by Compulog Net and by the Flanders Research Network on Declarative Methods in Computer Science. LOPSTR '97 had 39 participants from 13 countries. There were two invited talks by Wolfgang Bibel (Darmstadt) on 'A multi level approach to program synthesis', and by Henning Christiansen (Roskilde) on 'Implicit program synthesis by a reversible metainterpreter'. Extended versions of both talks appear in this volume. There were 19 technical papers accepted for presentation at LOPSTR '97, out of 33 submissions. Of these, 15 appear in extended versions in this volume. Their topics range over the fields of program synthesis, program transformation, program analysis, tabling, metaprogramming, and inductive logic programming.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 32258 lei

Preț vechi: 40323 lei
-20% Nou

Puncte Express: 484

Preț estimativ în valută:
6174 6513$ 5145£

Carte tipărită la comandă

Livrare economică 02-16 ianuarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540650744
ISBN-10: 3540650741
Pagini: 352
Ilustrații: X, 343 p. 11 illus., 2 illus. in color.
Dimensiuni: 155 x 235 x 18 mm
Greutate: 0.49 kg
Ediția:1998
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

A Multi-level Approach to Program Synthesis.- Programs Without Failures.- Generalised Logic Program Transformation Schemas.- Logic Program Schemas, Constraints, and Semi-unification.- Implicit Program Synthesis by a Reversible Metainterpreter.- Termination Analysis for Tabled Logic Programming.- On Correct Program Schemas.- Analysis of Logic Programs with Delay.- Constraint-Based Partial Evaluation of Rewriting-Based Functional Logic Programs.- Preserving Termination of Tabled Logic Programs While Unfolding (Extended Abstract).- Unfolding the Mystery of Mergesort.- Towards a Logic for Reasoning About Logic Programs Transformation.- A Higher Order Reconstruction of Stepwise Enhancement.- Development of Correct Transformation Schemata for Prolog Programs.- Constrained Regular Approximation of Logic Programs.- A Logic Framework for the Incremental Inductive Synthesis of Datalog Theories.- To Parse or Not To Parse.