Polymorphic+Typeclass Superposition

15 pages•Published: July 5, 2015

Abstract

We present an extension of superposition that natively handles a polymorphic type system extended with type classes, thus eliminating the need for type encodings when used by an interactive theorem prover like Isabelle/HOL. We describe syntax, typing rules, semantics, the polymorphic superposition calculus and an evaluation on a problem set that is generated from Isabelle/HOL theories. Our evaluation shows that native polymorphic+typeclass performance compares favorably to monomorphisation, a highly efficient but incomplete way of dealing with polymorphism.

Keyphrases: polymorphism, superposition, theorem proving

In: Stephan Schulz, Leonardo De Moura and Boris Konev (editors). PAAR-2014. 4th Workshop on Practical Aspects of Automated Reasoning, vol 31, pages 105-119.

Links:	https://easychair.org/publications/paper/Gvlb
	https://doi.org/10.29007/8v2f

BibTeX entry

@inproceedings{PAAR-2014:Polymorphic+Typeclass_Superposition,
  author    = {Daniel Wand},
  title     = {Polymorphic+Typeclass Superposition},
  booktitle = {PAAR-2014. 4th Workshop on Practical Aspects of Automated Reasoning},
  editor    = {Stephan Schulz and Leonardo De Moura and Boris Konev},
  series    = {EPiC Series in Computing},
  volume    = {31},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/Gvlb},
  doi       = {10.29007/8v2f},
  pages     = {105-119},
  year      = {2015}}

Download PDF Open PDF in browser