Encoding monomorphic and polymorphic types

Blanchette, Jasmin, Böhme, Sascha, Popescu, Andrei and Smallbone, Nicholas (2017) Encoding monomorphic and polymorphic types. Logical Methods in Computer Science, 12 (4) . ISSN 1860-5974 [Article] (doi:10.2168/LMCS-12(4:13)2016)

Preview	PDF - Published version (with publisher's formatting) Available under License Creative Commons Attribution-NoDerivatives 4.0. Download (583kB) | Preview
	PDF - Final accepted version (with author's formatting) Restricted to Repository staff and depositor only Download (641kB)

Abstract

Many automatic theorem provers are restricted to untyped logics, and existing translations from typed logics are bulky or unsound. Recent research proposes monotonicity as a means to remove some clutter when translating monomorphic to un-typed first-order logic. Here we pursue this approach systematically, analysing formally a variety of encodings that further improve on efficiency while retaining soundness and completeness. We extend the approach to rank-1 polymorphism and present alternative schemes that lighten the translation of polymorphic symbols based on the novel notion of “cover”. The new encodings are implemented in Isabelle/HOL as part of the Sledgehammer tool. We include informal proofs of soundness and correctness, and have formalized the monomorphic part of this work in Isabelle/HOL. Our evaluation finds the new encodings vastly superior to previous schemes.

Actions (login required)

View Item

Statistics

DownloadsShow export options

Export as CSVXMLJSON

Activity Overview

6 month trend

230Downloads

6 month trend

372Hits

Additional statistics are available via IRStats2.