LambdaConf 2017
2017-05-25..2017-05-27
Boulder, United States
[LambdaConf 2015, LambdaConf 2017, LambdaConf 2018, LambdaConf 2019, LambdaConf 2020 Global Edition, LambdaConf 2024, LambdaConf 2025]
| title | author | length |
|---|---|---|
| Category Theory - Part 1 of 6 | David Spivak | 01h 01m |
Course introduces concrete definitions and verifies the claims: sets and functions, identity, initial/terminal objects, universal property axiomatizes… | ||
| Why Johnny Can't Code Good | Chris Allen | 48m |
Claims that training and publishing are broken and that many programmers only know enough to finish tickets, not to innovate. Evidence: 30–40 applicants only… | ||
| Lambda Calculus For People Who Can't Be Bothered to Learn It - part 1 of 2 | Steven Syrek | 59m |
Builds a working lambda calculus inside the browser: uses ES6 arrow functions and a few translation helpers to encode booleans, Church numerals, arithmetic… | ||
| Greek Classics: Lambda Calculus For Beginners | Adam McCullough | 51m |
Starts from the identity function and shows concrete reductions step by step, demonstrating beta reduction and where substitution terminates or diverges (Omega… | ||
| Category Theory - Part 2 of 6 | David Spivak | 01h 01m |
Explains why Universal Properties, not implementations, uniquely characterize constructions: shows how an evaluation map EV and the exponential object are… | ||
| Theory and Models of Lambda Calculus Untyped and Typed - Part 1 of 5 | Dana Scott | 01h 00m |
History ties Church and Curry to later work while a hands‑on session uses Mathematica rewrite rules to test combinators, demonstrating concrete reductions like… | ||
| Web Programming and Streaming Data in Haskell - Part 1 of 2 | Michael Snoyman | 59m |
Part one stays concrete: it covers the Conduit library and shows runnable examples (use Stack and the slides URL). Demonstrations include a pure sum, a file… | ||
| What are Dependent Types | Stephan Boyer | 11m |
Claims that dependent types can encode arbitrary mathematical propositions and that a type checker enforces those properties statically. Demonstrations include… | ||
| Category Theory - Part 3 of 6 | David Spivak | 55m |
Covers concrete claims and examples: functors preserve identities and composition and can go between different categories; monoids model as one‑object… | ||
| Category Theory - Part 4 of 6 | David Spivak | 01h 00m |
Part 4 gives concrete translations rather than abstract slogans: it shows functors to Set as databases by writing the tables for vertices and arrows, proves… | ||
| Neural Networks are Programs, Too | Marisa Kirisame | 37m |
Claims neural networks are programs so functional techniques (Finally Tagless, Haskell types) yield automatic differentiation by dual numbers, a DSL that… | ||
| How to Program like a Five Year Old in Haskell | Jason Adaska | 17m |
Claims that Haskell plus logic programming can auto-assemble programs by treating arrows as puzzle pieces and using backtracking to search trees of… | ||
| I Command You to be Free! | Matt Parsons | 57m |
Refactors a side‑effecting PHP/Ruby codebase into explicit command values, then interpreters and finally the Free monad; examples use Ruby, Haskell, PHP… | ||
| Category Theory - Part 5 of 6 | David Spivak | 01h 00m |
Clear statement: adjunctions produce concrete maps (unit and counit) and give monads; demonstrated with concrete examples and constructions, not only words… | ||
| The Axes of Abstraction | Paul Phillips | 47m |
Claim: formal concept analysis finds the places where extent equals intent so abstractions and generalizations converge, turning ad hoc subtype debates into… | ||
| The Hidden Costs of Fear and How to Get a Better Deal | Edward Latimore | 28m |
Claim: fear skewers choices by imagining worst-case outcomes and inflating opportunity cost, so people skip growth. Offers concrete tools: reframe opportunity… | ||
| Let's Lens - Part 1 of 5 | Tony Morris | 01h 01m |
History and exercises focus on concrete implementations: Haskell code in the linked repos (requires GHC 7.8), exercises for Lets.GetSetLens and the… | ||
| Mercury: An Odd Amalgam of Haskell and Prolog - Part 1 of 2 | Alex Feldman-Crough | 59m |
Shows Mercury as a concrete language that mixes Haskell-style strong types with Prolog-style rules, implementing an HTTP 1.0 parser and a fizzbuzz example to… | ||
| Some1 Like You Dependent Pairs in Haskell | Sandy Maguire | 49m |
Builds a JSON ingest pipeline where a URL-supplied event tag determines the payload type at runtime and uses type‑level machinery so the compiler enforces… | ||
| Category Theory - Part 6 of 6 | David Spivak | 59m |
Defines Galois connections concretely: image and preimage forming a Galois connection for powersets. Shows adjunctions produce monads (unit and mu given by… | ||
| Web Programming and Streaming Data in Haskell - Part 2 of 2 | Michael Snoyman | 01h 01m |
Conduit claims practical streaming but is coroutine based so Conduit is single-threaded and requires explicit concurrency — use async + STM for concurrent… | ||
| One Year In: A Beginner's Take on the Difficulties of Learning Haskell | Jake Keuhlen | 14m |
One year of learning Haskell leads to concrete outcomes not platitudes: an API translation layer is built to bridge an archaic DMS by reverse‑engineering SOAP… | ||
| Corecursion, Codata, and Just a Little Combinatorial Game Theory | Carlos Rodrigues | 46m |
Claims that top-down recursion converts to bottom-up behaviour by using corecursive streams and infinite codata trees implemented in Haskell (Prelude functions… | ||
| Theory and Models of Lambda Calculus Untyped and Typed - Part 2 of 5 | Dana Scott | 01h 00m |
Concrete claims and artifacts: an algorithm that converts lambda abstractions into S and K combinators, worked examples and a Mathematica notebook with tests… | ||
| Adjunctions in Everyday Life | Rúnar Bjarnason | 52m |
Claim: adjunctions are the concrete pattern behind monads, comonads, products, coproducts, ADTs and folds; the talk shows how to witness adjunctions via… | ||
| Algebraic Databases | Ryan Wisnesky | 57m |
Claim: schemas are categories and schema mappings are functors, which give three concrete data migrations Delta/Pi/Sigma that implement projection product and… | ||
| Intro to FP in Scala: Exploring a Toolbox for Solving Problems - Part 1 of 6 | Pawel Szulc | 01h 00m |
Promises a practical FP bootstrap in Scala: concrete claim is teaching how to solve real problems by wiring up immutable code into runnable apps, using SBT and… | ||
| Integrating Purescript and Halogen into Javascript Apps - Part 1 of 6 | Hardy Jones | 53m |
Live coding shows taking a React/Redux shopping cart and gradually replacing parts with PureScript and Halogen, demonstrating JS interop, build steps… | ||
| Principles of Clean Functional Programming | Karl Bielefeldt | 47m |
Practical rules and concrete examples show how to make functional code easier to read: prefer small named functions, factor out repetition, isolate IO and keep… | ||
| Routing With Cofree Comonad | Marcin Szamotulski | 45m |
Claims a practical encoding of routing with the Cofree comonad mapping route trees to React component mounts, implements a library that parses URLs into cofree… | ||
| Froid: Functional Programming on Android | Michael Chavinda | 58m |
Claim: a library called Froid lets Android apps be written in Frege and compiles Frege to Java, with a Gradle step that produces usual APKs. Tools actually… | ||
| Lambda Calculus For People Who Can't Be Bothered to Learn It - part 2 of 2 | Steven Syrek | 01h 03m |
Hands-on coding that actually builds an untyped lambda calculus in the browser using ES6 arrow functions and small translation utilities, with concrete claims… | ||
| Functional Array Funhouse Intensive - Part 1 of 5 | Aaron W Hsu | 44m |
Makes concrete claims of order‑of‑magnitude code reduction and speedup and actually shows the workflow that produces them: an interactive APL session that… | ||
| Refactoring Recursion | Harold Carr | 01h 03m |
Claim: recursion schemes specialized to List let you refactor recursion out of functions without needing Fix for most cases. Demonstrations use concrete tools… | ||
| The Power of Optics | Joshua Grosso | 13m |
Shows concrete Haskell code using the Haskell lens package and Template Haskell-generated makeLenses to get, set and modify deeply nested records, plus… | ||
| Less is More with MonadReader | Sukant Hajra | 15m |
Claims that MTL is often overused and shows how to replicate MTL-style constraints without pulling in MTL by using small, domain-specific typeclasses and… | ||
| Singletons and You in Haskell | Justin Le | 12m |
Shows how Richard Eisenberg's singletons library actually gives runtime witnesses so type-level states become usable values, illustrated by a GADT Door state… | ||
| Theory and Models of Lambda Calculus Untyped and Typed - Part 3 of 5 | Dana Scott | 01h 00m |
Part 3 lays out concrete constructions and results: lambda abstraction is realized as the largest lookup table that reproduces a continuous operator; pure… | ||
| Introduction to Coq - Part 1 of 2 | Gabriel Claramunt | 01h 00m |
Hands-on walkthrough of Coq that actually builds proofs: uses intro/apply/assumption tactics plus elimination, cut, exact and unfold; loads examples from a… | ||
| How to Build a Blog in 10 Minutes with Hyper | Hardy Jones | 11m |
Build claim: a minimal blog implemented with Hyper in PureScript using a Postgres connection pool, type-level routes and a scaffolded CRUD API. Code shows… | ||
| Building a Blogging System with Haskell and Yesod - Part 1 of 6 | Gavin Whelan | 59m |
Part one of a six‑part workshop shows building the core of a blogging system: Haskell with the Yesod web framework, using Warp/dev server, Template Haskell and… | ||
| Functional Infrastructure With Nix - Part 1 of 2 | James Earl Douglas | 58m |
Workshop teaches actual Nix tooling and shows concrete results: uses Nix, NixOS, NixOps to write expressions, build derivations, run nix-shell and nix-build… | ||
| Using PL Theory to Make People Happier | Sig Cox | 39m |
Argues that treating interfaces as languages yields concrete fixes: an accidental JSON command language is boxed away into a single interpreter, stripped of… | ||
| Variables in Haskell | Alejandro Serrano Mena | 53m |
Survey of concrete mutable options: IORef/STRef for scoped mutation (runST types prevent escape), MVar semantics for take/read based synchronization and simple… | ||
| Enhancing your Haskell with Dependently Typed Programming | Justin Le | 48m |
Dependently-typed Haskell is used to build a neural‑network implementation whose linear algebra stays identical but whose dimension mismatches move from… | ||
| Computing From Creationism to Evolutionism | François René Rideau | 56m |
Argues software origin stories range from instant creationism (pen‑and‑paper one‑liners, assembler) through intelligent design (waterfall, flowcharts, layered… | ||
| The Origins of Free | Adam Warski | 53m |
Starts from universal algebra and proves the concrete claim that the usual Free Monad is the term algebra made initial then quotiented by laws: build term… | ||
| Big Data Pipelines With Scala - Part 1 of 2 | Gleb Kanterov | 01h 03m |
Claim: Spotify processes many terabytes of data per day and builds a Scala layer, Scio: a Scala API for Apache Beam, to express pipelines. Tools actually used… | ||
| Theory and Models of Lambda Calculus Untyped and Typed - Part 4 of 5 | Dana Scott | 01h 02m |
Constructs models inside P(N) using enumeration operators and least fixed points to show that closure operators form a cartesian closed category and that… | ||
| Intro to FP in Scala: Exploring a Toolbox for Solving Problems - Part 2 of 6 | Pawel Szulc | 01h 00m |
Workshop claims to turn Scala features into a concrete toolbox: live builds of a lazy future style Task, a type class for Show and Equals, and companion-object… | ||
| Statically Typed Interpreters | Christopher Hockenbrocht | 33m |
Builds a statically typed interpreter in Haskell and claims it prevents runtime type errors by moving checks into the compiler stage, using GADTs, existential… | ||
| Generative Design with Scala.js | Fred Cecilia | 10m |
A typed Scala.js wrapper for P5.js called P5.scala brings Processing-style visuals into a functional Scala workflow, with concrete examples that turn MIDI… | ||
| Typed Ontology in Applications | Arseniy Zhizhelev | 19m |
Claims that modeling with typed property identifiers replaces sprawling case class sets and yields a single domain language across layers. Implements… | ||
| Integrating Purescript and Halogen into Javascript Apps - Part 2 of 6 | Hardy Jones | 53m |
Walks through an actual JavaScript app being incrementally replaced with PureScript and Halogen, showing concrete code changes: new action types, reducers… | ||
| Carpenters and Cartographers | Valentin Kasas | 11m |
Argues two concrete cognitive modes — carpenter mindset and cartographer mindset — and claims the right order matters: first map the domain by discovering… | ||
| Mighty Morphin Data Types | David Koontz | 48m |
Gentle, example-rich survey that names and types specific morphisms and shows how they appear in code: map/filter/fold as canonical homomorphisms and monadic… | ||
| Higher order Abstractions | Stephan Boyer | 11m |
Defines and compares concrete Haskell type class implementations: Contravariant contramap :: (a -> b) -> f b -> f a with Predicate and function examples… | ||
| Integrating Purescript and Halogen into Javascript Apps - Part 4 of 6 | Hardy Jones | 01h 00m |
Builds a PureScript module product that exposes a formatting function compiled to CommonJS and called from React JavaScript. Shows concrete fixes: guard null… | ||
| Theory and Models of Lambda Calculus Untyped and Typed - Part 5 of 5 | Dana Scott | 33m |
Shows how untyped lambda over PERs and the power set of N with Scott topology produce models of dependent and polymorphic type theory, giving a local cartesian… | ||
| Integrating Purescript and Halogen into Javascript Apps - Part 5 of 6 | Hardy Jones | 50m |
PureScript and Halogen get pragmatically applied to an existing JavaScript app: actual steps include exporting a logPrice returns an F you must invoke to run… | ||
| Plan to Throw the First One Away | Meredith L. Patterson | 55m |
Argues for planning to toss the prototype and shows what that means: a working Android prototype built with Java, Python Flask backend and Odoo, an emulated… | ||
| Integrating Purescript and Halogen into Javascript Apps - Part 3 of 6 | Hardy Jones | 54m |
Shows an incremental migration: pull a JS app into PureScript + Halogen, install purescript, pulp, bower, psc-ide and add npm scripts, compile into a specific… | ||
| Mercury: An Odd Amalgam of Haskell and Prolog - Part 2 of 2 | Alex Feldman-Crough | 01h 01m |
Claims a working HTTP 1.0 parser written in Mercury that demonstrates Prolog-style unification and determinism annotations, implemented via strict accumulators… | ||
| Clojure.spec: A Lisp Flavoured Type System | Simon Belak | 13m |
Claim: spec turns Clojure into a runtime-first type system, weaving regular-expression-like specs over arbitrary data with parsing with derivatives and… | ||
| A Better REST with Type level Programming in Scala | Joseph Abrahamson | 58m |
Library called Maya (Scala and Scala.js) embeds a type-level DSL so API shape, arguments, local errors and multiplicities live in the Scala type system; a… | ||
| Graphics Programming with LambdaCube 3D - Part 1 of 2 | Csaba Hruska | 58m |
Course claims a working purely functional GPU pipeline and shows a live build of a simple 3D game: meshes and textures (obj, MTL, PNG) get OBJ to GPU upload, a… | ||
| Intuitionistic Logic III Subschemas and Topologies | Vlad Patryshev | 55m |
Explains how Grothendieck topologies are implemented as closure operations on the subobject classifier Omega and uses small categories/diagrams as concrete… | ||
| What Orwell's 1984 Can Teach Us About Programming | Daniel Beskin | 51m |
Claim: Orwell’s three slogans map to concrete strongly typed functional techniques and the examples actually work. The talk defines precise types to fight… | ||
| a Guided Introduction to Elixir - Part 1 of 6 | Aldric Giacomoni | 50m |
Claim: get a runnable Elixir baseline fast and learn the concrete quirks that bite you. Uses IEx REPL, classroom web IDE (a token and a $5 signup shows up) and… | ||
| Intro to FP in Scala: Exploring a Toolbox for Solving Problems - Part 6 of 6 | Pawel Szulc | 37m |
Shows building concrete Scala DSLs with Free monads, composing algebras via coproducts and injecting them so higher-level verbs stay pure, then writing… | ||
| Codecs and Funny Looking Functors | Vincent Marquez | 46m |
Uses scodec to build actual encoders/decoders: shows the greedy-string problem, implements a size‑prefixed (var) encoder over bitvectors and Attempt results… | ||
| Functional Array Funhouse Intensive - Part 2 of 5 | Aaron W Hsu | 58m |
Claims that Iverson-style array programming yields order-of-magnitude code shrink and speedups, demonstrates APL primitives (iota, reshape, inner/outer… | ||
| Intro to FP in Scala: Exploring a Toolbox for Solving Problems - Part 4 of 6 | Pawel Szulc | 01h 03m |
Shows live Scala code proving how generic type classes solve concrete problems: implements folding with Foldable/foldMap and monoids to avoid ad hoc zeros… | ||
| Intro to FP in Scala: Exploring a Toolbox for Solving Problems - Part 3 of 6 | Pawel Szulc | 59m |
Series workshop dives into Scala type classes and shows concrete code that compiles: generic Functor → map lets a length function work over Option Task or… | ||
| Let's Lens - Part 2 of 5 | Tony Morris | 57m |
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… | ||
| Software Enginnering: The Genesis | Pawel Szulc | 14m |
The term originates at the 1968 NATO conference and the original transcript shows concrete claims: design with testing interlaced — essentially test-driven… | ||
| Integrating Purescript and Halogen into Javascript Apps - Part 6 of 6 | Hardy Jones | 47m |
Shows incremental replacement of a JavaScript React UI with PureScript and Halogen, actually implementing a Halogen product component with a concrete state… | ||
| Deforestation and Program Fusion | Ryan Orendorff | 55m |
Explains how GHC uses rewrite rules to eliminate intermediate lists so high‑level code runs like hand‑tuned loops: foldr/build fusion turns map+sum into a… | ||
| Better Stories, Better Software | François René Rideau | 16m |
Argues that which story a project adopts changes outcomes: claiming free/open source versus proprietary yields different bugs usability privacy profiles and… | ||
| Building a Blogging System with Haskell and Yesod - Part 6 of 6 | Gavin Whelan | 51m |
Workshop finishes a functioning blog: form handling with generateFormPost/runFormPost producing widgets and validation, CSRF protection via a rotating CSRF… | ||
| Contextual: Enhancing Scala with Your Own Compile-time Checks | Jon Pretty | 58m |
Contextual is an open-source Scala library that makes interpolated strings subject to compile-time interpolation checks by running a macro that validates… | ||
| Type Inference in GHC | Alejandro Serrano Mena | 01h 02m |
GHC performs type inference in two phases: gathering then solving — it traverses code to emit a set of typed equations and class constraints, then runs a… | ||
| Algebraic Data Types for C# | John Azariah | 54m |
Explains how to get true immutable algebraic data types into C# by defining a tiny DSL files embedded in project then turning that AST into real C# via Roslyn… | ||
| Towards the Next Great Language | Jim Duey | 55m |
Progress report on Toccata with concrete results not promises: the repo now builds a minimal HelloWorld and the compiler compiles to C and LLVM, the demo shows… | ||
| A Functional Programming Approach to Data Processing in Python - 1 of 2 | Reuben Cummings | 54m |
Claims a lightweight, functional alternative to Pandas and shows concrete code that lazily parses and processes real GitHub JSON results. Uses urllib/json… | ||
| Functional Infrastructure With Nix - Part 2 of 2 | James Earl Douglas | 56m |
Walks through building a Haskell JSON API with Nix, packaging it as a Nix derivation, and using NixOS + NixOps to provision t2.nano EC2 instances, configure… | ||
| Intro to FP in Scala: Exploring a Toolbox for Solving Problems - Part 5 of 6 | Pawel Szulc | 38m |
Part of a hands‑on Scala FP workshop that implements a concrete solution: state monad implemented from scratch and then used to replace hand‑rolled s -> (s, A)… | ||
| Jump starting Your Elm Skills - Part 1 of 2 | Murphy Randle | 01h 01m |
Builds a tiny shop called HipStore end-to-end: uses create‑elm‑app and elm, a custom hipster-ui package, the remote-data pattern and HTTP commands to GET… | ||
| Hands on With Recursion Schemes - Part 1 of 2 | Jean Rémi Desjardins | 47m |
Workshop turns an AST into a parametric functor and actually wires it to recursion schemes: functor-ise the AST, use Fix (fixed point) and cata and its monadic… | ||
| Bringing Functional Programming to Work | Brooklyn Zelenka, Xavier Perez | 43m |
Advocates run workshops, reading groups and structured lessons and insist exercises are mandatory; curriculum size, frequency, TAs and homework policy… | ||
| Functional Array Funhouse Intensive - Part 3 of 5 | Aaron W Hsu | 02h 50m |
Claim: Iverson-style array programming shrinks codebases and speeds execution by an order of magnitude, demonstrated by a compiled APL-like system that targets… | ||
| When Does a Program Typecheck? | Esther Wang | 10m |
Formalizes when an expression typechecks by writing down simply typed lambda calculus syntax, typing judgments and the three concrete rules: variable… | ||
| Transient: Unrestricted Algebraic and Monadic Composability | Alberto Gómez Corona | 01h 06m |
Claims a set of concrete Haskell primitives that make effects composable across events, blocking I/O and distributed nodes and demonstrates them with live… | ||
| On State | Sean Williams | 35m |
Shows a mechanical adder and multiplier and a Castell slide rule that work as analog devices, demonstrates a voltmeter-as-computer and explains delay lines and… | ||
| The Noobs and the Programmers: On Teaching Programming | Nikola Adamus | 08m |
Begins from concrete claims: novices get stuck on vocabulary and on choosing resources so don’t say “just Google” or point to Stack Overflow links… | ||
| Building a Blogging System with Haskell and Yesod - Part 2 of 6 | Gavin Whelan | 55m |
Part of a six‑session workshop that actually builds a blogging system with Haskell and Yesod: concrete work on Yesod’s widgets compose HTML CSS JS, turning… | ||
| Your Brain, On Programming | Angela May O'Connor | 36m |
fMRI work from 2014 shows reading small Java snippets activates frontal/parietal areas 6 and 40 plus classical language regions 44, 21, 47 (comprehension minus… | ||
| Formally Specified Digital Logic for Pervasively Reconfigurable Computing | James Torre | 53m |
Formal spec of a proposed reversible asynchronous universal cell is given in TLA+ with a translated, verified simulation in miniKanren translation, and the… | ||
| Introduction to Coq - Part 2 of 2 | Gabriel Claramunt | 01h 02m |
Continues a hands‑on Coq workshop that shows actual proofs, tactics and extracted code: step‑by‑step proofs use intro apply exact split induction on encoded… | ||
| Introduction to Property Testing in Javascript | Michael Ficarra | 13m |
Introduces concrete property testing for JavaScript with examples: GenTest as the library, sampling integers and arrays to check determinism and round‑trip… | ||
| Let's Lens - Part 3 of 5 | Tony Morris | 01h 01m |
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… | ||
| Lambda Core: Hardcore | Jarek Ratajski | 13m |
Description:
You all use lambda expressions. But what does “lambda” mean? Let’s see what the untyped lambda calculus looks like in… | ||
| Functional Array Funhouse Intensive - Part 5 of 5 | Aaron W Hsu | 44m |
Demonstrates an APL/Dialog array programming workflow with a working compiler that emits CPU and GPU code, shows function trains as the primary notation… | ||
| Building a Blogging System with Haskell and Yesod - Part 5 of 6 | Gavin Whelan | 01h 03m |
Part of a hands‑on series that actually builds a blogging system with Haskell and Yesod, this session shows concrete code: routing and subsite wiring, the… | ||
| A Scientist's Guide to the Relational Data Model | Jon Woodring | 58m |
Practical claim: expose custom scientific files as SQLite virtual table so tools like Python R Paraview and ggplot can query without copying. Implements a C… | ||
| Let's Lens - Part 4 of 5 | Tony Morris | 57m |
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`… | ||
| A Functional Programming Approach to Data Processing in Python - 2 of 2 | Reuben Cummings | 40m |
Shows a concrete pipeline that reads GitHub JSON (and CSV/HTML), uses meza readers like read_json and join, cleans with fill_empty and flattens nested owner… | ||
| Big Data Pipelines With Scala - Part 2 of 2 | Gleb Kanterov | 57m |
Spotify processes many terabytes a day and uses Scio Scala API for Apache Beam to build pipelines that run on the Google Cloud Dataflow runner. The repo shows… | ||
| Functional Array Funhouse Intensive - Part 4 of 5 | Aaron W Hsu | 47m |
Shows a working APL-based compiler and ecosystem called Cody funds (about 1.5k LOC) that compiles defunds APL to C/C++/OpenCL/CUDA and targets GPUs or CPUs… | ||
| Graphics Programming with LambdaCube 3D - Part 2 of 2 | Csaba Hruska | 59m |
Uses LambdaCube 3D to build a working purely functional GPU pipeline: a simple 3D game with asteroid pool instancing (software pool, not hardware instancing)… | ||
| Building a Blogging System with Haskell and Yesod - Part 4 of 6 | Gavin Whelan | 55m |
Hands‑on build of a blogging system that actually wires post authoring, commenting, a JSON API and persistent storage using Haskell and Yesod; demonstrates… | ||
| Building a Blogging System with Haskell and Yesod - Part 3 of 6 | Gavin Whelan | 58m |
Continues the hands‑on build of a Yesod blog using Haskell: shows concrete code for the foundation datatype and keeping global state, splitting handlers into… | ||
| Let's Lens - Part 5 of 5 | Tony Morris | 01h 01m |
Series of lens exercises target the actual claims: building composable optics with the Haskell lens library and deriving lens structure from first principles… | ||
| Jump starting Your Elm Skills - Part 2 of 2 | Murphy Randle | 01h 04m |
Covers building a small Elm web app: sending a POST request with credentials and decoding JSON cart contents (a list of products), wiring the UI to fire… | ||
| Hands on With Recursion Schemes - Part 2 of 2 | Jean Rémi Desjardins | 55m |
Live coding shows Scala + Matryoshka recursion schemes producing working results: an eval algebra yields Either division‑by‑zero or Int and evaluates to 7 then… | ||
| How to Write a Successful Conference Proposal | Steven Syrek | 01h 07m |
The committee actually edits hundreds of submissions (about 150 were copyedited) and fills roughly 40 slots across formats — six‑hour and two‑hour workshops… | ||
| Reprogramming Biology | Colin Gravill | 48m |
Argues that biology is being treated as a programmable fabric and shows concrete tools: DNA strand displacement circuits implemented as NAND gates and a… | ||
| a Guided Introduction to Elixir - Part 3 of 6 | Aldric Giacomoni | 53m |
Guided code shows a concrete rock-paper-scissors exercise implemented with a map-based rule set and a simple REPL demo that actually prints results. The… | ||
| a Guided Introduction to Elixir - Part 6 of 6 | Aldric Giacomoni | 51m |
A guided walk-through of a real Elixir side project: code for an umbrella app using Phoenix, Ecto and GenServer/Registry pubsub to run a tiny distributed MUD… | ||
| a Guided Introduction to Elixir - Part 2 of 6 | Aldric Giacomoni | 57m |
Covers concrete Elixir mechanics: pattern matching with = and ^ and tuple return dispatch, function clauses by arity and anonymous multi-clause functions… | ||
| a Guided Introduction to Elixir - Part 4 of 6 | Aldric Giacomoni | 01h 01m |
Walks through building a real parallel map and shows parallel_map using spawn+refs and why ordering and mailbox scanning matter, demonstrates that htop reveals… | ||
| a Guided Introduction to Elixir - Part 5 of 6 | Aldric Giacomoni | 01h 00m |
Workshop-style walkthrough that actually shows code: building a gen_server state tuple for a simple game (adds three games, stats show player1 wins 1)… | ||
| nothing matches | ||