1. Lecture Notes in Computer Science;L. Cruz-Filipe,2004
2. Spitters, B., van der Weegen, E.: Type classes for mathematics in type theory. MSCS, Special Issue on “Interactive Theorem Proving and the Formalization of Mathematics” 21, 1–31 (2011)
3. Krebbers, R., Spitters, B.: Type classes for efficient exact real arithmetic in Coq. LMCS 9(1:1) (2013), doi:10.2168/LMCS-9(1:01)2013
4. Lecture Notes in Computer Science;R. O’Connor,2008
5. Gonthier, G., Ziliani, B., Nanevski, A., Dreyer, D.: How to make ad hoc proof automation less ad hoc. In: ICFP, pp. 163–175 (2011)