This paper introduces a framework of parametric descriptive directional types for Constraint Logic Programming (CLP). It proposes a method for locating type errors in CLP programs, and presents a prototype debugging tool. The main technique used is checking correctness of programs w.r.t. type specifications. The approach is based on a generalization of known methods for proving the correctness of logic programs to the case of parametric specifications. Set constraint techniques are used for formulating and checking verification conditions for (parametric) polymorphic type specifications. The specifications are expressed in a parametric extension of the formalism of term grammars. The soundness of the method is proved, and the prototype debu...
. We present in this paper a method allowing to structure a constraint store by modifying the constr...
Abstract. Type inference in the context of polymorphic recursion is notoriously difficult. The exten...
AbstractConstraint Logic Programming (CLP) is a merger of two declarative paradigms: constraint solv...
This paper introduces a framework of parametric descriptive directional types for Constraint Logic P...
AbstractThe paper presents a diagnosis tool for CLP programs. It deals with partial correctness w.r....
We present an algorithm for automatic type checking of logic programs with respect to directional ty...
International audienceWe present a type system for linear constraints over reals and its use in mode...
We follow the set-based approach to directional types proposed by Aiken and Lakshman[1]. Their type ...
We analyze basic shortcomings of existing proposals for type checking and type inferencing in logic ...
Approximate descriptions of the success set of a program have many uses in program development and ...
This chapter presents a static diagnosis tool that locates type errors in untyped CLP programs witho...
Abstract. We propose a generic type system for the Constraint Handling Rules (CHR), a rewriting rule...
Directional types form a type system for logic programs which is based on the view of a predicate as...
This paper proposes a type system for logic programming where types are \u000Astructured in two ways...
this paper we describe a constraint logic programming language clp(sc) over set constraints in the s...
. We present in this paper a method allowing to structure a constraint store by modifying the constr...
Abstract. Type inference in the context of polymorphic recursion is notoriously difficult. The exten...
AbstractConstraint Logic Programming (CLP) is a merger of two declarative paradigms: constraint solv...
This paper introduces a framework of parametric descriptive directional types for Constraint Logic P...
AbstractThe paper presents a diagnosis tool for CLP programs. It deals with partial correctness w.r....
We present an algorithm for automatic type checking of logic programs with respect to directional ty...
International audienceWe present a type system for linear constraints over reals and its use in mode...
We follow the set-based approach to directional types proposed by Aiken and Lakshman[1]. Their type ...
We analyze basic shortcomings of existing proposals for type checking and type inferencing in logic ...
Approximate descriptions of the success set of a program have many uses in program development and ...
This chapter presents a static diagnosis tool that locates type errors in untyped CLP programs witho...
Abstract. We propose a generic type system for the Constraint Handling Rules (CHR), a rewriting rule...
Directional types form a type system for logic programs which is based on the view of a predicate as...
This paper proposes a type system for logic programming where types are \u000Astructured in two ways...
this paper we describe a constraint logic programming language clp(sc) over set constraints in the s...
. We present in this paper a method allowing to structure a constraint store by modifying the constr...
Abstract. Type inference in the context of polymorphic recursion is notoriously difficult. The exten...
AbstractConstraint Logic Programming (CLP) is a merger of two declarative paradigms: constraint solv...