Polymorphic+Typeclass Superposition
Keyword(s):
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.
1995 ◽
Vol 5
(1)
◽
pp. 1-35
◽
Keyword(s):
2000 ◽
Vol 11
(01)
◽
pp. 65-87
Keyword(s):
1983 ◽
pp. 179-190
◽
2012 ◽
Vol 6
(18)
◽
pp. 219-226
1996 ◽
Vol 6
(1)
◽
pp. 111-141
◽
Keyword(s):
Keyword(s):