1. Archive of Formal Proofs.
http://www.isa-afp.org
2. Abdulaziz, M., Mehlhorn, K., Nipkow, T.: Trustworthy graph algorithms (invited talk). In: Rossmanith, P., Heggernes, P., Katoen, J. (eds.) 44th International Symposium on Mathematical Foundations of Computer Science, MFCS 2019. LIPIcs, vol. 138, pp. 1:1–1:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019).
https://doi.org/10.4230/LIPIcs.MFCS.2019.1
3. Abrial, J.: The B-book - Assigning Programs to Meanings. Cambridge University Press (1996).
https://doi.org/10.1017/CBO9780511624162
4. Lecture Notes in Computer Science;J-R Abrial,2003
5. Adams, S.: Efficient sets - a balancing act. J. Funct. Program. 3(4), 553–561 (1993).
https://doi.org/10.1017/S0956796800000885