Encoding Monomorphic and Polymorphic Types
Paper i proceeding, 2013

Most 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. 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, and partly proved correct, in Isabelle/HOL. Our evaluation finds them vastly superior to previous schemes.

Författare

Jasmin Christian Blanchette

Technische Universität München

Sascha Böhme

Technische Universität München

Andrei Popescu

Technische Universität München

Nicholas Smallbone

Chalmers, Data- och informationsteknik, Programvaruteknik

Lecture Notes in Computer Science

0302-9743 (ISSN)

Vol. 7795 493-507

Ämneskategorier

Algebra och logik

Programvaruteknik

Styrkeområden

Informations- och kommunikationsteknik

Fundament

Grundläggande vetenskaper

DOI

10.1007/978-3-642-36742-7_34

ISBN

978-3-642-36741-0