Everything about Row polymorphism

🧭 Start here: a 6-step reading path

1. Read the overview: Row polymorphismA 5-minute orientation
2. Pick up a classic book: Real World HaskellThe most-reprinted book on the subject
3. Read the landmark paper: Crystal structures and polymorphism in compounds Bi6+xT1−xP2O15+y, T=first row transition metals and PbCited 13 times
4. Go sideways: Parametric polymorphismA closely related topic
5. Go sideways: Polymorphism (computer science)A closely related topic

🏆 Landmark papers (most cited)

• Crystal structures and polymorphism in compounds Bi6+xT1−xP2O15+y, T=first row transition metals and Pb

  Nachiappan Arumugam, Vincent Lynch, Hugo Steinfink · 2008 · Journal of Solid State Chemistry · 13 citations

• Correlations between microstructure of α‐row nuclei and polymorphism of shear‐induced iPP/carbon fiber cylindrite

  Jing Zhao, Jihai Zhang, Mengfan Jing · 2019 · Journal of Polymer Science Part B: Polymer Physics · 11 citations

• Revisiting Row Polymorphism for Set-Theoretic Types

  Mickaël Laurent, Pierre Donat-Bouillud, Filip Křikava · 2026 · Proceedings of the ACM on Programming Languages · 0 citations

📚 Books worth reading

• Real World HaskellBryan O'Sullivan, John Goerzen · 2008
• Murach's Python ProgrammingMichael Urban, Joel Murach · 2016
• Sex and destinyGermaine Greer · 1984

Ranked by number of editions on Open Library, a rough measure of how lasting a book is.

🔗 Related topics

• Parametric polymorphism In programming languages and type theory, parametric polymorphism allows a single piece of code to be given a "generic" type, using variables in place…
• Polymorphism (computer science) In programming language theory and type theory, polymorphism allows a value or variable to have more than one type and allows a given operation to be performed…
• Kind (type theory) In the area of mathematical logic and computer science known as type theory, a kind is the type of a type constructor or, less commonly, the type of a…
• Type class In computer science, a type class is a type system construct that supports ad hoc polymorphism in a programming language. This is achieved by adding constraints…
• ML (programming language) ML (Meta Language) is the metalanguage developed for the Edinburgh LCF theorem prover in the 1970s. It is an early statically typed, functional language…
• System F System F (also polymorphic lambda calculus or second-order lambda calculus) is a typed lambda calculus that introduces, to simply typed lambda calculus…
• Hindley–Milner type system A Hindley–Milner (HM) type system is a classical type system for the lambda calculus with parametric polymorphism. It is also known as Damas–Milner or…
• Polymorphic recursion In computer science, polymorphic recursion (also referred to as Milner–Mycroft typability or the Milner–Mycroft calculus) refers to a recursive parametrically…