LambdaConf Winter Retreat 2017
2017-01-08..2017-01-11
Crested Butte, United States
as the organisers put it
The official repository for the LambdaConf 2017 Winter Retreat (January 8 - 12). - lambdaconf/winter-retreat-2017
| title | author | length |
|---|---|---|
| Applied category theory and abstract algebra | Gabriel Gonzales | 57m |
Claim: category theory and abstract algebra give concrete, reusable Haskell interfaces that simplify code and proofs. Examples include explicit monoid laws… | ||
| Beyond Free Monads | John DeGoes | 01h 14m |
Claim: free monads get deconstructed into primitives and rebuilt to add parallelism, racing, failure and alternation. Implementation shows concrete techniques… | ||
| Fun With Parsing | Daniel Spiewak | 58m |
Claims that derivative parsing lifts Brzozowski-style derivatives to context‑free grammars, uses laziness and memoization to avoid infinite recursion, and… | ||
| Distributed functional programming | David Greenberg | 01h 32m |
If you’re coming to the retreat, you probably are interested in FP, if not already a full-blown user of FP and its techniques. Unfortunately, when it comes… | ||
| Functional Programming and Polymorphism basics in Swift | TJ Usiyan | 52m |
Builds a working hex‑to‑base64 converter by chunking characters and mapping to code points, shows an iterative and a memoized generic factorial with discussion… | ||
| A Haskell Guide for Working Stiffs | Chris Allen | 01h 41m |
Claims a practical cookbook to get people reading real Haskell code and shows concrete examples: using aeson JSON AST and applicative parsers to decode/encode… | ||
| Category Theory Through Functional Programming (part 3/3) | Alejandro Serrano | 54m |
Covers concrete claims and examples: Yoneda lemma isomorphism between natural transformations and K C, the diagonal functor being left adjoint to product with… | ||
| Category Theory Through Functional Programming (part 2/3) | Alejandro Serrano | 56m |
Explains concrete equivalences and code-level shapes: the category of endofunctors is monoidal under composition with Identity as unit, monads are monoid… | ||
| Category Theory Through Functional Programming (part 1/3) | Alejandro Serrano | 52m |
A practical walk through category theory implemented in Haskell and Scala using real code that typechecks and illustrates concepts: categories encoded as types… | ||
| Agda from Nothing: Order in the Types | Scott Fleischman | 01h 47m |
Claims how to build binary search tree implementations in Agda that are correct-by-construction, following Conor McBride’s paper and using literate Agda (TeX)… | ||
| Functional Async on the JVM | Daniel Spiewak | 53m |
Claims a practical abstraction for async/parallel functional Scala on the JVM built as a monadic Task with now/delay/async that respects JVM constraints (no… | ||
| Theorem Proving in Coq using Tactics | Yawar Raza | 54m |
Claims and code show a machine-checked proof that the triangular sum equals n times (n+1) over 2 by defining Peano naturals and a recursive sum function and… | ||
| nothing matches | ||