215 search results - page 10 / 43 » Verifying haskell programs using constructive type theory |
POPL
2007
ACM
14 years 8 months ago
2007
ACM
We present a model of recursive and impredicatively quantified types with mutable references. We interpret in this model all of the type constructors needed for typed intermediate...
POPL
2006
ACM
14 years 8 months ago
2006
ACM
This article investigates formal properties of a family of semantically sound flow-sensitive type systems for tracking information flow in simple While programs. The family is ind...
POPL
2003
ACM
14 years 8 months ago
2003
ACM
We introduce a notion of guarded recursive (g.r.) datatype constructors, generalizing the notion of recursive datatypes in functional programming languages such as ML and Haskell....
PLPV
2009
ACM
14 years 4 months ago
2009
ACM
This paper is part of a line of work on using the logical techniques of polarity and focusing to design a dependent programming language, with particular emphasis on programming w...
POPL
2010
ACM
14 years 5 months ago
2010
ACM
d by recent research in abstract model checking, we present a new approach to inferring dependent types. Unlike many of the existing approaches, our approach does not rely on prog...