default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID1st LOPSTR 1991: Manchester, UK
- Timothy Paul Clement, Kung-Kiu Lau:
Logic Program Synthesis and Transformation, Proceedings of LOPSTR 91, International Workshop on Logic Program Synthesis and Transformation, University of Manchester, UK, 4-5 July 1991. Workshops in Computing, Springer 1992, ISBN 3-540-19742-7 - Jonathan M. Lever:
Program Equivalence, Program Development and Integrity Checking. 1-12 - Pierangelo Miglioli, Ugo Moscato, Mario Ornaghi:
Program Specification and Synthesis in Constructive Formal Systems. 13-26 - Geraint A. Wiggins, Alan Bundy, Ina Kraan, Jane Hesketh:
Synthesis and Transfomation of Logic Programs from Constructive, Inductive Proof. 27-45 - Pierre Flener, Yves Deville:
Towards Stepwise, Schema-guided Synthesis of Logic Programms. 46-64 - Klaus P. Jantke
, Ulf Goldhammer:
Inductive Synthesis of Rewrite Rules as Program Synthesis (Extended Abstract). 65-68 - M. G. Read, E. A. Kazmierczak:
Formal Program Development in Modular Prolog: A Case Study. 69-93 - Lubos Popelínský:
Towards Synthesis of Nearly Pure Prolog Programs (Extende Abstract). 94-96 - Mattias Waldau:
Formal Validation of Transformation Schemata. 97-110 - Norbert E. Fuchs, Markus P. J. Fromherz:
Schema-Based Transfomations of Logic Programs. 111-125 - Maurizio Proietti, Alberto Pettorossi:
An Automatic Transfomation Strategy for Avoiding Unnecessary Variables in Logic Programs (Extended Abstract). 126-128 - Francis Alexandre, Khaled Bsaïes, Alain Quéré:
On Using Mode Input-output for Transforming Logic Programs. 129-146 - Christophe Lecoutre, Philippe Devienne, Patrick Lebègue:
Abstract Interpretation and Recursive Behaviour of Logic Programs. 147-166 - Jutta Eusterbrock:
Speed-up Transformations of Logic Programs by Abstraction and Learning. 167-182 - P. M. Mill:
Pruning Operators for Partial Evaluation. 183-204 - D. Andre de Waal, John P. Gallagher:
Specialisation of a Unification Algorithm. 205-220 - Brian J. Ross:
Semantics-based Partial Evaluation of Prolog Programs. 221-237 - Anne Parrain, Philippe Devienne, Patrick Lebègue:
Prolog Program Transformations and Meta-Interpreters. 238-251 - S. Schaeck:
Global Search Algorithms and the Constraint Logic Programming Framework (Extended Abstract). 252-253 - Matthew M. Huntbach:
Automated Translation of Occam to a Concurrent Logic Language. 254-275 - Philippe Noël:
A Method for the Determinisation of Propositional Temporal Formulae. 276-296 - Yamine Aït Ameur:
Program Transformations Directed by the Evaluation of non Functional Properties (Extended Abstract). 297-299 - Christine Solnon, Michel Rueher:
Using a Prolog Prototype for Designing an Object Oriented Scheme. 300-317 - Sergio Antoy:
Non-Determinism and Lazy Evaluation in Logic Programming. 318-331 - Zhuoan Jiao, Peter M. D. Gray:
Query Optimization in an Object-Oriented Database using Prolog (Extende Abstract). 332-333
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-27 21:31 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
