215 search results - page 17 / 43 » Verifying haskell programs using constructive type theory |
ICFP
2004
ACM
14 years 9 months ago
2004
ACM
Useful type inference must be faster than normalization. Otherwise, you could check safety conditions by running the program. We analyze the relationship between bounds on normali...
TLDI
2005
ACM
14 years 2 months ago
2005
ACM
Two different ways of defining ad-hoc polymorphic operations commonly occur in programming languages. With the first form polymorphic operations are defined inductively on the...
TPHOL
2009
IEEE
14 years 3 months ago
2009
IEEE
VCC is an industrial-strength verification environment for low-level concurrent system code written in C. VCC takes a program (annotated with function contracts, state assertions,...
ICFP
2006
ACM
14 years 9 months ago
2006
ACM
Datatype-generic programming (DGP) is the next step beyond abstracting over types using parametric polymorphism, which is often called "genericity" in object-oriented la...
CATS
2007
13 years 10 months ago
2007
In order to represent, compute and reason with advanced data types one must go beyond the traditional treatment of data types as being inductive types and, instead, consider them ...