Locating Type Errors in Untyped CLP Programs

Drabent, Włodzimierz; Maluszynski, Jan; Pietrzak, Paweł

doi:10.1007/10722311_5

Cited by 3 publications

(3 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The prototype has been implemented in SICStus Prolog. A more detailed description of our tool, in its version for parameterless specifications, together with an example error diagnosis session is given in Drabent et al (2000a).…”

Section: The Structure Of the Toolmentioning

confidence: 99%

“…A solution to the second problem is a main contribution of this paper. We derive it by showing how the approach of Drabent et al (2000a) can be extended to the case of parametric specifications. (In our former work parametric grammars were used only in the user interface, to represent families of grammars.)…”

Section: Introductionmentioning

confidence: 99%

“…A technique of Gallagher & de Waal (1994), similar to abstract interpretation, derives types in a form equivalent to discriminative term grammars. In Drabent et al (2000a) we modified the latter technique to infer directional types for CLP programs. In this paper we present its further extension for inferring parametric directional types.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Using parametric set constraints for locating errors in CLP programs

Drabent

Maluszynski

Pietrzak

2002

Theory and Practice of Logic Programming

Self Cite

View full text Add to dashboard Cite

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 debugging tool supporting the proposed approach is illustrated on examples. The paper is a substantial extension of the previous work by the same authors concerning monomorphic directional types.

show abstract

Section: The Structure Of the Toolmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%