Opening Keynote
summary
Maps concrete parsing and edit problems onto algebraic structures between semigroups and groups, claiming inverse semigroup laws give useful normal forms. Builds a parenthesis counter as the bicyclic semigroup and uses foldMap parsing to check balance (it typechecks and works). Models edit-position mappings for LSP as partial bijections that compose as an inverse semigroup and provides a raw Haskell implementation used to speed up Haskell IDE work. Semi‑direct product result exists but lacks a practical use yet.
AI-written summary · about
chapters (5)
- 0:00Start
- 6:12Semi Lattice
- 30:10Language Server Protocol
- 30:37Haskell Osp Implementation
- 43:24Twisted Functors
related talks
42mMonoidal Parsing
12mOn the power of syntactic methods: It is all syntax after all…
27mHaskell equations, thirty-eight years later
58mKeynote: Why Functional Programming Matters
02h 50mIntro to Type Systems and Operational Semantics
27mFunctorial Semantics for Partial Theories
54mCategory Theory Through Functional Programming (part 3/3)
33mOptimising your code with math