Add to ORKGAutomatic well-typing inference for untyped logic programs is useful for error detection, optimized compilation, termination analysis, \ldots Existing inferences are either cheap and inaccurate, or accurate and expensive. We propose a novel SCC-based analysis that is a compromise between accuracy and computational cost. This technical report contains additional experimental results.nrpages: 14status: publishe
Dependencies play a major role in the analysis of program properties. The analysis of groundness dep...
Recent works by the authors address the problem of automating the selection of a candidate norm for ...
We analyze basic shortcomings of existing proposals for type checking and type inferencing in logic ...
Type information has many applications; it can e.g. be used in optimized compilation, termination a...
Abstract. Type information has many applications, it can be used for optimized compilation, terminat...
A method is developed to infer a polymorphic well-typing for a logic program. Our motivation is to i...
A method is developed to infer a polymorphic well-typing for a logic program. Our motivation is to ...
Abstract. A method is developed to infer a polymorphic well-typing for a logic program. Our motivati...
This thesis develops a polymorphic type system for logic programs. Our approach is semantically orie...
Abstract. Type inference in the context of polymorphic recursion is notoriously difficult. The exten...
In a previous paper, we have developed a type abstract interpreter which was shown to be more precis...
We present a type inference system for Horn clause logic programs, based on a bottom-up abstract int...
AbstractWe present a type inference system for Horn clause logic programs, based on a bottom-up abst...
AbstractIn this paper, we first introduce a notion of polymorphic abstract interpretation that forma...
This paper analyses the requirements to the notion of type correctness in logic programming and prop...
Dependencies play a major role in the analysis of program properties. The analysis of groundness dep...
Recent works by the authors address the problem of automating the selection of a candidate norm for ...
We analyze basic shortcomings of existing proposals for type checking and type inferencing in logic ...
Type information has many applications; it can e.g. be used in optimized compilation, termination a...
Abstract. Type information has many applications, it can be used for optimized compilation, terminat...
A method is developed to infer a polymorphic well-typing for a logic program. Our motivation is to i...
A method is developed to infer a polymorphic well-typing for a logic program. Our motivation is to ...
Abstract. A method is developed to infer a polymorphic well-typing for a logic program. Our motivati...
This thesis develops a polymorphic type system for logic programs. Our approach is semantically orie...
Abstract. Type inference in the context of polymorphic recursion is notoriously difficult. The exten...
In a previous paper, we have developed a type abstract interpreter which was shown to be more precis...
We present a type inference system for Horn clause logic programs, based on a bottom-up abstract int...
AbstractWe present a type inference system for Horn clause logic programs, based on a bottom-up abst...
AbstractIn this paper, we first introduce a notion of polymorphic abstract interpretation that forma...
This paper analyses the requirements to the notion of type correctness in logic programming and prop...
Dependencies play a major role in the analysis of program properties. The analysis of groundness dep...
Recent works by the authors address the problem of automating the selection of a candidate norm for ...
We analyze basic shortcomings of existing proposals for type checking and type inferencing in logic ...