Java Generics: An Order-Theoretic Approach (Abridged Outline)
arXiv:1906.11197
Abstract
The mathematical modeling of generics in Java and other similar nominally-typed object-oriented programming languages is a challenge. In this short paper we present the outline of a novel order-theoretic approach to modeling generics, in which we also elementarily use some concepts and tools from category theory. We believe a combined order-theoretic and category-theoretic approach to modeling generics holds the keys to overcoming much of the adversity found when analyzing features of generic OO type systems.
arXiv comment5 pages excluding references. An abridged version of arXiv:1906.03937
References in corpus (8)
- Seven Sketches in Compositionality: An Invitation to Applied Category Theory
- Towards Taming Java Wildcards and Extending Java with Interval Types
- Java Subtyping as an Infinite Self-Similar Partial Graph Product
- Java Generics: An Order-Theoretic Approach (Detailed Outline)
- Induction, Coinduction, and Fixed Points: Intuitions and Tutorial
- Induction, Coinduction, and Fixed Points in PL Type Theory
- Doubly F-Bounded Generics
- Partial Cartesian Graph Product