Tony Morris
where else to find them
x:dibblego
what they talk about
all 9 in the filters
where they keep going back
- LambdaConf3 editions2017–2019
- Functional Conf3 editions2017–2025
all 4 in the filters
on a stage with
never shared a talk
who talks about the same things
- Pawel Szulc28 talks
- Alejandro Serrano Mena14 talks
- Adam McCullough6 talks
- Bartosz Milewski10 talks
- John Hughes15 talks
- Kevlin Henney95 talks
| title | conference | date |
|---|---|---|
| The Expression Problem, Generalised | Functional Conf 2025 | 2025-01-24 |
Wadler’s 1998 formulation (add new cases and new functions without touching old code) expands from sum types to records and nested structures, and the concrete… | ||
| Types and Property Tests for Software Resiliency | Agile India 2020 | 2020-10-11 |
Functional programming uses types to constrain behavior and tests to fill gaps: parametricity yields “free theorems” (a polymorphic a -> a has exactly one… | ||
| An Intuition for List Folds | Functional Conf 2019 | 2019-11-13 |
Defines a cons list as nil or cons and gives precise rules: left fold is a loop used for sum, product, length, reverse (linear time by flipping cons), and… | ||
| Zippers | Functional Conf 2019 | 2019-11-13 |
Explains concrete zipper shapes (for a list: left-list, focus, right-list; for a multiway tree: sibling lists, parent context, children) and shows zippers… | ||
| Zippers; The Theory and the Application | LambdaConf 2019 | 2019-06-05 |
Claims that every zipper is a comonad and that a zipper is the derivative of a data structure (McBride et al) get demonstrated with concrete encodings: a list… | ||
| Trees that Grow | LambdaConf 2019 | 2019-06-05 |
Claims that Trees That Grow (Najd, Shayan and Peyton‑Jones, Simon, 2016) let syntax trees extend without breaking callers, implemented with type families… | ||
| Introduction to FP Using Haskell (Part 2) | LambdaConf 2018 | 2018-06-03 |
Defines concrete algebraic types like OneOrTwo a, a recursive Natural and a custom List and shows actual GHCi commands (including :info) using Glasgow Haskell… | ||
| Introduction to FP Using Haskell (Part 1) | LambdaConf 2018 | 2018-06-03 |
Workshop promises concrete outcomes: install GHC 7.8+ and use GHCi reload to run examples, build small programs that demonstrate lambdas, polymorphic types… | ||
| An Intuition for List Folds | LambdaConf 2018 | 2018-06-03 |
Clear claim: fold left = a loop — it accumulates by iterating with an accumulator (examples in Haskell and C#: sum, product, length, reverse) and never… | ||
| Functional Programming in Aviation | Functional Conf 2017 | 2017-11-16 |
Shows concrete results: a Haskell logbook with lenses that compiles to PDF/HTML and lives in Git for audits, a weight‑and‑balance generator that produces… | ||
| Let's Lens - Part 1 of 5 | LambdaConf 2017 | 2017-05-25 |
History and exercises focus on concrete implementations: Haskell code in the linked repos (requires GHC 7.8), exercises for Lets.GetSetLens and the… | ||
| Let's Lens - Part 2 of 5 | LambdaConf 2017 | 2017-05-25 |
Part of a five‑part exercise series that uses the Haskell lens constructor pattern and the Lets.GetSetLens and Lets.Lens modules to derive getters setters and… | ||
| Let's Lens - Part 3 of 5 | LambdaConf 2017 | 2017-05-25 |
Let's Lens presents a sequence of hands-on exercises that derive lenses from the view-update problem of relational databases, cites Foster et al., and uses the… | ||
| Let's Lens - Part 4 of 5 | LambdaConf 2017 | 2017-05-25 |
Exercises build concrete lenses in Haskell (requires GHC 7.8+) and walk from simple get/set to modern constructions, using the Lets.GetSetLens and Lets.Lens`… | ||
| Let's Lens - Part 5 of 5 | LambdaConf 2017 | 2017-05-25 |
Series of lens exercises target the actual claims: building composable optics with the Haskell lens library and deriving lens structure from first principles… | ||
| Closing Keynote | DjangoCon AU 2014 | 2014-08-01 |
Claim: Python lacks the tools to get fast, reliable results that come from referential transparency and parametricity. Shows how a monad bind/unit abstraction… | ||
| nothing matches | ||