Encoding Monomorphic and Polymorphic Types
Paper in proceedings, 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.

Author

Jasmin Christian Blanchette

Technical University of Munich

Sascha Böhme

Technical University of Munich

Andrei Popescu

Technical University of Munich

Nicholas Smallbone

Chalmers, Computer Science and Engineering (Chalmers), Software Technology (Chalmers)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

03029743 (ISSN) 16113349 (eISSN)

Vol. 7795 493-507

Subject Categories

Algebra and Logic

Software Engineering

Areas of Advance

Information and Communication Technology

Roots

Basic sciences

DOI

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

ISBN

978-3-642-36741-0

More information

Latest update

3/16/2018