HTTP through Functional Programming
summary
Argument: functional techniques make HTTP behavior tractable by turning RFC prose into precise models. Evidence: an F# stack Freya encodes HTTP/1.1 as types and lenses so handlers produce only wellformed values; Haskell’s type-safe combinators and Servant give compile‑time API shapes; Erlang Webmachine models request handling as a state machine. Result: fewer ad hoc controllers, more provable responses, some projects succeed and others (actor RDF proofs) stall.
AI-written summary · about
chapters (8)
- 0:00Start
- 9:57HTTP
- 13:55WHERE ARE WE HEADING!
- 16:09COMPOSITION AS STANDARD
- 17:20TYPE SAFE VALUES
- 20:25TYPE SAFE COMBINATORS
- 21:24FUNCTIONAL MODELLING
- 25:01DEPENDENT TYPES
related talks
26mFunctional Programming for APIs
55m“Using Functional Programming Patterns..."
32mExtending your HTTP library with monad transformers
14mFundamentalist Functional Programming
58mKeynote: Why Functional Programming Matters
01h 00mFunctional-first programming with F#
44mFunctional Programming You Already Know
01h 06mThe Joy of Functional Programming
