Programming the worldwide elastic supercomputer with Unison
summary
Unison claims a single program can express an elastic distributed system and shows the concrete primitives: spawn / at / force primitives produce nodes, start remote computations and return futures that are forced later. The type system uses algebraic effects handlers to let different interpreters simulate local execution, inject faults, or connect to cloud autoscaling. Demo compiles and runs a 17-line distributed mergesort locally via a run_local handler. Release target is spring 2019 and the library ecosystem is still empty.
AI-written summary · about
chapters (10)
- 0:00Introduction to Unison
- 5:54Why a new language
- 7:18Unison basics and syntax
- 8:22Distributed programming in Unison
- 11:51Interpreting remote ability
- 12:11Distributed merge sort example
- 14:41Live demo of Unison
- 15:22Programming model shift
- 17:31Future of Unison
- 18:14Q&A session
related talks
41mIntroduction to the Unison programming language
42mMicroservices on Unison Cloud: Statically Typed, Dynamically Deployed
36mHow to write a search engine in 15 lines of code
23mA Haskell Auto-Parallelizer for Distributed Computing
01h 06mTransient: Unrestricted Algebraic and Monadic Composability
19mSol: Fast Distributed Computation Over Slow Networks
41mProgramming Distributed Systems
43mMesh
