Type classes and overloading in higher-order logic (1997) [35 citations — 8 self]
Download:
|
|
by Markus Wenzel
Theorem Proving in Higher Order Logics: TPHOLs ’97, LNCS 1275
http://www4.informatik.tu-muenchen.de/papers/tphols97_wenzelm_1997_Publication.ps.gz
Add To MetaCart
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@INPROCEEDINGS{Wenzel97typeclasses,author = {Markus Wenzel},
title = {Type classes and overloading in higher-order logic},
booktitle = {Theorem Proving in Higher Order Logics: TPHOLs ’97, LNCS 1275},
year = {1997},
pages = {307--322},
publisher = {Springer}
}
Years of Citing Articles
Abstract:
Abstract Type classes and overloading are shown to be independent concepts that can both be added to simple higher-order logics in the tradition of Church and Gordon, without demanding more logical expressiveness. In particular, model-theoretic issues are not affected. Our metalogical results may serve as a foundation of systems like Isabelle/Pure that offer the user Haskell-style order-sorted polymorphism as an extended theories with a single carrier type and a fixed signature of operations. 1
