Skip to content
Back
Theme
Counterexamples in Type Systems - Counterexamples in Type Systems
1 min read
Original article ↗
Counterexamples in Type Systems
Introduction
Index and Glossary
1.
Polymorphic references
2.
Covariant containers
3.
Incomplete variance checking
4.
Objects under construction
5.
Curry's paradox
6.
Eventually, nothing
7.
Dubious evidence
8.
Some kinds of Anything
9.
Any (single) thing
10.
Mutable matching
11.
Runtime type misinformation
12.
Overloading and polymorphism
13.
Distinctness I: Injectivity
14.
Distinctness II: Recursion
15.
Distinctness III: Options
16.
Subtyping vs. inheritance
17.
Selfishness
18.
Privacy violation
19.
Unstable type expressions
20.
The avoidance problem
21.
A little knowledge...
22.
Underdetermined recursion
23.
Overdetermined recursion
24.
Scope escape
25.
Under false pretenses
26.
Suspicious subterms
27.
There's only one Leibniz
28.
Intersecting references
29.
Polymorphic union refinement
30.
Positivity, strict and otherwise
31.
Nearly-universal quantification
Counterexamples in Type Systems
Counterexamples in Type Systems
collated by Stephen Dolan, with thanks to Andrej Bauer, Leo White and Jeremy Yallop