Scale By The Bay 2018 Unconference: Gabriel Claramunt
summary
Library implements a generic fold over regular types in Scala by encoding constructors as small functors and a Fix-like wrapper, translating Haskell type-family machinery into hand-rolled type-class encoding. Examples show lists, binary and rose trees, and operations implemented once—sum, count, max, flatten, forall/exists—reused across types. Current limitations are lost type information, ugly casts and tricky implicits, and inability yet to represent some nested-parameter cases; next steps propose macros to generate the repetitive boilerplate.
AI-written summary · about
chapters (6)
related talks
01h 08mUnconference
24mLet the Scala compiler work for you
51mGoing bananas with recursion schemes for fixed point data types
01h 03mIntro to FP in Scala: Exploring a Toolbox for Solving Problems - Part 4 of 6
01h 02mPrinciples and tools to cleverly model your data in Scala
59mIntro to FP in Scala: Exploring a Toolbox for Solving Problems - Part 3 of 6
29mADVENTURES IN META-PROGRAMMING
42mPolymorphic Function Types in Scala 3