602 search results - page 6 / 121 » Program Calculation in Coq |
PLDI
1994
ACM
15 years 3 months ago
1994
ACM
ICFP
2002
ACM
15 years 11 months ago
2002
ACM
Motivated by applications to proof assistants based on dependent types, we develop and prove correct a strong reducer and equivalence checker for the -calculus with products, sums...
94
Voted
TLCA
1993
Springer
15 years 3 months ago
1993
Springer
This paper describes formalizations of Tait’s normalization proof for the simply typed λ-calculus in the proof assistants Minlog, Coq and Isabelle/HOL. From the formal proofs p...
187
Voted
ICFP
2009
ACM
16 years 9 days 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...
ICFP
2008
ACM
15 years 11 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...