6. LOPSTR 1996:
Stockholm,
Sweden
John P. Gallagher (Ed.):
Logic Programming Synthesis and Transformation, 6th International Workshop, LOPSTR'96, Stockholm, Sweden, August 28-30, 1996, Proceedings.
Lecture Notes in Computer Science 1207 Springer 1997, ISBN 3-540-62718-9 BibTeX
@proceedings{DBLP:conf/lopstr/1996,
editor = {John P. Gallagher},
title = {Logic Programming Synthesis and Transformation, 6th International
Workshop, LOPSTR'96, Stockholm, Sweden, August 28-30, 1996, Proceedings},
booktitle = {LOPSTR},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {1207},
year = {1997},
isbn = {3-540-62718-9},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
- Ian J. Hayes, R. G. Nickson, Paul A. Strooper:
Refining Specifications to Logic Programs.
1-19 BibTeX
- Laurent Fribourg, Julian Richardson:
Symbolic Verification with Gap-Order Constraints.
20-37 BibTeX
- Agostino Cortesi, Baudouin Le Charlier, Sabina Rossi:
Specification-Based Automatic Verification of Prolog Programs.
38-57 BibTeX
- Michael Leuschel, Danny De Schreye:
Logic Program Specialisation: How to Be More Specific (Abstract).
58 BibTeX
,
full paper:
PLILP 1996: 137-151 BibTeX
- Jesper Jørgensen, Michael Leuschel, Bern Martens:
Conjunctive Partial Deduction in Practice.
59-82 BibTeX
- Michael Leuschel, Morten Heine Sørensen:
Redundant Argument Filtering of Logic Programs.
83-103 BibTeX
- Annalisa Bossi, Nicoletta Cocco:
Replacement Can Preserve Termination.
104-129 BibTeX
- Jacob Brunekreef:
A Transformation Tool for Pure Prolog Programs.
130-145 BibTeX
- Alberto Pettorossi, Maurizio Proietti, Sophie Renault:
Enhancing Partial Deduction via Unfold/Fold Rules.
146-168 BibTeX
- Germán Puebla, Manuel V. Hermenegildo:
Abstract Specialization and Its Application to Program Parallelization.
169-186 BibTeX
- Laurent Fribourg, Hans Olsén:
Reductions of Petri Nets and Unfolding of Propositional Logic Programs.
187-203 BibTeX
- Florence Benoy, Andy King:
Inferring Argument Size Relationships with CLP(R).
204-223 BibTeX
- Jonathan C. Martin, Andy King, Paul Soper:
Typed Norms for Typed Logic Programs.
224-238 BibTeX
- Mihhail Matskin, Henryk Jan Komorowski, John Krogstie:
Partial Deduction in the Framework of Structural Synthesis of Programs.
239-255 BibTeX
- Timothy S. Gegg-Harrison:
Extensible Logic Program Schemata.
256-274 BibTeX
- Antonio Brogi, Simone Contiero:
Specialising Meta-level Compositions of Logic Programs.
275-294 BibTeX
- Kung-Kiu Lau, Mario Ornaghi:
Forms of Logic Specifications: A Preliminary Study.
295-312 BibTeX
- Phan Minh Dung, Robert A. Kowalski, Francesca Toni:
Synthesis of Proof Procedures for Default Reasoning.
313-324 BibTeX
Copyright © Sat May 16 23:28:57 2009
by Michael Ley (ley@uni-trier.de)