This paper presents a backward type analysis for logic programs. Given type signatures for a collection of selected predicates such as builtin or library predicates, the analysis infers type signatures for other predicates such that the execution of any query satisfying the inferred type signatures will not violate the type signatures for the selected predicates. Thus, the backward type analysis generalises type checking in which the programmer manually specifies type signatures for all predicates that are checked for consistency by a type checker
Dependencies play a major role in the analysis of program properties. The analysis of groundness dep...
This paper describes an experiment in the definition of tools for type inference and type verificat...
Regular types are a powerful tool for computing very precise descriptive types for logic programs. H...
This paper is concerned with the type analysis of logic programs where, by type, we mean a property ...
We analyze basic shortcomings of existing proposals for type checking and type inferencing in logic ...
AbstractThis paper presents a new approach to the problem of guaranteeing that definite logic progra...
AbstractA theory for a type system for logic programs is developed which addressesthe question of we...
This thesis develops a polymorphic type system for logic programs. Our approach is semantically orie...
AbstractThis paper presents a new approach to type inference of Prolog programs. The novelty is in t...
We present a type inference system for Horn clause logic programs, based on a bottom-up abstract int...
We present an algorithm for automatic type checking of logic programs with respect to directional ty...
We follow the set-based approach to directional types proposed by Aiken and Lakshman[1]. Their type ...
AbstractWe present a type inference system for Horn clause logic programs, based on a bottom-up abst...
AbstractThis paper presents a new notion of typing for logic programs which generalizes the notion o...
This paper explores the relationship between verification of logic programs and imperative programs ...
Dependencies play a major role in the analysis of program properties. The analysis of groundness dep...
This paper describes an experiment in the definition of tools for type inference and type verificat...
Regular types are a powerful tool for computing very precise descriptive types for logic programs. H...
This paper is concerned with the type analysis of logic programs where, by type, we mean a property ...
We analyze basic shortcomings of existing proposals for type checking and type inferencing in logic ...
AbstractThis paper presents a new approach to the problem of guaranteeing that definite logic progra...
AbstractA theory for a type system for logic programs is developed which addressesthe question of we...
This thesis develops a polymorphic type system for logic programs. Our approach is semantically orie...
AbstractThis paper presents a new approach to type inference of Prolog programs. The novelty is in t...
We present a type inference system for Horn clause logic programs, based on a bottom-up abstract int...
We present an algorithm for automatic type checking of logic programs with respect to directional ty...
We follow the set-based approach to directional types proposed by Aiken and Lakshman[1]. Their type ...
AbstractWe present a type inference system for Horn clause logic programs, based on a bottom-up abst...
AbstractThis paper presents a new notion of typing for logic programs which generalizes the notion o...
This paper explores the relationship between verification of logic programs and imperative programs ...
Dependencies play a major role in the analysis of program properties. The analysis of groundness dep...
This paper describes an experiment in the definition of tools for type inference and type verificat...
Regular types are a powerful tool for computing very precise descriptive types for logic programs. H...