## References

- [1] C# Language Specification, Version 5.0. 2015.
- [2] International Standard ISO/IEC 14882:2017(E) - Programming Language C++. 2017.
- [3] Kotlin Language Documentation, v. 1.2. 2018.
- [4] Moez A. AbdelGawad. A domain-theoretic model of nominally-typed object-oriented programming. Electronic Notes in Theoretical Computer Science (Full version preprint available at http://arxiv.org/abs/1801.06793), 301:3–19, 2014.
- [5] Moez A. AbdelGawad. Novel uses of category theory in modeling OOP (extended abstract). Accepted (but unpublished) at The Nordic Workshop on Programming Theory (NWPT’17), Turku, Finland (Full version preprint available at http://arxiv.org/abs/1709.08056), 2017.
- [6] Moez A. AbdelGawad. Towards a Java subtyping operad. Proceedings of FTfJP’17, Barcelona, Spain (Extended version preprint available at http://arxiv.org/abs/1706.00274), 2017.
- [7] Moez A. AbdelGawad. Doubly F-bounded generics. eprint available at http://arxiv.org/abs/1808.06052, 2018.
- [8] Moez A. AbdelGawad. Induction, coinduction, and fixed points: A concise comparative survey. eprint available at http://arxiv.org/abs/1812.10026, 2018.
- [9] Moez A. AbdelGawad. Java subtyping as an infinite self-similar partial graph product. eprint available at http://arxiv.org/abs/1805.06893, 2018.
- [10] Moez A. AbdelGawad. Partial Cartesian graph product. eprint available at http://arxiv.org/abs/1805.07155, 2018.
- [11] Moez A. AbdelGawad. Towards taming Java wildcards and extending Java with interval types. eprint available at http://arxiv.org/abs/1805.10931, 2018.
- [12] Moez A. AbdelGawad. Induction, coinduction, and fixed points in programming languages type theory. eprint available at http://arxiv.org/abs/1903.05126, 2019.
- [13] Moez A. AbdelGawad. Induction, coinduction, and fixed points: Intuitions and tutorial. eprint available at http://arxiv.org/abs/1903.05127, 2019.
- [14] Moez A. AbdelGawad. Mutual coinduction. eprint available at http://arxiv.org/abs/1903.06514, 2019.
- [15] Moez A. AbdelGawad. Using category theory in modeling generics in object-oriented programming (outline). eprint available at http://arxiv.org/abs/1905.xxxxx, 2019.
- [16] Gilad Bracha, Martin Odersky, David Stoutamire, and Philip Wadler. Making the future safe for the past: Adding genericity to the Java programming language. In Craig Chambers, editor, OOPSLA, volume 33, pages 183–200, Vancouver, BC, October 1998.
- [17] Nicholas Cameron, Sophia Drossopoulou, and Erik Ernst. A model for Java with wildcards. In ECOOP’08, 2008.
- [18] Nicholas Cameron, Erik Ernst, and Sophia Drossopoulou. Towards an existential types model for Java wildcards. FTfJP’07, 2007.
- [19] Robert Cartwright and Jr. Steele, Guy L. Compatible genericity with run-time types for the Java programming language. In Craig Chambers, editor, OOPSLA, volume 33, pages 201–215, Vancouver, BC, October 1998.
- [20] B. A. Davey and H. A. Priestley. Introduction to Lattices and Order. Cambridge University Press, 2nd edition, 2002.
- [21] Brendan Fong and David Spivak. Seven Sketches in Compositionality: An Invitation to Applied Category Theory. Draft, 2018.
- [22] James Gosling, Bill Joy, Guy Steele, and Gilad Bracha. The Java Language Specification. Addison-Wesley, 2005.
- [23] James Gosling, Bill Joy, Guy Steele, Gilad Bracha, Alex Buckley, and Daniel Smith. The Java Language Specification. Addison-Wesley, 2018.
- [24] Richard Hammack, Wilfried Imrich, and Sandi Klavzar. Handbook of Product Graphs. CRC Press, 2nd edition, 2011.
- [25] Dexter Kozen and Alexandra Silva. Practical coinduction. Mathematical Structures in Computer Science, 27(7):1132–1152, 2016.
- [26] Angelika Langer. The Java generics FAQ, 2015. http://www.angelikalanger.com/GenericsFAQ/JavaGenericsFAQ.html.
- [27] Robin Milner. A theory of type polymorphism in programming. Journal of Computer and System Sciences, 17:348–375, 1978.
- [28] Martin Odersky. The Scala language specification, v. 2.9, 2014.
- [29] Benjamin C. Pierce. Types and Programming Languages. MIT Press, 2002.
- [30] Hilary A. Priestley. Ordered sets and complete lattices: A primer for computer science. In Roy Crole Roland Backhouse and Jeremy Gibbons, editors, Algebraic and Coalgebraic Methods in the Mathematics of Program Construction, chapter 2, pages 21–78. Springer, 2002.
- [31] David Spivak. Category theory for the sciences. MIT Press, 2014.
- [32] Alexander J. Summers, Nicholas Cameron, Mariangiola Dezani-Ciancaglini, and Sophia Drossopoulou. Towards a semantic model for Java wildcards. FTfJP’10, 2010.
- [33] Ross Tate, Alan Leung, and Sorin Lerner. Taming wildcards in Java’s type system. PLDI’11, June 4–8, 2011, San Jose, California, USA., 2011.
- [34] Kresten Krab Thorup and Mads Torgersen. Unifying genericity. In ECOOP 99–Object-Oriented Programming, pages 186–204. Springer, 1999.
- [35] Mads Torgersen, Erik Ernst, and Christian Plesner Hansen. Wild FJ. In Foundations of Object-Oriented Languages, 2005.
- [36] Mads Torgersen, Christian Plesner Hansen, Erik Ernst, Peter von der Ahé, Gilad Bracha, and Neal Gafter. Adding wildcards to the Java programming language. In SAC, 2004.

Comments

There are no comments yet.