A polymorphic type system for PROLOG.
Artificial Intelligence
Detection and optimization of functional computations in Prolog
Proceedings on Third international conference on logic programming
Unification as a complexity measure for logic programming
Journal of Logic Programming
Automatic mode inference for logic programs
Journal of Logic Programming
Logic programming: systematic program development
Logic programming: systematic program development
Termination proofs for logic programs
Termination proofs for logic programs
A Transformation System for Developing Recursive Programs
Journal of the ACM (JACM)
Contributions to the Theory of Logic Programming
Journal of the ACM (JACM)
Software Engineering
Synthesis of Eureka Predicates for Developing Logic Programs
ESOP '90 Proceedings of the 3rd European Symposium on Programming
MFCS '80 Proceedings of the 9th Symposium on Mathematical Foundations of Computer Science
A technique for Transforming Logic Programs by Fold-Unfold Transformations
PLILP '92 Proceedings of the 4th International Symposium on Programming Language Implementation and Logic Programming
An Equivalence Preserving First Order Unfold/fold Transformation System
Proceedings of the Second International Conference on Algebraic and Logic Programming
Developing Logic Programs: Computing Through Normalizing
CSL '87 Proceedings of the 1st Workshop on Computer Science Logic
More thoughts on specification and verification
ACM SIGSOFT Software Engineering Notes
Structured programming
| Hi-index | 0.00 |
A methodology for constructing definite programs is presented. This presentation consists of two parts. The first part is the writing of an initial specification in Horn clauses form. In this part some paradigms of construction are outlined. The specification obtained is moded and typed; moreover it has some important specific qualities: structure, clearness, correctness and executability. However the initial specification is generally not efficient. For this reason the second part of the presentation is the stage of transformation. In this part some strategies based on folding, unfolding and generation of schemata are presented.