7 search results - page 1 / 2 » From OBJ to ML to Coq |
BIRTHDAY
2006
Springer
13 years 8 months ago
2006
Springer
ICFP
2012
ACM
11 years 7 months ago
2012
ACM
The higher-order logic found in proof assistants such as Coq and various HOL systems provides a convenient setting for the development and verification of pure functional program...
ENTCS
2006
13 years 4 months ago
2006
We describe an automatic complexity analysis mechanism for programs extracted from proofs carried out with the proof assistant Coq. By extraction, we mean the automatic generation...
POPL
2012
ACM
12 years 10 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...
POPL
2008
ACM
14 years 5 months ago
2008
ACM
Machine-checked proofs of properties of programming languages have become a critical need, both for increased confidence in large and complex designs and as a foundation for techn...