74 search results - page 1 / 15 » Type Inferencing for Polymorphic Order-Sorted Logic Programs |
ICLP
1995
Springer
13 years 8 months ago
1995
Springer
The purpose of this paper is to study the problem of complete type inferencing for polymorphic order-sorted logic programs. We show that previous approaches are incomplete even if...
SIGMOD
1989
ACM
13 years 9 months ago
1989
ACM
Machiavelli is a polymorphically typed programming language in the spirit of ML, but supports an extended method of type inferencing that makes its polymorphism more general and a...
TACAS
2010
Springer
13 years 2 months ago
2010
Springer
Abstract. Intermediate languages are a paradigm to separate concerns in software verification systems when bridging the gap between programming languages and the logics understood ...
ICFP
2006
ACM
14 years 4 months ago
2006
ACM
In previous work, we proposed a Hoare Type Theory (HTT) which combines effectful higher-order functions, dependent types and Hoare Logic specifications into a unified framework. H...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
We present a non-null annotations inferencer for the Java bytecode language. We previously proposed an analysis to infer non-null annotations and proved it soundness and completen...