Functional Architecture is Algebraic Architecture
summary
Claim: functional architecture equals algebraic architecture — systems become describable as applicative expressions whose typeclass laws enumerate design choices. Evidence: a Haskell paper by Simon Peyton Jones and Neil Mitchell models build systems by varying a Task as Functor/Applicative/Monad to map existing build systems onto an algebraic space. Attempts here apply that idea to GHC layers (parser, renamer), probe simple components (cat’s identity/involutive/cyclic properties) and an 8086 simulator; work is speculative and unfinished but suggests LLMs can synthesize component variants from algebraic specs.
AI-written summary · about
chapters (5)
- 0:00Introduction
- 1:03Functional architecture as algebra
- 4:16Programs to systems via applicative expressions
- 9:11Algebra in compiler components
- 14:12Why functional architecture matters
related talks
24mWhat could Functional Architecture mean?
34mPatterns of a pragmatic functional architecture
49mApproaching Functional Programming Through Hexagonal Architecture
46mAlgebraic Thinking for evolution of pure functional domain models
20mOn the paradigm of functional programming
52mFunctional Patterns in Domain Modeling
54mCategory Theory Through Functional Programming (part 3/3)
45mFunctional Programming in the Large - Status and Perspective