Schema-Based Top-Down Design of Logic Programs Using Abstract Data Types

This paper presents a set of schemata that support stepwise top-down design of logic programs using abstract data types (ADTs). There are thus three main components to this approach: top-down design, program schemata and ADTs, all of which are already well established notions. Our aim is to combine these ideas in a framework, amenable to support by design tools and allowing the use of existing logic program transformation techniques to optimise the final programs.

[1]  Arun Lakhotia,et al.  A workbench for developing logic programs by stepwise enhancement , 1990 .

[2]  Niklaus Wirth,et al.  Algorithms + Data Structures = Programs , 1976 .

[3]  Niklaus Wirth,et al.  Algorithms and Data Structures , 1989, Lecture Notes in Computer Science.

[4]  Roland Dietrich,et al.  A Polymorphic Type System with Subtypes for Prolog , 1988, ESOP.

[5]  Jeffrey H. Kingston Algorithms and data structures - design, correctness, analysis , 1990, International computer science series.

[6]  Alan Mycroft,et al.  A Polymorphic Type System for Prolog , 1984, Logic Programming Workshop.

[7]  Yves Deville,et al.  Towards Stepwise, Schema-guided Synthesis of Logic Programms , 1991, LOPSTR.

[8]  Maurice Bruynooghe Adding Redundancy to Obtain more Reliable and Readable Prolog Programs , 1982, ICLP.

[9]  Alan W. Biermann,et al.  Induction of schemata for program synthesis , 1990 .

[10]  Yves Deville,et al.  Logic programming - systematic program development , 1990, International series in logic programming.

[11]  Rodney W. Topor,et al.  A Semantics for Typed Logic Programs , 1992, Types in Logic Programming.

[12]  David Stuart Robertson,et al.  A Simple Prolog Techniques Editor for Novice Users , 1991, ALPUK.

[13]  Jan Komorowski,et al.  Towards a Programming Methodology Founded on Partial Deduction , 1990, ECAI.

[14]  Saumya K. Debray,et al.  Automatic Mode Inference for Prolog Programs , 1986, SLP.

[15]  Douglas R. Smith,et al.  Top-Down Synthesis of Divide-and-Conquer Algorithms , 1985, Artif. Intell..

[16]  S T Gegg-Harrison Basic Prolog Schemata , 1989 .

[17]  Chris Mellish,et al.  Some Global Optimizations for a Prolog Compiler , 1985, J. Log. Program..

[18]  Yves Deville,et al.  Generalization and Program Schemata: A Step Towards Computer-Aided Construction of Logic Programs , 1989, NACLP.