Analyses, Optimizations and Extensions of Constraint Handling Rules: Ph.D. Summary

Schrijvers, Tom

doi:10.1007/11562931_44

Cited by 32 publications

(64 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…(a derivation of [57]), and CLP(.FZ?). The constraint languages and solvers, which are built on more basic blocks such as attributed variables [56] and/or the higher-level Constraint Handling Rules (CHR) [39,88], are also extensible at the user level. As an example, Figure 3 provides two examples using Ciao CLP(Q) constraints, combined with functional notation.…”

Section: ?-Use_package(functional) ?-[321] = ~Nrev(x)mentioning

confidence: 99%

An Overview of the Ciao Multiparadigm Language and Program Development Environment and Its Design Philosophy

Hermenegildo¹,

Bueno²,

Carro³

et al. 2008

Concurrency, Graphs and Models

View full text Add to dashboard Cite

Abstract. We describe some of the novel aspects and motivations behind the design and implementation of the Ciao multiparadigm programming system. An important aspect of Ciao is that it provides the programmer with a large number of useful features from different programming paradigms and styles, and that the use of each of these features can be turned on and off at will for each program module. Thus, a given module may be using e.g. higher order functions and constraints, while another module may be using objects, predicates, and concurrency. Furthermore, the language is designed to be extensible in a simple and modular way. Another important aspect of Ciao is its programming environment, which provides a powerful preprocessor (with an associated assertion language) capable of statically finding non-trivial bugs, verifying that programs comply with specifications, and performing many types of program optimizations. Such optimizations produce code that is highly competitive with other dynamic languages or, when the highest levéis of optimization are used, even that of static languages, all while retaining the interactive development environment of a dynamic language. The environment also includes a powerful auto-documenter. The paper provides an informal overview of the language and program development environment. It aims at illustrating the design philosophy rather than at being exhaustive, which would be impossible in the format of a paper, pointing instead to the existing literature on the system.

show abstract

Section: ?-Use_package(functional) ?-[321] = ~Nrev(x)mentioning

confidence: 99%

An Overview of the Ciao Multiparadigm Language and Program Development Environment and Its Design Philosophy

Hermenegildo¹,

Bueno²,

Carro³

et al. 2008

Concurrency, Graphs and Models

View full text Add to dashboard Cite

show abstract

“…In particular, type information is useful in this context. When used as a basis for determining the possible calls to the program, it leads to compiler optimisations [11], more precise termination conditions [4,7] and more refined interpretations for proving termination [1,9].…”

Section: Introductionmentioning

confidence: 99%

“…For CHR, some direct approaches were developed [3,11], mainly based on approaches developed for LP. Direct approaches usually make use of abstract interpretation.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A Transformational Approach for Proving Properties of the CHR Constraint Store

Pilozzi

Schrijvers

Bruynooghe

2010

Logic-Based Program Synthesis and Transformation

Self Cite

View full text Add to dashboard Cite

Abstract. Proving termination of, or generating efficient control for Constraint Handling Rules (CHR) programs requires information about the kinds of constraints that can show up in the CHR constraint store. In contrast to Logic Programming (LP), there are not many tools available for deriving such information for CHR. Hence, instead of building analyses for CHR from scratch, we define a transformation from CHR to Prolog and reuse existing analysis tools for Prolog. The proposed transformation has been implemented and combined with PolyTypes 1.3, a type analyser for Prolog, resulting in an accurate description of the types of CHR programs. Moreover, the transformation is not limited to type analysis. It can also be used to prove other properties of the constraints showing up in constraint stores, using tools for Prolog.

show abstract

“…Recently, it was shown that all algorithms can be implemented in CHR while preserving both time and space complexity [15]. We assume familiarity with CHR (see [6,12]). …”

Section: Introductionmentioning

confidence: 99%

The Correspondence Between the Logical Algorithms Language and CHR

2007

Self Cite

View full text Add to dashboard Cite

This paper investigates the relationship between the Logical Algorithms formalism (LA) of Ganzinger and McAllester and Constraint Handling Rules (CHR). We present a translation scheme from LA to CHR rp : CHR with rule priorities and show that the metacomplexity theorem for LA can be applied to a subset of CHR rp via inverse translation. This result is compared with previous work. Inspired by the high-level implementation proposal of Ganzinger and McAllester, we demonstrate how LA programs can be compiled into CHR rules that interact with a scheduler written in CHR. This forms the first actual implementation of LA. Our implementation achieves the required complexity for the meta-complexity theorem to hold and can execute a subset of CHR rp with strong complexity bounds. Handling Rules (CHR). We present a translation scheme from LA to CHR rp : CHR with rule priorities and show that the meta-complexity theorem for LA can be applied to a subset of CHR rp via inverse translation. This result is compared with previous work. Inspired by the high-level implementation proposal of Ganzinger and McAllester, we demonstrate how LA programs can be compiled into CHR rules that interact with a scheduler written in CHR. This forms the first actual implementation of LA. Our implementation achieves the complexity required for the metacomplexity theorem to hold and can execute a subset of CHR rp with strong complexity bounds.

show abstract

Analyses, Optimizations and Extensions of Constraint Handling Rules: Ph.D. Summary

Cited by 32 publications

References 5 publications

An Overview of the Ciao Multiparadigm Language and Program Development Environment and Its Design Philosophy

An Overview of the Ciao Multiparadigm Language and Program Development Environment and Its Design Philosophy

A Transformational Approach for Proving Properties of the CHR Constraint Store

The Correspondence Between the Logical Algorithms Language and CHR

Contact Info

Product

Resources

About