Titlebook: Logic Based Program Synthesis and Transformation; 13th International S Maurice Bruynooghe Conference proceedings 2004 Springer-Verlag Berli

companion

A Program Transformation for Backwards Analysis of Logic Programss to derive initial goals or pre-conditions that guarantee that, when the program is executed, the given properties hold. The solution for logic programs presented here is based on a transformation of the input program, which makes explicit the dependencies of the given program points on the initial

MOAT

An Efficient Staging Algorithm for Binding-Time Analysis1]. The task of BTA is to divide a source program into two parts according to a given binding-time specification?[2]. A binding-time specification gives information about availability of data: . data are available at compile-time while . data are available at run time. BTA determines, from a binding

漂亮

不能和解

Constructively Characterizing Fold and Unfoldnd ., . given a function ., when can a function . be constructed such that .?=?.. or .?=?..? These results are refinements of the classical characterization of . and . given by Gibbons, Hutton and Altenkirch in?[6]. The proofs presented here have been formalized in Nuprl’s constructive type theory?[

可憎

Deterministic Higher-Order Patterns for Program Transformational program transformation systems. However,higher-order matching in general is nondeterministic, and the matching algorithm is so expensive that even second-order matching is NP-complete. It is orthodox to impose constraint on the form of patterns to obtain the desirable matches satisfying certain p

散開(kāi)

From Interpreter to Logic Engine by Defunctionalizationic engine in the form of an abstract machine. The derivation originates in previous work (our article at PPDP 2003) where it was applied to the lambda-calculus. The key transformation here is Reynolds’s defunctionalization that transforms a tail-recursive, continuation-passing interpreter into a tra

機(jī)密

Linearization by Program Transformationerties of strong normalization, non-duplicating reductions and typability in polynomial time. The advantage of this class over the linear lambda-calculus is the possibility of transforming general terms into weak linear terms with the same normal form. We present such transformation and prove its co

伸展

Continuation Semantics as Horn Clauseso provably correct compilation based on . of programming languages and partial evaluation. We show that the definite clause grammar (DCG) notation can be used for specifying both the syntax and semantics of imperative languages. We next show that continuation semantics can also be expressed in the H

Cardiac

Simplification of Database Integrity Constraints Revisited: A Transformational Approachd checks for each update. The present approach introduces a set of transformation operators that apply to database integrity constraints with each operator representing a concise, semantics-preserving operation. These operators are applied in a procedure producing simplified constraints for parametr

記憶

Integration and Optimization of Rule-Based Constraint Solverslaboration of constraint solvers. In this paper, we introduce a methodology for the tight integration of CHR constraint programs into one such program. CHR is a high-level rule-based language for writing constraint solvers and reasoning systems. A constraint solver is well-behaved if it is terminati