BibTeX
CSL-JSON
MLA
Harvard
A Mechanised Semantics for HOL with Ad-hoc Overloading
release_uz7qmnbbc5d2lbv5d2dzc7g5ne
by
Johannes Åman Pohjola, Arve Gengelbach
Released
as a article
.
2020
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.
In text/plain
format
Archived Files and Locations
application/pdf 321.4 kB
file_4aeynkxiszhphg6ewys6kligfu
|
arxiv.org (repository) web.archive.org (webarchive) |
Read Archived PDF
Preserved and Accessible
arXiv
2002.10212v2
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
access all versions, variants, and formats of this works (eg, pre-prints)
Cite This
Lookup Links