exists-forall / EventualMonadLinks
A small and simple Haskell library for automatically ordering dependencies at runtime. Great for handling forward references when writing compilers.
☆18Updated 10 years ago
Alternatives and similar repositories for EventualMonad
Users that are interested in EventualMonad are comparing it to the libraries listed below
Sorting:
- Experiments on the construction of functions☆29Updated 10 years ago
- ☆99Updated 2 months ago
- Self-describing consumers/parsers☆43Updated 7 years ago
- ☆116Updated 10 years ago
- Preflight checklist for Haskell code. Aspire to greatness!☆68Updated 9 years ago
- Toy example of calling Rust from Haskell☆132Updated 10 years ago
- A typeclass-based Prelude.☆109Updated 9 years ago
- Haskell tool to generate expressions from types☆101Updated 8 years ago
- Convert between pointfree and pointful Haskell expressions.☆49Updated 9 years ago
- Create command line interfaces with ease☆41Updated 2 years ago
- Quick and easy data visualizations with Haskell☆84Updated 7 years ago
- Let GHC prove program equations for you☆146Updated 7 years ago
- Distributed programming language that desugars to Morte☆92Updated 3 years ago
- Monad Transformers and Classes☆76Updated 6 years ago
- Source material for "Functional Pearl: Getting a Quick Fix on Comonads"☆48Updated 7 years ago
- ☆72Updated 8 years ago
- Haskell DSL and platform providing denotational, compositional api for discrete-step, locally stateful, interactive programs, games & aut…☆182Updated 6 years ago
- Community edited and directed course based on Spring '13 cis194.☆47Updated 9 years ago
- Clojure-style transients for Haskell☆34Updated 3 years ago
- Generate Haskell code from a type☆145Updated 9 months ago
- Monitor cyclomatic complexity in Haskell programs☆98Updated 6 years ago
- Heavily inspired by RoboCode. Program robots in Haskell and watch them fight.☆15Updated 10 years ago
- Automatically finds dependencies and runs a Haskell file with stack (no cabal manifest, no stack.yaml, no project, no friction)☆32Updated 9 years ago
- Implement monads by specifying instructions and their desired operational semantics.☆84Updated last year
- Small minimal examples of modern cryptographic techniques in Haskell☆77Updated 6 years ago
- A simple Haskell progress bar for the console. Heavily borrows from TJ Holowaychuk's Node.JS project☆64Updated 8 years ago
- A secure sandboxed Haskell interpreter for pure function evaluation☆76Updated last year
- Fast non-backtracking incremental combinator parsing for bytestrings☆46Updated 3 months ago
- Haskell implementations of various ML algorithms.☆60Updated 11 years ago
- Convert lambda expressions to CCC combinators☆149Updated 9 years ago