We give a proof-theoretic analysis of logicprograms transformations, viewed as operations on proof trees in the sense of [3,4,9,10]. We present a logic for reasoning about (equivalence preserving) transformations of ...
详细信息
the aim of this work is to describe a procedure for the partial evaluation of functional logicprograms in rewriting-based languages using constraint-based information propagation. the constraint-based partial evaluat...
详细信息
this paper is concerned withthe problem of removing redundant arguments from logicprograms. Such arguments can be removed without affecting correctness, in a certain sense. Most program specialisation techniques, ev...
详细信息
ISBN:
(纸本)3540627189
this paper is concerned withthe problem of removing redundant arguments from logicprograms. Such arguments can be removed without affecting correctness, in a certain sense. Most program specialisation techniques, even though they filter arguments and remove clauses, fail to remove a substantial number of redundant arguments, yielding in some cases rather inefficient residual programs. We formalise the notion of a redundant argument and show that one cannot effectively remove all redundant arguments. We then give a safe, effective approximation of the notion of a redundant argument and describe several simple and efficient algorithms based on the approximative notion. We conduct extensive experiments with our algorithms on mechanically generated programs illustrating the practical benefits of our approach.
Schema-basedtransformational systems maintain a library of logicprogram schemata which capture large classes of logicprograms. One of the shortcomings of schema-basedtransformation approaches is their reliance on ...
详细信息
ISBN:
(纸本)3540627189
Schema-basedtransformational systems maintain a library of logicprogram schemata which capture large classes of logicprograms. One of the shortcomings of schema-basedtransformation approaches is their reliance on a large (possibly incomplete) set of logicprogram schemata that is required in order to capture all of the minor syntactic differences between semantically similar logicprograms. By defining a set of extensible logicprogram schemata and an associated set of logicprogramtransformations, it is possible to reduce the size of the schema library while maintaining the robustness of the transformational system, In our transformational system, we have defined a set of extensible logicprogram schemata in lambda Prolog. Because lambda Prolog is a higher-order logicprogramming language, it can be used as the representation language for boththe logicprograms and the extensible logicprogram schemata. In addition to the instantiation of predicate variables, extensible logicprogram schemata can be extended by applying standard programming techniques (e.g., accumulating results), introducing additional arguments (e.g., a second list to append to the end of the primary list), combining logicprogram schemata which share a common primary input, and connecting logicprogram schemata which are connected via a result of one schema being an input to the Ether schema. these extensions increase the robustness of logicprogram schemata and enhance traditional schema-basedtransformational systems.
Finite state automata with counters are useful for modelling systems with discrete parameters. the calculation of state invariants is an important tool in the analysis of such systems. Previous authors have presented ...
详细信息
ISBN:
(纸本)3540627189
Finite state automata with counters are useful for modelling systems with discrete parameters. the calculation of state invariants is an important tool in the analysis of such systems. Previous authors have presented techniques for the calculation of state invariants based on their approximation by convex polyhedra or periodic sets. In this paper we present a new method for the calculation of invariants for finite state automata with counters, based on their representation by gap-order constraints. this method differs from previous approaches by exploiting existing techniques for the calculation of least fixed paints. the use of least fixed points reduces the need for approximation and allows the generation of non-convex invariants. We do not need to specify the initial inputs to the automaton, but can leave them as uninstantiated parameters, or partially specify them using gap-order constraints. Our method not only provides a new tool for program analysis, but is also an interesting application of logicprogramming techniques.
An Unfold/Fold transformation system is a source-to-source rewriting methodology devised to improve the efficiency of a program. Any such transformation should preserve the main properties of the initial program: amon...
详细信息
this paper presents a set of schemata that support stepwise top-down design of logicprograms using abstract data types (ADTs). there are thus three main components to this approach: top-down design, program schemata ...
详细信息
this book constitutes the refereed conference proceedings of the 20thinternationalworkshop on Functional and Constraint logicprogramming, WFLP 2011, held in Odense, Denmark, in July 2011 as Part of the 13th Interna...
详细信息
ISBN:
(数字)9783642225314
ISBN:
(纸本)9783642225307
this book constitutes the refereed conference proceedings of the 20thinternationalworkshop on Functional and Constraint logicprogramming, WFLP 2011, held in Odense, Denmark, in July 2011 as Part of the 13thinternational Symposium on Principles and Practice of Declarative programming (PPDP 2011), the 22st international Symposium on logic-basedprogramsynthesis and transformation (lopstr 2011), and the 4thinternationalworkshop on Approaches and Applications of Inductive programming (AAIP 2011).
From the 10 papers submitted, 9 were accepted for presentation the proceeding. the papers cover current research in all areas of functional and logicprogramming as well as the integration of constraint logic and object-oriented programming, and term rewriting.
暂无评论