A Mechanised Semantics for HOL with Ad-hoc Overloading

18 pages•Published: May 27, 2020

Johannes Åman Pohjola and Arve Gengelbach

Abstract

Isabelle/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 Kovacs (editors). LPAR23. LPAR-23: 23rd International Conference on Logic for Programming, Artificial Intelligence and Reasoning, vol 73, pages 498-515.

Links:	https://easychair.org/publications/paper/9Hcd
	https://doi.org/10.29007/413d

BibTeX entry

@inproceedings{LPAR23:Mechanised_Semantics_HOL_with,
  author    = {Johannes Åman Pohjola and Arve Gengelbach},
  title     = {A Mechanised Semantics for HOL with Ad-hoc Overloading},
  booktitle = {LPAR23. LPAR-23: 23rd International Conference on Logic for Programming, Artificial Intelligence and Reasoning},
  editor    = {Elvira Albert and Laura Kovacs},
  series    = {EPiC Series in Computing},
  volume    = {73},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/9Hcd},
  doi       = {10.29007/413d},
  pages     = {498-515},
  year      = {2020}}

Download PDF Open PDF in browser