Results 1 - 2 of 2
- In Interactive Theorem Proving, volume 6898 of LNCS , 2011
"... ..."(Show Context)
- HIGHER-ORDER AND SYMBOLIC COMPUTATION
...cutability in mind. Complications in proofs to obtain an efficiently executable implementation were willingly taken and handling them are large contributions of these projects. Code generation in Coq =-=-=- has been used in various developments, notably the CompCert compiler  and the certificate checkers in the MOBIUS project . Like in Isabelle, functional specifications pose no intrinsic problem...
Developed at and hosted by The College of Information Sciences and Technology
© 2007-2016 The Pennsylvania State University