LOPSTR C

19 papers

YearTitle / Authors
1993Logic Program Synthesis and Transformation, Proceedings of LOPSTR 92, International Workshop on Logic Program Synthesis and Transformation, University of Manchester, UK, 2-3 July 1992
Kung-Kiu Lau, Tim Clement
1992A Rationalisation of the ATMS in Terms of Partial Evaluation.
Evelina Lamma, Paola Mello
1992A Unifying View of Structural Induction and Computation Induction for Logic Programs.
Laurent Fribourg, Hans Olsén
1992An Unfold Rule for Full Prolog.
Steven D. Prestwich
1992Applications of Unfolding in Prolog Programming.
John Jones
1992Automatic Termination Analysis.
Kristof Verschaetse, Stefaan Decorte, Danny De Schreye
1992Best-first Strategies for Incremental Transformations of Logic Programs.
Maurizio Proietti, Alberto Pettorossi
1992Deductive Synthesis of Programs for Query Answering.
Daniele Nardi, Riccardo Rosati
1992Deletion of Redundant Unary Type Predicates from Logic Programs.
John P. Gallagher, D. Andre de Waal
1992Deriving Transformations for Logic Programs Using Abstract Interpretation.
Dmitri Boulanger, Maurice Bruynooghe
1992Efficient Compilation of Lazy Narrowing into Prolog.
José André Jimènez-Martin, Julio Mariño-Carballo, Juan José Moreno-Navarro
1992Intensional Query Answering: An Application of Partial Evaluation.
Giuseppe De Giacomo
1992Logic Program Synthesis via Proof Planning.
Ina Kraan, David A. Basin, Alan Bundy
1992Logimix: A Self-Applicable Partial Evaluator for Prolog.
Torben Æ. Mogensen, Anders Bondorf
1992On the Transformation of a Prolog Program to a More Efficient Binary Program.
Bart Demoen
1992Proof Nets.
Mario Ornaghi
1992Synthesis of Narrowing Programs.
Carlos Loría-Sáenz
1992The LOPS Approach: A Transformational Point of View (Extended Abstract).
Gerd Neugebauer
1992Towards Optimization of Full Prolog Programs Guided by Abstract Interpretation.
Anne Parrain, Philippe Devienne, Patrick Lebègue