MODULARITY À LA ML
summary
Shows actual SML code: builds an Option type, a list-set functor parameterized by an ordering signature, then instantiates int and string sets and wires that into a toy Twitter followers method returning a path-dependent set type. Claims SML lacks modules not first-class (no passing or returning modules, no higher-order functors) and that Scala’s objects/traits emulate first-class modules and avoid those limits, tying functors to constructor-style dependency injection.
AI-written summary · about
chapters (9)
- 0:00Intro
- 6:03Modules
- 8:21Functors
- 18:03Similarities with Scala
- 21:35Code
- 23:27Twitter
- 27:20Dependent Types
- 27:52Other Differences
- 28:33Conclusion
related talks
48mObject Functional Programming
45mHow to be polymorphic in Scala
41mOn track with tracked
43mAdding kind-polymorphism to the Scala programming language
23mA Type Inferencer for ML in 200 Lines of Scala
39mA few tips on modelling things in Scala
26mUP YOUR MTL GAME WITH CLASSY OPTICS
49mTen Cool Things You Can Do With Scala 3