-
Recent Posts
- Modular Manipulation of the Link-Time Environment
- Why Not FFI
- Declarative State Machines
- Ad-Hoc External State Models
- Progress Report: Loops and Restarts in Sirea
- Objects as Dependently Typed Functions
- Anticipation in RDP Reduced
- Exponential Decay of History, Improved
- Sirea RDP Progress Update: Demand Monitors are Working
- Stateless Sound
Categories
Blogroll
- Lambda the Ultimate
- Duncan Cragg's What not How
- Portland Pattern Repository
- Manuel Simoni's Axis of Eval
- Haskell Reddit
- Rocketnia's Pipe Dreams
- Gilad Bracha's Room 101
- Bret Victor's Worrydream
- Roly Perera's Dynamic Aspects
- Gerold Meisinger's Lambdor Devblog
- Patai Gergely's Just _|_
- Dataspace Project
Meta
Tag Archives: reactive
Large Scale Reactive Collections
A common challenge for reactive programming models is large collections with fine-grained mutations – e.g. arrays, lists, stacks, maps. Subscriptions tend to be ad-hoc, e.g. “the third element of the array” or “the top element of a stack”, or “the … Continue reading
Posted in Concurrency, Language Design, Reactive Demand Programming, State
Tagged cache, concurrency, consistency, directory, lenses, reactive, RST, scalable, state
Leave a comment
Reactive State Transition
Reactive State Transition (RST) is a simplistic state model I developed for use with Reactive Demand Programming (RDP). RST serves a similar role as would a finite state machine. Unlike a typical state machine, RST reacts to observable system state … Continue reading
