215 search results - page 14 / 43 » Verifying haskell programs using constructive type theory |
ICFP
2008
ACM
14 years 9 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 ...
POPL
2010
ACM
14 years 6 months ago
2010
ACM
Most systems based on separation logic consider only restricted forms of implication or non-separating conjunction, as full support for these connectives requires a non-trivial no...
ICFP
2010
ACM
13 years 10 months ago
2010
ACM
We present a type and effect system for flow analysis that makes essential use of higher-ranked polymorphism. We show that, for higher-order functions, the expressiveness of highe...
ICFP
2008
ACM
14 years 9 months ago
2008
ACM
Datatype-generic programming involves parametrization by the shape of data, in the form of type constructors such as `list of'. Most approaches to datatype-generic programmin...
ICFP
2005
ACM
14 years 9 months ago
2005
ACM
High-level formalisms for reasoning about names and binding such uijn indices, various flavors of higher-order abstract syntax, ry of Contexts, and nominal abstract syntax address...