Gradual certified programming in Coq

@article{Tanter2015GradualCP,
  title={Gradual certified programming in Coq},
  author={{\'E}. Tanter and Nicolas Tabareau},
  journal={ArXiv},
  year={2015},
  volume={abs/1506.04205}
}
Expressive static typing disciplines are a powerful way to achieve high-quality software. However, the adoption cost of such techniques should not be under-estimated. Just like gradual typing allows for a smooth transition from dynamically-typed to statically-typed programs, it seems desirable to support a gradual path to certified programming. We explore gradual certified programming in Coq, providing the possibility to postpone the proofs of selected properties, and to check "at runtime… Expand
20 Citations
Approximate normalization for gradual dependent types
  • 2
  • PDF
Gradual refinement types
  • 40
  • PDF
Gradual Refinement Types Extended Version with Proofs
  • 1
  • PDF
1 Approximate Normalization for Gradual Dependent Types
  • 1
Certified grammar transformation to Chomsky normal form in f
  • PDF
Partial type equivalences for verified dependent interoperability
  • 12
  • PDF
Towards progressive program verification in Dafny
An Integrated Theory of Type-Based Static and Dynamic Verification
  • PDF
A reasonably exceptional type theory
  • 5
  • PDF
Foundations of dependent interoperability
  • 17
  • PDF
...
1
2
...

References

SHOWING 1-10 OF 46 REFERENCES
Confined gradual typing
  • 15
  • PDF
Gradual Typing for Objects
  • 402
  • PDF
Subset Coercions in Coq
  • 102
  • PDF
Gradual Security Typing with References
  • 42
  • PDF
Gradual Typestate
  • 77
  • PDF
Dynamic typing in a statically-typed language
  • 348
  • PDF
Gradual Typing for Functional Languages
  • 344
  • Highly Influential
  • PDF
Nested refinements: a logic for duck typing
  • 53
  • PDF
QuickChick: Property-based testing for Coq
  • 30
  • PDF
...
1
2
3
4
5
...