LambdaConf 2015
2015-05-22..2015-05-24
Boulder, United States
[LambdaConf 2015, LambdaConf 2017, LambdaConf 2018, LambdaConf 2019, LambdaConf 2020 Global Edition, LambdaConf 2024, LambdaConf 2025]
who it's for
functional programmers, Haskell developers, Scala developers, Clojure developers, language designers, web developers, systems programmers
topics
finally tagless DSLs; MTL monad transformers; Cryptol for crypto engineering; ClojureScript development; GPGPU programming in Haskell; PureScript with React; Elm production web apps; Scalaz and Cats libraries; LiquidHaskell refinement types; dependent types and Idris
| title | author | length |
|---|---|---|
| Finally Tagless DSLs and MTL | Joseph Abrahamson | 21m |
Claims that MTL is an instance of the Finally Tagless DSL pattern and demonstrates equivalence with ASTs built by fixed-point functors and functor sums, using… | ||
| Intro to Cryptol and High Assurance Crypto Engineering | Adam Foltzer | 01h 34m |
Cryptol is an open source pure functional language for expressing and reasoning about bit-precise computations, particularly cryptographic algorithms. Like… | ||
| The Next Great Functional Programming Language | John A De Goes | 58m |
Argues for a concrete design: drop ad‑hoc features (GHC has ~70 extensions) and drop pattern matching and records and modules in favor of a small dependently… | ||
| A Bird's Eye View of ClojureScript | Chandu Tennety | 58m |
A migration-visualizer called Birdwave is built with ClojureScript, Om, d3 and Pedestal, importing a lazy-parsed eBird dump of 11 gigs of text into Datomic and… | ||
| Programming and Math | Harold Carr | 52m |
Shows an algebra of functions with concrete Haskell code: purity forces IO types, composition and associativity hold, identity and constant functions become… | ||
| How to Learn Haskell in Less Than 5 Years | Chris Allen | 42m |
Argues a realistic path from confused beginner to productive Haskell user: concrete curricula (cs14 then the NICA course), community help (IRC channel… | ||
| Parametricity The Essence of Information Hiding | Kris Nuttycombe | 31m |
Claims that parametricity lets types enforce invariants by excluding implementation possibilities and shows how to prove behavior from signatures. Covers… | ||
| Loom and Functional Graphs in Clojure | Aysylu Greenberg | 37m |
Loom is an open-source Clojure library that provides concrete implementations: Bellman-Ford implementation (with negative-cycle detection), Dijkstra, A… | ||
| Clojure vs Design Patterns | Ron Toland | 16m |
Claim: many Gang of Four patterns are unnecessary in Clojure or are simpler when expressed with its primitives. Demonstrations use actual code in a REPL… | ||
| Why I Like Functional Programming | Adelbert Chang | 50m |
Functional programming claims: referential transparency lets algebraic reasoning replace mutable state. Concrete wins: a binary‑tree insert shrinks from… | ||
| Ipecac for the Ouroboros | Paul Phillips | 24m |
Proposes a file-system layer of pervasive virtual, immutable, statically typed, lazy and reactive files whose metadata can drive names and structure, not the… | ||
| Monads Asking the Right Question | Pawel Szulc | 21m |
Explains monads as a concrete abstraction with two operations—unit and bind (flatMap)—and laws (left/right identity, associativity), not metaphors; shows a… | ||
| Fault Tolerance on the Cheap Making Systems That Probably Won't Fall Over | Brian L Troutwine | 48m |
Claims a real system handles 40 million transactions a second in a tenth of a second using airling and practical patterns rather than perfect proofs. It shows… | ||
| Shipping a Production Web App in Elm | Richard Feldman | 44m |
A 2011 CoffeeScript web app Dreamwriter is scratch‑rewritten in Elm to edit 100,000-word novels and the claim is concrete: rendering and interaction become… | ||
| ooErlang A Programmer Friendly Approach to OOP in Erlang | Emiliano Firmino | 45m |
Object-oriented Programming (OOP) dominates the industry. Most developers have experience with OO, but are new to functional programming. To help bring them to… | ||
| The Meaning of LFE | Zeeshan Lakhani | 31m |
LFE proves that a Lisp syntax can target BEAM: the repple evaluates functions and macros live, macros expand into Erlang forms, and code compile to Core Erlang… | ||
| Make Your Own Programming Language! | Nick Heiner | 26m |
Shows a concrete pipeline that starts with text and ends as runnable JavaScript, claiming a full compiler from lambda script to JavaScript implemented in F… | ||
| HTTP through Functional Programming | Andrew Cherry | 28m |
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… | ||
| Dynamic vs Static Having a Discussion without Sounding Like a Lunatic | David Greenberg | 45m |
Argues that type systems are a business decision not a purity test: compiled Clojure to FPGAs (pipin) exists and is used, Clojure and Scala run a Two Sigma… | ||
| Building Concurrent, Fault Tolerant, Scalable Applications in F# using Akka Net | Riccardo Terrell | 52m |
Claims that using F# plus Akka.NET yields practical actor-based concurrency: immutable message passing, supervision with one-for-one and one-for-all… | ||
| Full stack FP in Datomic, Clojure, and ClojureScript | Priyatam Mudivarti | 52m |
Prototypes are built end to end in Clojure and Clojurescript using Datomic for facts and schema, Ring middleware for composable HTTP handlers, Om plus React… | ||
| Type Theory and its Meaning Explanations | Jon Sterling | 52m |
Argues that verification not proof is the core notion, and builds a semantics where types are sets of canonical verifications with equivalence; uses meaning… | ||
| Pattern Functors... | Alejandro Serrano Mena | 52m |
Haskell code turns data types into manipulable descriptions: a pattern functor = constructor shapes with recursion removed, tied by Fix to rebuild recursive… | ||
| In Rust We Trust | Alex Burkhart | 45m |
Rust claims compile-time memory and concurrency safety via Ownership and the borrow checker, with no runtime or GC cost and zero-cost abstractions for… | ||
| Accelerating Haskell GPGPU Programming with Haskell | Joe Nash | 24m |
The page claims the accelerate library embeds an array DSL in Haskell and generates code for a CUDA backend or OpenCL, targeting GPUs with hundreds of cores to… | ||
| Give me Freedom or Forgeddaboutit | Joseph Abrahamson | 32m |
Claims that freedom is a process: a left adjoint free paired with a forgetful functor (free ⊣ forget), not just a cute datatype. Demonstrates the two concrete… | ||
| The Abstract Method, In General | Gershom Bazerman | 36m |
Argues that abstraction is a method not a topic and claims programming benefits from a weak structuralist standpoint: treat abstractions as first‑class… | ||
| Introducing Emily Simplifying Functional Programming | Andi McClure | 25m |
Emily is an experimental language that models all operations by composing function‑like combinators with state so everything is a single‑argument combinator… | ||
| Introduction to Intuitionistic Type Theory | Vlad Patryshev | 53m |
Claims a workable type theory that drops sets and the law of excluded middle and uses Topos Theory and category constructions to get dependent types and logic… | ||
| Reactive Programming with Algebra | André van Delft | 58m |
Claims that Algebra of Communicating Processes (ACP) plus a Scala extension yields clearer reactive code, implemented as SubScript, with concrete demos: a… | ||
| Computation Expressions in Scala | Jean Rémi Desjardins | 27m |
Claims a concrete implementation of Computation Expressions for Scala that delivers fail-fast futures missing from vanilla for-comprehensions by translating… | ||
| Axle A Spire based DSL | Adam Pingel | 23m |
Axle is a Scala-embedded DSL built on Spire that provides concrete type classes and small shims so algorithms actually run: Axle core depends only on Spire and… | ||
| A Skeptic's Look at Scalaz Gateway Drugs | Brendan McAdams | 29m |
An engineer replaces ad hoc error handling on an API server with Scalaz primitives and shows what actually changes: converting Option to \/ (disjunction) to… | ||
| Cats — A Fresh Look at Functional Programming in Scala | Mike Stew O'Connor | 50m |
Cats claims to fill gaps left by the Scala standard library for pure functional programming and already attracts real momentum: merged 100 pull requests in the… | ||
| Programs as Values Pure Composable Database Access in Scala | Rob Norris | 30m |
doobie presents a practical programs-as-values design: the low-level API is machine-generated low-level API that models roughly 190 JDBC operations as an… | ||
| The Case for the Cutting Edge | Matt Farmer | 19m |
Company chooses Scala and Clojure to power a supply‑chain network that moves one third of a trillion dollars and handles 200 message formats with industrial… | ||
| What's New in Scala | Marconi Lanna | 49m |
Covers concrete language and tooling changes from Scala 2.9–2.11 with a peek at 2.12: compiler and runtime fixes, new collections, macros, futures/promises… | ||
| Scalaz 102 Level Up Your Scalaz Foo! | Colt Frederickson | 34m |
Scalaz is presented as a practical toolbox for Scala showing exact imports, idioms and when types matter: NonEmptyList to avoid unsafe heads, Validation with… | ||
| Idiomatic Scala Your Options Do Not Match | Marconi Lanna | 26m |
Claims that Option is best used as a collection/monad via map, flatMap, filter, fold and many built-in methods rather than pattern matching, demonstrates fold… | ||
| Scalaz Streams A Functional Approach to Compositional... | Derek Chen Becker | 51m |
Library claims type safety, scalaz-stream composition and resource safety and shows concrete tradeoffs: some features are trimmed for performance, some… | ||
| The Virtual Filesystem This Changes Everything | Paul Phillips | 52m |
Argues that a virtual filesystem maps metadata to lazily materialized files so repositories like Maven Central and local jars appear instantly without disk… | ||
| Haskell Nuggets Power Series Brought to Life | Doug McIlroy | 28m |
Haskell implements power series as lists of coefficients and uses lazy lists and numeric overloading to make sum, product, integral, derivative, composition… | ||
| Freya F# for HTTP Systems | Andrew Cherry | 57m |
Freya is an F# library stack that models HTTP as a graph-based decision machine and compiles those graphs into pipelines. The demo builds a complete to‑do REST… | ||
| Freya F# for HTTP Systems | Andrew Cherry | 58m |
Freya is a stack of F# libraries that claims a strongly typed HTTP 1.1 model and a graph-based modelling of responses. It compiles down to OWIN/Katana, exposes… | ||
| Lightning Talks | Alejandro Serrano Mena, Gershom Bazerman, Zeeshan Lakhani, Ben Burdette, Vincent Marquez, Phil Freeman | 52m |
Six five- to ten‑minute demos: a workflow using GHC‑mod holes that shows Emacs keybindings, automatic case‑splits and type-driven completions that actually… | ||
| The Art of Meaningful Connection... | Sharon Steed | 21m |
Claims that embrace vulnerability as a growth strategy for personal and company brands and shows concrete tactics: trade writing for public speaking, disclose… | ||
| Modeling Data in Haskell for Beginners | Chris Allen | 01h 39m |
Starts by claiming real modeling is done with concrete types not prose and shows it: use GHCi and type signatures to write algebraic data types, count… | ||
| Purely Functional Web Apps using React and PureScript | Phil Freeman | 01h 49m |
Workshop claims you can build real single‑page apps in PureScript with React and shows it: PureScript + React via Thermite for pure render/event model, AJAX… | ||
| Learn Functional Programming with PureScript | John A De Goes | 01h 40m |
Promises to make a rookie functional programmer in two hours by teaching concrete claims not fluff: PureScript fundamentals (types, product/coprod types… | ||
| Introduction to Erlang | Steven Proctor | 01h 33m |
If you have heard nothing else about Erlang, you have probably heard something about OTP and people chanting “Processes are not threads. Processes are really… | ||
| Introduction to Constraint Logic Programming | Sergii Dymchenko | 01h 24m |
Claims that constraint logic programming solves hard combinatorial problems with minimal code and demonstrates that concretely by using the Prolog-based… | ||
| Introduction to Typed Racket | Mark Farrell | 01h 45m |
This workshop will give an introduction to Typed Racket. We will give an overview of the features of its type system, go over some examples of typing old… | ||
| The Art of Program Derivation and Parallel Computation | Gershom Bazerman | 01h 37m |
Starts from the specification and mechanically derives efficient implementations, showing how the Algebra of Programming yields MapReduce ideas and concrete… | ||
| Write Some Idris | Brian McKenna | 01h 46m |
Hands‑on workshop that teaches Idris by writing code not just theory: live use of Idris REPL, explicit proofs of equality (reflexive, transitive, congruence… | ||
| LiquidHaskell Refinement Types for Haskell | Ranjit Jhala | 01h 43m |
Haskell has many delightful features, perhaps the most beloved of which is its type system which allows developers to specify and verify a variety of program… | ||
| Developing Web Applications with Haskell | Alejandro Serrano Mena | 58m |
Shows concrete code and a working workflow: routing and HTML generation with Spock + Blaze + Hamlet, database schema and queries with Persistent (and Esqueleto… | ||
| A Practical Introduction to Haskell GADTs | Richard A. Eisenberg | 01h 20m |
Claim: GADTs let the compiler assume different types in different pattern branches so invariants live in types, reducing unsafeCoerce. Workshop builds a simply… | ||
| Join Us! | 01m | |
-- no description -- | ||
| nothing matches | ||