316 search results - page 29 / 64 » Subtyping Union Types |
ENTCS
2006
14 years 9 months ago
2006
In this paper we introduce a new approach to formalizing certain type operations in type theory. Traditionally, many type constructors in type theory are independently axiomatized...
ICFP
1999
ACM
15 years 2 months ago
1999
ACM
This paper defines an extended polymorphic type system for an ML-style programming language, and develops a sound and complete type inference algorithm. Different from the conve...
174
click to vote
POPL
2007
ACM
15 years 10 months ago
2007
ACM
C programs can be difficult to debug due to lax type enforcement and low-level access to memory. We present a dynamic analysis for C that checks heap snapshots for consistency wit...
FPCA
1989
15 years 1 months ago
1989
Bounded quantification was introduced by Cardelli and Wegner as a means of typing functions that operate uniformly over all subtypes of a given type. They defined a simple “ob...
ICFP
2003
ACM
15 years 9 months ago
2003
ACM
We propose a conservative extension of HM(X), a generic constraint-based type inference framework, with bounded existential (a.k.a. abstract) and universal (a.k.a. polymorphic) da...