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]
@inproceedings{GengelbachW20, title = {Proof-Theoretic Conservative Extension of HOL with Ad-hoc Overloading}, author = {Arve Gengelbach and Tjark Weber}, year = {2020}, doi = {10.1007/978-3-030-64276-1_2}, url = {https://doi.org/10.1007/978-3-030-64276-1_2}, researchr = {https://researchr.org/publication/GengelbachW20}, cites = {0}, citedby = {0}, pages = {23-42}, booktitle = {Theoretical Aspects of Computing - ICTAC 2020 - 17th International Colloquium, Macau, China, November 30 - December 4, 2020, Proceedings}, editor = {Violet Ka I Pun and Volker Stolz and Adenilso Simão}, volume = {12545}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {978-3-030-64276-1}, }