Publisher
Springer Nature Switzerland
Reference36 articles.
1. Abdulaziz, M., Mehlhorn, K., Nipkow, T.: Trustworthy graph algorithms. In: Rossmanith, P., Heggernes, P., Katoen, J.P. (eds.) 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), vol. 138, pp. 1:1–1:22. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl, Germany (2019). https://doi.org/10.4230/LIPIcs.MFCS.2019.1
2. Bauer, A., Berčič, K., Devillez, G., Taslak, J.: Lean-HoG (2024). https://github.com/katjabercic/Lean-HoG/
3. Blum, M., Kanna, S.: Designing programs that check their work. In: STOC’89: Proceedings of the Twenty-First Annual ACM Symposium on Theory of Computing, pp. 86–97, February 1989. https://doi.org/10.1145/200836.200880
4. Carneiro, M.: The Type Theory of Lean. Master’s thesis, Carnegie Mellon University, Pittsburgh (2019)
5. Codel, C.R., Avigad, J., Heule, M.J.H.: Verified encodings for SAT solvers. in: Nadel, A., Rozier, K.Y. (eds.) Formal Methods in Computer-Aided Design, FMCAD 2023, Ames, IA, USA, 24–27 October 2023, pp. 141–151. IEEE (2023). https://doi.org/10.34727/2023/isbn.978-3-85448-060-0_22