{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,19]],"date-time":"2025-12-19T09:44:10Z","timestamp":1766137450516},"reference-count":0,"publisher":"EasyChair","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>Isabelle\/HOL augments classical higher-order logic with ad-hoc overloading of constant definitions\u2014 that is, one constant may have several definitions for non-overlapping types. In this paper, we present a mechanised proof that HOL with ad-hoc overloading is consistent. All our results have been formalised in the HOL4 theorem prover.<\/jats:p>","DOI":"10.29007\/413d","type":"proceedings-article","created":{"date-parts":[[2020,5,27]],"date-time":"2020-05-27T22:10:11Z","timestamp":1590617411000},"page":"498-479","source":"Crossref","is-referenced-by-count":6,"title":["A Mechanised Semantics for HOL with Ad-hoc Overloading"],"prefix":"10.29007","volume":"73","author":[{"given":"Johannes","family":"\u00c5man Pohjola","sequence":"first","affiliation":[]},{"given":"Arve","family":"Gengelbach","sequence":"additional","affiliation":[]}],"member":"11545","event":{"name":"LPAR23. LPAR-23: 23rd International Conference on Logic for Programming, Artificial Intelligence and Reasoning"},"container-title":["EPiC Series in Computing"],"original-title":[],"deposited":{"date-parts":[[2020,5,27]],"date-time":"2020-05-27T22:10:13Z","timestamp":1590617413000},"score":1,"resource":{"primary":{"URL":"https:\/\/easychair.org\/publications\/paper\/9Hcd"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":0,"URL":"https:\/\/doi.org\/10.29007\/413d","relation":{},"ISSN":["2398-7340"],"issn-type":[{"type":"print","value":"2398-7340"}],"subject":[]}}