Results 1 -
4 of
4
Sharing of Computations
, 1993
"... This report is a revised version of my thesis of the same title, which was accepted for the Ph.D. degree in Computer Science at University of Aarhus, Denmark, in June 1993 ..."
Abstract
-
Cited by 14 (3 self)
- Add to MetaCart
This report is a revised version of my thesis of the same title, which was accepted for the Ph.D. degree in Computer Science at University of Aarhus, Denmark, in June 1993
Automatic Bottom-Up Analysis and Transformation of Logic Programs
- In LNAI
, 1996
"... . The comparatively small size and clean declarative semantics of logic programs hide performance issues that must be accounted for if the programs are to be executed using the currently available technology. Proposals have been made to tackle these computational issues by analysing a program an ..."
Abstract
-
Cited by 3 (3 self)
- Add to MetaCart
. The comparatively small size and clean declarative semantics of logic programs hide performance issues that must be accounted for if the programs are to be executed using the currently available technology. Proposals have been made to tackle these computational issues by analysing a program and trying to optimise its code. We introduce a bottom-up method for analysing logic programs. The method incrementally builds self-contained subtheories of the initial program, starting from facts and then picking up more complex clauses that depend on simpler, previously analysed constructs. A transformation system is then applied to these subtheories yielding more efficient subprograms. Eventually a subtheory that encompasses the full initial program is obtained. Keywords: Logic programming, automatic program transformation. 1 Introduction The comparatively small size and clean declarative semantics of logic programs hide performance issues that must be accounted for if the program...
Combining Prolog Programs in a Techniques Editing System
"... Techniques editing, as proposed by Sterling et al., allows Prolog programs to be constructed by initially selecting a `skeleton' which determines the flow of control of the program, and then adding on top of this the extra features required by the program. This means that it is easy to obtain as an ..."
Abstract
-
Cited by 3 (1 self)
- Add to MetaCart
Techniques editing, as proposed by Sterling et al., allows Prolog programs to be constructed by initially selecting a `skeleton' which determines the flow of control of the program, and then adding on top of this the extra features required by the program. This means that it is easy to obtain as an end-result of techniques editing not only the final program but also a history of its development, in terms of the skeleton and extensions used to build it. We describe how this program history information can be used to produce efficient combined programs from pairs of initial programs constructed independently by a techniques editor. Keywords: techniques editor, classification of Prolog programs, join specification, composition methods, unfold/fold transformations, meta-folding operation, program history. 1 Introduction This paper addresses the combination of two programs constructed by means of a specialised techniques editor, briefly described in Section 2. Currently the techniques edit...
An Environment for Building Prolog Programs Based on Knowledge about their Construction
"... this paper. References ..."

