Encoding monomorphic and polymorphic types
Artikel i vetenskaplig tidskrift, 2016

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 untyped 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 po lymorphism 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 formalised the monomorphic part of this work in Isabelle/HOL. Our evaluation finds the new encodings vastly superior to previous schemes.

Författare

Jasmin Christian Blanchette

Max Planck-institutet

Laboratoire Lorrain de Recherche en Informatique et ses Applications

Sascha Böhme

Technische Universität München

Andrei Popescu

Middlesex University

Nicholas Smallbone

Funktionell programmering

Logical Methods in Computer Science

1860-5974 (ISSN)

Vol. 12 4 13

Ämneskategorier

Algebra och logik

Språkteknologi (språkvetenskaplig databehandling)

Datavetenskap (datalogi)

DOI

10.2168/LMCS-12(4:13)2016