17 search results - page 1 / 4 » Ynot: dependent types for imperative programs |
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...
ICFP
2009
ACM
14 years 5 months ago
2009
ACM
We present a new approach for constructing and verifying higherorder, imperative programs using the Coq proof assistant. We build on the past work on the Ynot system, which is bas...
LICS
2000
IEEE
13 years 9 months ago
2000
IEEE
MICRO
2012
IEEE
11 years 7 months ago
2012
IEEE
This article presents a general algorithm for transforming sequential imperative programs into parallel data-flow programs. Our algorithm operates on a program dependence graph i...
ESOP
2007
Springer
13 years 11 months ago
2007
Springer
In this paper, we describe the key principles of a dependent type system for low-level imperative languages. The major contributions of this work are (1) a sound type system that c...