A mechanised semantics for HOL with ad-hoc overloading
JÅ Pohjola, A Gengelbach - arXiv preprint arXiv:2002.10212, 2020 - arxiv.org
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 …
definitions---that is, one constant may have several definitions for non-overlapping types. In …
A formally verified checker for first-order proofs
S Baek - 12th International Conference on Interactive Theorem …, 2021 - drops.dagstuhl.de
Abstract The Verified TESC Verifier (VTV) is a formally verified checker for the new Theory-
Extensible Sequent Calculus (TESC) proof format for first-order ATPs. VTV accepts a TPTP …
Extensible Sequent Calculus (TESC) proof format for first-order ATPs. VTV accepts a TPTP …
Fast and Correct Round Elimination
J Saarhelo - 2022 - aaltodoc.aalto.fi
Round elimination is a process used to study the hardness of distributed graph problems. It
is available as a computer program. Optimizations to the program have permitted the study …
is available as a computer program. Optimizations to the program have permitted the study …