Code Mesh 2017
who it's for
language researchers, functional programmers, Erlang developers, distributed systems engineers, systems programmers, robotics engineers, software architects
topics
Erlang BEAM internals; persisted gen_server object storage; recursion schemes (Fix, catamorphism); abstracting abstract machines; Colossus cryptanalysis reconstruction; GRiSP Erlang on metal robotics; actor systems in Rust; blockweave blockchain archiving; NURBS to fabrication scripting; Haxl concurrency library; neuroevolution in Erlang; automatically scalable computation
| title | author | length |
|---|---|---|
| Talks about Code Mesh | David Turner | 01m |
Casual conversation claims Code Mesh purposely mixes academics and industry so talks produce cross‑pollination rather than narrow tool riffs, emphasizes a… | ||
| Talks to Brian Troutwine | Peer Stritzinger, Brian L Troutwine | 04m |
Claim is that GRiSP runs Erlang virtually on the metal so you get direct hardware access and quick prototypes. Demonstration shows a robot built in a day… | ||
| talks about the building Colossus | Phil Hayes | 13m |
Rebuild of Colossus begins in 1994 and the hardware blueprint enters the public domain in 2000; the machine uses thousands of valves, runs 24/7 with… | ||
| Talks with Brian Troutwine | Fred Hebert, Brian L Troutwine | 08m |
Claims that everything is terrible and that the useful takeaway is how systems cope with failure not grand language theory. Recommends Joe Armstrong and Jim… | ||
| A Cobbler's Child | Guy L Steele | 01h 20m |
Claims that the informal BNF/Gentzen/substitution notation is actually a widely used programming language, lacks a single specification, and produces real… | ||
| Winning the War on Error: Solving Halting Problem, Curing Cancer | Matt Might | 01h 10m |
Claims a practical workaround for the halting problem using abstracting abstract machines and abstract interpretation, applied in DARPA PAC app-audits where… | ||
| Colossus: The First Electronic Computer | Phil Hayes | 44m |
Explains how Lorenz-encrypted teleprinter traffic yields a recoverable keystream when two messages reuse the same indicator, how Bill Tutte detects a… | ||
| From Code to Construction | Susanna Wong | 43m |
Parametric scripts generate every panel for curved facades using RhinoScript (VB) inside Rhino, extracting isocurve geometry and using circle/sphere… | ||
| Peeling The Banana: Recursion Schemes from First Principles | Zainab Ali | 44m |
Derives recursion schemes from category theory and shows concrete implementations: uses functors, an isomorphism between R and F R, and the fixed-point type… | ||
| Persisting Object Oriented State in Functional Programming | Nathan Herald | 33m |
Concrete claim: a BEAM-backed database layer makes object-style, named state persistent and distributable. Implementation details include a persisted… | ||
| Collapsing Towers of Interpreters | Nada Amin | 39m |
Claims that an interpretive tower can be reduced to a one-pass compiler are demonstrated by a staged, stage-polymorphic calculus plus two prototypes: a dynamic… | ||
| BEAM: What Makes Erlang BEAM | Erik Stenman | 34m |
BEAM explains how Erlang gets scalability and uptime by specific mechanisms: lightweight processes with isolated heaps and a scheduler per core, message sends… | ||
| Blockchains, Blockweaves and the De centralised Revolution | Sam Williams | 27m |
Describes a new blockchain-derived data structure called the Blockweave with a concrete consensus tweak named proof of access that forces miners to store… | ||
| Automatically Scalable Computation | Margo Seltzer | 56m |
Claims a runtime that learns program state trajectories and speculatively executes predicted future states, using a software x86 emulator (scaly ASK) and a… | ||
| A Little Taste of Types | David Christiansen | 42m |
A tiny dependently typed language called Pie (the language) demonstrates concrete features: NAT as linked cons-style numerals, a recursion is total discipline… | ||
| Improving Write Scalability of CernVM File System with Erlang OTP | Radu Popescu | 33m |
CernVM‑FS adds a new publication architecture that lets multiple release managers write concurrently by routing uploads through a storage gateway that accepts… | ||
| Building Actor Systems in Rust | Andrew Stone | 35m |
Rust implementation of an actor library called rabble underpins a coordination KV store named Herot and uses view stamped replication to run entirely in memory… | ||
| Immutability and State Making an Immutable OS | Justin Cormack | 36m |
LinuxKit claims an immutable, container-built OS that an entire image can be produced and run in about a minute, assembling a tiny rootfs from images, a YAML… | ||
| Flying Spaghetti Monster - Type Systems and Microservices | Chris Ford | 36m |
Argues that expressive Idris dependent types can verify distributed protocols, preventing illegal state transitions and some classes of deadlock by encoding… | ||
| Building Robust Systems with Weakly Interacting Feedback Structures | Peter Van Roy | 43m |
Claims a reusable design pattern called Weakly Interacting Feedback Structures that composes multiple feedback loops to maintain one global property, not vague… | ||
| Haxl A Big Hammer for Concurrency | Simon Marlow | 48m |
Haxl flips the default from sequential to concurrent by turning IO into data and using an applicative-do compiler extension so independent effects run… | ||
| Would Aliens Understand Lambda Calculus | Tomas Petricek | 42m |
Argues lambda calculus may be invented not discovered and supports that with philosophy of mathematics and cognitive science, not just romance. Shows… | ||
| Robotics and Sensors Using Erlang | Peer Stritzinger | 48m |
Claim: Erlang runs on bare metal to control robots and sensors using the GRiSP stack and a reduced BEAM/OTP runtime. The build uses an ARM Cortex‑M7 board with… | ||
| Finite state machines | Oskar Wickström | 44m |
Claim: encoding FSMs into the type system catches real bugs and lets the compiler enforce transitions. Implementations use Haskell and PureScript… | ||
| A Practical Functional Relational Architecture | David Nolen | 42m |
Argues that Functional Relational Programming is practical today, realized with Clojure / ClojureScript, Datomic (immutable relational DB) and React; shows… | ||
| The making of an IO | Daniel Spiewak | 42m |
Argues that effects must be descriptions not immediate actions and shows a production IO built for the JVM: a concrete cats-effect IO with constructors pure… | ||
| Infinite Lambda Calculus | Jonas Winje, Einar W. Høst | 41m |
Demonstrates that self-reproduction in the pure lambda calculus supplies general recursion where names and self‑reference are forbidden, implements a Y… | ||
| Beyond Eventual Consistency | Jamie Allen | 46m |
Starbucks rebuilds a unified commerce platform on Scala Akka Kafka Cassandra and an AWS pass and evaluates global stores: Aurora, Cosmos, Spanner, Cockroach… | ||
| Talks About His Talks | David Nolen | 03m |
Argues that state drives complexity and that applying functional programming ideas beyond code to the data layer reduces that complexity. Describes systems… | ||
| Talks About Blockchain and Blockweave Archiving | Sam Williams | 05m |
Archain proposes a working blockweave: a blockchain variant that links each new block to a randomly chosen previous block and requires a proof-of-access to… | ||
| Talks with Brian Troutwine about His Code Mesh Talk | Alvaro Videla, Brian L Troutwine | 09m |
Argues that specific metaphors change what gets built and how it’s reasoned about: modeling replication as gossip-as-epidemic led to epidemiological math that… | ||
| Talks with Brian Troutwine about His Code Mesh Talk | Tomas Petricek, Brian L Troutwine | 05m |
Argues that much of mathematics depends on embodied cognition—counting as collections, set‑like “container” schemas and a directionality needed for… | ||
| Metaphors We Compute By | Alvaro Videla | 40m |
Argues that specific metaphors change engineering choices and outcomes: cites Lakoff and experiments where argument is war vs collaborative frames shift… | ||
| The Hitchhiker's Guide to Neuroevolution in Erlang | Jeroen Soeters | 39m |
Neuroevolution here implements DXNN in Erlang and claims concrete wins: topology and weight search are separated, topology evolves via random intensity… | ||
| Distributed Systems | Anne Currie | 43m |
Distributed systems fail for concrete, measurable reasons: clocks drift by 10 minutes across machines (DataDog), internal calls run about 100x faster than… | ||
| Revisting Concatenative Languages with Creative Programming | Stian Veum Møllersen | 46m |
Demonstrates that concatenative languages treat everything as functions on a shared state (usually a stack), uses HTML5 canvas code that draw 20 squares with… | ||
| Relational Interpreters, Program Synthesis, and Barliman | William E. Byrd | 41m |
miniKanren encodes a Scheme relational interpreter so the system synthesizes code by running eval backwards; it actually generates quines, 99 distinct programs… | ||
| A Pragmatic Introduction to Category Theories | Daniela Sfregola | 40m |
Demonstrates concrete code in Scala that builds Functor Applicative Monad implementations, implements a custom Maybe container and shows how map ap and flatMap… | ||
| Some History of Functional Programming Languages | David Turner | 58m |
A concise history that claims lazy evaluation and type design drive modern functional languages, with concrete artifacts and results: 1936 lambda calculus… | ||
| Concurrent ML - The One That Got Away | Michael Sperber | 36m |
Concurrent ML claims that channels become composable events not channels, and demonstrates with concrete Scheme code: a streaming Fibonacci network built from… | ||
| Pony for Safe, Fast, concurrent programs | Sophia Drossopoulou | 45m |
Pony claims atomic behaviors via a capability-based type system (ISO/ref/val/tag and viewpoint adaptation) that lets actors hand off mutable state safely, uses… | ||
| nothing matches | ||