evincarofautumn / ToodyLinks
A two-dimensional parser combinator library.
☆41Updated 8 years ago
Alternatives and similar repositories for Toody
Users that are interested in Toody are comparing it to the libraries listed below
Sorting:
- A monad, perhaps.☆32Updated 5 years ago
- Type Safe LLVM IR ( Experimental )☆49Updated 7 years ago
- Edit is a monad for rewriting things.☆23Updated 4 years ago
- A syntax for unions of constraints in Haskell☆70Updated 7 years ago
- Ties the knot on data structures that reference each other by unique keys☆47Updated 10 months ago
- Run lifted IO operations asynchronously and wait for their results☆29Updated 7 months ago
- Efficient parser combinators for Haskell☆39Updated 3 weeks ago
- A truly tiny monadic parsing library☆28Updated 4 years ago
- Dependent sums and supporting typeclasses for comparing and displaying them☆56Updated last year
- Standard module for type-level programming in Haskell☆30Updated 5 years ago
- A framework for defining text adventures via Haskell files. Play by combining functions, not by guessing phrases.☆32Updated 4 years ago
- Quasiquoter for LLVM☆31Updated 7 years ago
- Subclasses of Monoid with a solid theoretical foundation and practical purposes☆33Updated 3 months ago
- A usable type system for call by push-value☆33Updated 5 years ago
- Dual Traversable☆42Updated 2 years ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago
- Dependently-typed finite maps (partial dependent products)☆66Updated 4 months ago
- ICFP tutorial☆39Updated 3 years ago
- rewrite rules for type-level equalities☆62Updated last year
- More strongly typed variant of the ixset Haskell package☆24Updated 10 months ago
- Agda-style equational reasoning in Haskell☆53Updated 2 months ago
- Hack idiom-brackets using GHC Source Plugin (8.6+)☆25Updated 6 years ago
- being an experiment with potato power☆23Updated 5 years ago
- ⚖️ Trial Data Type☆21Updated last week
- A terminal UI for inspecting steps taken by a rewriting process. Useful for the optimization phase of a compiler, or even evaluators of s…☆21Updated 5 years ago
- 🖼️ the compiling to closed categories compiler☆66Updated 7 years ago
- Funny little Haskell impl☆18Updated 4 years ago
- Interpreter for GHC Haskell☆22Updated 5 years ago
- An implementation of the Dunfield-Krishnaswami "Sound and Complete" type-system☆84Updated 7 years ago
- Exploring how to make a strict imperative universe in the GHC runtime system.☆48Updated 6 months ago