137 search results - page 8 / 28 » Polymorphic Directional Types for Logic Programming |
SAS
1994
Springer
15 years 5 months ago
1994
Springer
147
Voted
SAS
1994
Springer
15 years 6 months ago
1994
Springer
Constraint-based analysis is a technique for inferring implementation types. Traditionally it has been described using mathematical formalisms. We explain it in a different and mor...
131
click to vote
ICFP
2008
ACM
16 years 2 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 ...
125
click to vote
POPL
1992
ACM
15 years 6 months ago
1992
ACM
Polymorphic record calculi have recently attracted much attention as a typed foundation for objectoriented programming. This is based on the fact that a function that selects a fi...
127
Voted
ICLP
2003
Springer
15 years 7 months 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...