Doubly F-Bounded Generics
Abstract
In this paper we suggest how f-bounded generics in nominally-typed OOP can be extended to the more general notion we call `doubly f-bounded generics' and we suggest how doubly f-bounded generics can be reasoned about. We also (attempt to) prove, using a coinductive argument, that our reasoning method is mathematically sound.
- Publication:
-
arXiv e-prints
- Pub Date:
- August 2018
- DOI:
- 10.48550/arXiv.1808.06052
- arXiv:
- arXiv:1808.06052
- Bibcode:
- 2018arXiv180806052A
- Keywords:
-
- Computer Science - Programming Languages
- E-Print:
- 14 pages