Counterexamples in Type Systems - Counterexamples in Type Systems
Pangram verdict · v3.3
We believe that this document is fully human-written
AI likelihood · overall
HumanArticle text · 109 words · 1 segments analyzed
Counterexamples in Type SystemsIntroductionIndex and Glossary1. Polymorphic references2. Covariant containers3. Incomplete variance checking4. Objects under construction5. Curry's paradox6. Eventually, nothing7. Dubious evidence8. Some kinds of Anything9. Any (single) thing10. Mutable matching11. Runtime type misinformation12. Overloading and polymorphism13. Distinctness I: Injectivity14. Distinctness II: Recursion15. Distinctness III: Options16. Subtyping vs. inheritance17. Selfishness18. Privacy violation19. Unstable type expressions20. The avoidance problem21. A little knowledge...22. Underdetermined recursion23. Overdetermined recursion24. Scope escape25. Under false pretenses26. Suspicious subterms27. There's only one Leibniz28. Intersecting references29. Polymorphic union refinement30. Positivity, strict and otherwise31. 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