18429 search results - page 41 / 3686 » Typing dynamic typing |
ICFP
2008
ACM
14 years 10 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 ...
FLOPS
1999
Springer
14 years 2 months ago
1999
Springer
Abstract. Subtyping tends to undermine the effects of parametric polymorphism as far as the static detection of type errors is concerned. Starting with this observation we present...
WFLP
2009
Springer
14 years 4 months ago
2009
Springer
This paper shows that type-checking and type-inference problems are equivalent in domain-free lambda calculi with existential types, that is, type-checking problem is Turing reduci...
CSL
2008
Springer
13 years 11 months ago
2008
Springer
Abstract. This paper shows undecidability of type-checking and typeinference problems in domain-free typed lambda-calculi with existential types: a negation and conjunction fragmen...
ESOP
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. General refinement types allow types to be refined by predicates written in a general-purpose programming language, and can express function pre- and postconditions and d...