Encoding Monomorphic and Polymorphic Types

  • Jasmin Christian Blanchette
  • Sascha Böhme
  • Andrei Popescu
  • Nicholas Smallbone
Conference paper

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

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7795)
Cite this paper as:
Blanchette J.C., Böhme S., Popescu A., Smallbone N. (2013) Encoding Monomorphic and Polymorphic Types. In: Piterman N., Smolka S.A. (eds) Tools and Algorithms for the Construction and Analysis of Systems. TACAS 2013. Lecture Notes in Computer Science, vol 7795. Springer, Berlin, Heidelberg

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Jasmin Christian Blanchette
    • 1
  • Sascha Böhme
    • 1
  • Andrei Popescu
    • 1
  • Nicholas Smallbone
    • 2
  1. 1.Fakultät für InformatikTechnische Universität MünchenGermany
  2. 2.Dept. of CSEChalmers University of TechnologyGothenburgSweden

Personalised recommendations