74 search results - page 6 / 15 » Type Inferencing for Polymorphic Order-Sorted Logic Programs |
ICFP
2008
ACM
14 years 7 months ago
2008
ACM
MLF is a type system that seamlessly merges ML-style type inference with System-F polymorphism. We propose a system of graphic (type) constraints that can be used to perform type ...
ICLP
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Information about the nondeterminism behavior of a functional logic program is important for various reasons. For instance, a nondeterministic choice in I/O operations re...
ICLP
2003
Springer
14 years 21 days ago
2003
Springer
Abstract. In this paper we show how we can use size and groundness analyses lifted to regular and (polymorphic) Hindley/Milner typed programs to determine more accurate termination...
SAS
2005
Springer
14 years 29 days ago
2005
Springer
A method is developed to infer a polymorphic well-typing for a logic program. Our motivation is to improve the automation of termination analysis by deriving types from which norms...
ICFP
2000
ACM
13 years 12 months ago
2000
ACM
We show that standard formulations of intersection type systems are unsound in the presence of computational effects, and propose a solution similar to the value restriction for ...