Download PDFOpen PDF in browserA Mechanised Semantics for HOL with Ad-hoc Overloading18 pages•Published: May 27, 2020AbstractIsabelle/HOL augments classical higher-order logic with ad-hoc overloading of constant definitions— 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.Keyphrases: Ad-hoc overloading, higher-order logic, interactive theorem proving In: Elvira Albert and Laura Kovács (editors). LPAR23. LPAR-23: 23rd International Conference on Logic for Programming, Artificial Intelligence and Reasoning, vol 73, pages 498--515
|