Thumbnail
Access Restriction
Open

Author Lämmel, Ralf
Source CiteSeerX
Content type Text
File Format PDF
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Logic Program ♦ Appropriate Set ♦ Suitable Level ♦ Definite Clause ♦ Slight Similarity ♦ Basic Data Type ♦ Complete Logic Program ♦ Novel Approach ♦ Applies Transformation ♦ Initial Logic Program ♦ Nested Expression
Abstract A novel approach to the representation of the design and the composition of logic programs is presented. Therefore, definite clauses and expressions describing transformations of logic programs are used as operands in a calculus for meta-programming. The transformations are intended to express aspects of the design of a complete logic program, for example the introduction of an accumulator. The clauses can be regarded as specializations of the design expressed by the transformations. The derivation of logic programs is defined in terms of reduction of a -calculus instrumented for meta-programming on DCPs and fragments due to an appropriate set of basic data types. A composition expressed as a nested expression can be automatically retrieved from some fragments due to a process called lifting (emphasizing a slight similarity to this notion in semantics). Lifting starts from an initial logic program and applies transformations while incorporating specializing clauses at suitable levels.
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research
Education Level UG and PG ♦ Career/Technical Study
Publisher Date 1997-01-01