6 search results - page 1 / 2 » Abstract Predicates and Mutable ADTs in Hoare Type Theory |
ESOP
2007
Springer
13 years 11 months ago
2007
Springer
ESOP
2008
Springer
13 years 6 months ago
2008
Springer
We present a denotational model of impredicative Hoare Type Theory, a very expressive dependent type theory in which one can and reason about mutable abstract data types. The model...
JFP
2008
13 years 5 months ago
2008
We consider the problem of reconciling a dependently typed functional language with imperative features such as mutable higher-order state, pointer aliasing, and non-termination. ...
POPL
2010
ACM
14 years 2 months ago
2010
ACM
The method of logical relations is a classic technique for proving the equivalence of higher-order programs that implement the same observable behavior but employ different intern...
ICFP
2008
ACM
14 years 4 months ago
2008
ACM
We describe an axiomatic extension to the Coq proof assistant, that supports writing, reasoning about, and extracting higher-order, dependently-typed programs with side-effects. C...