target / theta-idlLinks
Define communication protocols between applications using algebraic data types.
☆47Updated 2 years ago
Alternatives and similar repositories for theta-idl
Users that are interested in theta-idl are comparing it to the libraries listed below
Sorting:
- A total recursion scheme library for Dhall☆66Updated 2 weeks ago
- Wailing into the primordial ooze of category theory☆55Updated this week
- Braiding extensible effects together in a pipeline/workflow of tasks☆60Updated 2 years ago
- A smart A* search monad transformer which supports backtracking user-state!☆81Updated 3 years ago
- Yet another yet another recursion scheme library in Haskell.☆89Updated 3 weeks ago
- Haskell embedding of PlusCal☆61Updated 3 years ago
- high-powered optics in a small package☆53Updated 10 months ago
- A work stealing scheduler☆74Updated 7 months ago
- Benchmarks to compare Haskell streaming library performance☆106Updated 9 months ago
- Tasty meal of Dhall☆67Updated 2 years ago
- Refined types☆57Updated 6 years ago
- Automatically trace all (showable) binds in do expressions☆84Updated 7 years ago
- An experiment in functional interface design☆24Updated 8 years ago
- Serializable closures for distributed programming.☆65Updated last year
- ☆50Updated last month
- Convenient Haskell syntax for writing in LaTeX math expressions☆28Updated last year
- Create temporary postgres instances☆55Updated last year
- A helpful companion to GHC. Overrides GHC messages, to the user's liking.☆33Updated 5 years ago
- Forward-propagating Constraint Solver monad. Good for solving Sudoku, N-Queens, etc.☆67Updated 2 years ago
- Haskell ODBC binding with SQL Server support☆45Updated last year
- CI assistant☆47Updated 2 months ago
- Cofun with Cofree Comonads☆32Updated 9 years ago
- Free categories, free arrows and free categories with monadic actions☆24Updated 5 months ago
- Interpreter for GHC Haskell☆22Updated 5 years ago
- A Haskell translation of Idris's original algebraic effects library☆41Updated 8 years ago
- Standard containers, with keys that carry type-level proofs of their own presence.☆81Updated 5 years ago
- Literally the best anonymous records☆36Updated 2 years ago
- A fast open-union type, suitable for 100+ contained alternatives.☆99Updated last year
- Generic random generators☆81Updated 2 years ago
- being the scrapings of my stackoverflow answers☆48Updated 5 years ago