Proof-Theoretic Conservative Extension of HOL with Ad-hoc Overloading

Arve Gengelbach, Tjark Weber. Proof-Theoretic Conservative Extension of HOL with Ad-hoc Overloading. In Violet Ka I Pun, Volker Stolz, Adenilso Simão, editors, Theoretical Aspects of Computing - ICTAC 2020 - 17th International Colloquium, Macau, China, November 30 - December 4, 2020, Proceedings. Volume 12545 of Lecture Notes in Computer Science, pages 23-42, Springer, 2020. [doi]

Abstract

Abstract is missing.