Program development in computational logic : a decade of research advances in logic-based program development
1 The tenth anniversary of the LOPSTR symposium provided the incentive for this volume. LOPSTR started in 1991 as a workshop on logic program synthesis and transformation, but later it broadened its scope to logic-based program development in general, that is, program development in computational lo...
Uloženo v:
| Hlavní autor: | |
|---|---|
| Další autoři: | |
| Médium: | Livre numérique |
| Jazyk: | Anglais |
| Vydáno: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Edice: | Lecture notes in computer science
3049 |
| Témata: | |
| On-line přístup: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Poznámka: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Program development in computational logic, a decade of research advances in logic-based program development, Maurice Bruynooghe, Kung-Kiu Lau (eds.), Berlin, Springer, 2004, 1 vol. (VIII-538 p.), Lecture notes in computer science, 3-540-22152-2 • Program Development in Computational Logic, Texte imprimé, 9783662164877 |
Obsah:
- Specification and Synthesis
- Specifying Compositional Units for Correct Program Development in Computational Logic
- Synthesis of Programs in Computational Logic
- Developing Logic Programs from Specifications Using Stepwise Refinement
- Semantics
- Declarative Semantics of Input Consuming Logic Programs
- On the Semantics of Logic Program Composition
- Analysis
- Analysing Logic Programs by Reasoning Backwards
- Binding-Time Analysis for Mercury
- A Generic Framework for Context-Sensitive Analysis of Modular Programs
- Transformation and Specialisation
- Unfold/Fold Transformations for Automated Verification of Parameterized Concurrent Systems
- Transformation Rules for Locally Stratified Constraint Logic Programs
- Specialising Interpreters Using Offline Partial Deduction
- Termination
- Characterisations of Termination in Logic Programming
- On the Inference of Natural Level Mappings
- Proving Termination for Logic Programs by the Query-Mapping Pairs Approach
- Systems
- Herbrand Constraints in HAL.