1003 search results - page 47 / 201 » Type Inference with Inequalities |
ISIPTA
2005
IEEE
14 years 2 months ago
2005
IEEE
When considering sampling models described by a distribution from an exponential family, it is possible to create two types of imprecise probability models. One is based on the co...
ICFP
2005
ACM
14 years 8 months ago
2005
ACM
MLF is a type system that extends a functional language with impredicative rank-n polymorphism. Type inference remains possible and only in some clearly defined situations, a loca...
TPHOL
2007
IEEE
14 years 3 months ago
2007
IEEE
In Mizar, unlike in most other proof assistants, the types are not part of the foundations of the system. Mizar is based on untyped set theory, which means that in Mizar expression...
ICLP
2003
Springer
14 years 1 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...
ICFP
1997
ACM
14 years 28 days ago
1997
ACM
We observe that the principal typing property of a type system is the enabling technology for modularity and separate compilation [10]. We use this technology to formulate a modul...