pkamenarsky / synchronLinks
Synchronous programming in Haskell
☆17Updated 5 years ago
Alternatives and similar repositories for synchron
Users that are interested in synchron are comparing it to the libraries listed below
Sorting:
- A total recursion scheme library for Dhall☆66Updated last month
- Haskell embedding of PlusCal☆62Updated 3 years ago
- Yet another … yet another recursion scheme library for Haskell☆89Updated this week
- high-powered optics in a small package☆53Updated 4 months ago
- A recursion scheme library for Idris.☆25Updated this week
- Braiding extensible effects together in a pipeline/workflow of tasks☆62Updated 2 years ago
- Smash products, Wedge products, and other Pointed stuff☆35Updated 3 years ago
- Wailing into the primordial ooze of category theory☆55Updated 3 weeks ago
- Extensible records for Idris☆25Updated 4 years ago
- Code for the "Logic, machines and sequent calculus" talk☆31Updated 3 years ago
- An Idris type provider for communicating type-checkable protocols.☆26Updated 8 years ago
- Effect Handlers for Java / the JVM☆29Updated 5 years ago
- Comparing Haskell effect systems for ergonomics and speed☆66Updated 4 years ago
- A set of patches to make Hackage compatible with the Eta language.☆64Updated 6 years ago
- Idris GraphQL☆16Updated 8 years ago
- A command-line replacement for the Google Authenticator App☆25Updated 2 years ago
- Port of Scala/Haskell Refined library to Idris☆17Updated 4 years ago
- Implementing Abstract Binding Trees (in Scala, ...)☆19Updated 10 years ago
- A simple to-do web application in Eta using Spock web framework and Lucid DSL☆17Updated 7 years ago
- eta-spark is a library that provides complete bindings for Apache Spark☆21Updated 7 years ago
- Talks on category-parametric programming.☆23Updated 2 years ago
- Slides for Scalaworld 2019☆15Updated 5 years ago
- Crazy experiment, ignore unless you know better☆37Updated 7 years ago
- HoTT Note-taking action☆25Updated 6 years ago
- Isomorphic Reasoning: Counting with Types☆38Updated 5 years ago
- Provides 'graded monads' and 'parameterised monads' to Haskell, enabling fine-grained reasoning about effects.☆99Updated 3 months ago
- Simple adjunctions☆45Updated 3 weeks ago
- An HTTP library for idris☆39Updated 7 years ago
- A reimplementation of `Data.IntMap` that uses minimum and maximum bounds on subtrees instread of bit prefixes.☆21Updated 2 years ago
- Experiments with linear types☆14Updated 7 years ago