CircuitFlow: : A Domain Specific Language for Dataflow Programming
summary
An embedded Haskell DSL models workflows as a Symmetric Monoidal Preorder to statically type inputs and outputs, composes tasks with then and beside, and runs on a cam process network using FIFO queues instead of a central scheduler. A polymorphic lifted Haskell function implements the top‑10 task. Benchmark shows CircuitFlow completes the 100‑input playlist pipeline in 8.71s vs 7.12s, and type safety prevents the mismatched I/O error that stops Luigi.
AI-written summary · about
chapters (5)
related talks
20mOn the paradigm of functional programming
44mUnderstanding Distributed Calculi in Haskell
58mKeynote: Why Functional Programming Matters
26mFusing Session-Typed Concurrent Programming into Functional Programming
59mPipeline-oriented programming
30mDurable Event-sourced Workflow Monad... Seriously!
20mFour Years of Embedded Haskell in Critical Real-Time Systems: Lessons and Insights
21mFLOREnce: A Hybrid Logic-Functional Reactive Programming Language