N.: Monotonicity or how to encode polymorphic types safely and efficiently
| Citations: | 3 - 2 self |
BibTeX
@MISC{Blanchette_n.:monotonicity,
author = {Jasmin Christian Blanchette and Sascha Böhme and Nicholas Smallbone},
title = {N.: Monotonicity or how to encode polymorphic types safely and efficiently},
year = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. Most automatic theorem provers are restricted to untyped or monomorphic logics, and existing translations from polymorphic logics are either bulky or unsound. Recent research shows how to exploit monotonicity to encode ground types efficiently: monotonic types can be safely erased, while nonmonotonic types must generally be encoded. We extend this work to rank-1 polymorphism and show how to eliminate even more clutter by also erasing most occurrences of nonmonotonic types, without sacrificing soundness or completeness. The new encodings are implemented in the Sledgehammer tool for Isabelle/HOL. Our evaluation finds them considerably superior to previous schemes. 1
