Type Classes and Overloading in Higher-Order Logic (1997)
Cached
Download Links
- [www4.in.tum.de]
- [www4.informatik.tu-muenchen.de]
- [www4.in.tum.de]
- [www4.informatik.tu-muenchen.de]
- [wwwbroy.informatik.tu-muenchen.de]
- CiteULike
- DBLP
Other Repositories/Bibliography
| Venue: | Theorem Proving in Higher Order Logics: TPHOLs ’97, LNCS 1275 |
| Citations: | 58 - 8 self |
BibTeX
@INPROCEEDINGS{Wenzel97typeclasses,
author = {Markus Wenzel and Technische Universität München},
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
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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 syntactic feature. The latter can be used to describe simple abstract theories with a single carrier type and a fixed signature of operations.
