-
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: RDP
Abandoning Commitment in HCI
Today’s applications and services are very committed to what they do for us. And I mean that in a bad way. When we send a message to a service, or call a procedure, or press a button, it is generally … Continue reading
Posted in Open Systems Programming, Reactive Demand Programming, User Interface
Tagged commitment, exploration, HCI, probability, RDP, time warp, transaction, UI
5 Comments
Dynamic Anytime Algorithms
I’m still thinking about ways to eliminate stateful semantics from large-scale reactive applications for RDP, i.e. pursuing stability instead. Stateless semantics make an application more robust against resets, disruption or partitioning, etc.. To achieve stability without state requires accepting some indeterminism … Continue reading
Stream vs. Stack
In a recent discussion on PiLuD, a question was asked regarding implications of stream processing relative to the stack-machine concept used by many languages today. I replicate my answer here: Stream processing has low memory locality (touches a lot of … Continue reading
Vat Model for RDP
The “vat” is a delightfully simple concept, which I borrow from E language. A vat is essentially a thread with an event loop, but with a few relevant properties: Vats do not share state. Vats are internally deterministic, up to … Continue reading
Posted in Concurrency, Language Design, Reactive Demand Programming
Tagged batching, clock, concurrency, E, event, event loop, eventual consistency, FFI, glitch freedom, monad, parallelism, RDP, real-time, remote call, snapshot consistency, state, thread, Vat
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