Logic program synthesis and transformation : 7th international workshop, LOPSTR '97, Leuven, Belgium, July 10-12, 1997 : proceedings
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....
محفوظ في:
| مؤلف مشترك: | |
|---|---|
| مؤلفون آخرون: | |
| التنسيق: | Livre numérique |
| اللغة: | Anglais |
| منشور في: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| سلاسل: | Lecture notes in computer science
1463 |
| الموضوعات: | |
| الوصول للمادة أونلاين: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| ملاحظة: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Logic program synthesis and transformation, 7th international workshop, LOPSTR '97, Leuven, Belgium, July 10-12, 1997, proceedings, Norbert E. Fuchs, 1998, Berlin, Springer, 1 vol. (X-342 p.), Lecture notes in computer science, 3-540-65074-1 • Logic Program Synthesis and Transformation, Texte imprimé, 9783662193297 |
جدول المحتويات:
- 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.