43 search results - page 2 / 9 » Proving ML Type Soundness Within Coq |
ICFP
2010
ACM
13 years 6 months ago
2010
ACM
Modern proof assistants such as Coq and Isabelle provide high degrees of expressiveness and assurance because they support formal reasoning in higher-order logic and supply explic...
TPHOL
2007
IEEE
13 years 11 months ago
2007
IEEE
We propose a method to extract purely functional contents from logical inductive types in the context of the Calculus of Inductive Constructions. This method is based on a mode con...
ICFP
2006
ACM
14 years 5 months ago
2006
ACM
I report on an experience using the Coq proof assistant to develop a program verification tool with a machine-checkable proof of full correctness. The verifier is able to prove me...
PLDI
2012
ACM
11 years 7 months ago
2012
ACM
Approximate program transformations such as skipping tasks [29, 30], loop perforation [21, 22, 35], reduction sampling [38], multiple selectable implementations [3, 4, 16, 38], dy...
POPL
2012
ACM
12 years 24 days ago
2012
ACM
We show how to combine a general purpose type system for an existing language with support for programming with binders and contexts by refining the type system of ML with a rest...