248 search results - page 27 / 50 » Phantom types and subtyping |
POPL
2007
ACM
14 years 8 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
13 years 11 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
14 years 7 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...
INTETAIN
2005
Springer
14 years 1 months ago
2005
Springer
Here we present a model of a subtype of one-line jokes (not puns) that describes the relationship between the connector (part of the setup) and the disjunctor (often called the pun...
FLOPS
2004
Springer
14 years 1 months ago
2004
Springer
Restricting polymorphism to values is now the standard way to obtain soundness in ML-like programming languages with imperative features. While this solution has undeniable advant...