AI Chat AI Image Generator AI Video Text to Speech

A Mechanised Semantics for HOL with Ad-hoc Overloading

02/24/2020

∙

by Johannes Åman Pohjola, et al.

∙

∙

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.

Johannes Åman Pohjola
3 publications
Arve Gengelbach
2 publications

page 1

page 2

page 3

page 4

research

∙ 01/11/2021

Mechanisation of Model-theoretic Conservative Extension for HOL with Ad-hoc Overloading

Definitions of new symbols merely abbreviate expressions in logical fram...

0 Arve Gengelbach, et al. ∙

research

∙ 02/16/2022

A Survey of Ad Hoc Teamwork: Definitions, Methods, and Open Problems

Ad hoc teamwork is the well-established research problem of designing ag...

0 Reuth Mirsky, et al. ∙

research

∙ 12/08/2021

A Preamble Based MAC Mechanism in Ad-Hoc Network

In this paper, we propose a preamble based medium access control (P-MAC)...

0 Chenchao Shi, et al. ∙

research

∙ 02/04/2020

A reactive algorithm for deducing nodal forwarding behavior in a multihop ad-hoc wireless network in the presence of errors

novel algorithm is presented to deduce individual nodal forwarding behav...

0 Karol Rydzewski, et al. ∙

research

∙ 02/02/2022

Grammars for Free: Toward Grammar Inference for Ad Hoc Parsers

Ad hoc parsers are everywhere: they appear any time a string is split, l...

0 Michael Schröder, et al. ∙

research

∙ 09/15/2017

Certified Non-Confluence with ConCon 1.5

We present three methods to check CTRSs for non-confluence: (1) an ad ho...

0 Thomas Sternagel, et al. ∙

research

∙ 04/19/2023

An Exploratory Study of Ad Hoc Parsers in Python

Background: Ad hoc parsers are pieces of code that use common string fun...

0 Michael Schröder, et al. ∙