evincarofautumn / Toody
A two-dimensional parser combinator library.
☆41Updated 7 years ago
Related projects ⓘ
Alternatives and complementary repositories for Toody
- ☆18Updated 3 years ago
- Map lazy functional language constructs to LLVM IR☆50Updated 5 years ago
- Efficient parser combinators for Haskell☆39Updated 7 months ago
- Type Safe LLVM IR ( Experimental )☆49Updated 6 years ago
- A syntax for unions of constraints in Haskell☆70Updated 7 years ago
- A framework for defining text adventures via Haskell files. Play by combining functions, not by guessing phrases.☆32Updated 4 years ago
- A truly tiny monadic parsing library☆28Updated 3 years ago
- A Haskell library providing separation of effects on the type level, effectively splitting up the monolithic IO-monad into more limited c…☆27Updated 6 years ago
- Haskell Standard Input and Output☆47Updated 6 years ago
- Exploring how to make a strict imperative universe in the GHC runtime system.☆48Updated 7 months ago
- ICFP tutorial☆40Updated 3 years ago
- Dual Traversable☆41Updated last year
- Dependently-typed finite maps (partial dependent products)☆63Updated 5 months ago
- Funny little Haskell impl☆18Updated 4 years ago
- Ghosts of Departed Proofs☆60Updated 3 years ago
- Recursion schemes for Idris☆64Updated 6 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- Run lifted IO operations asynchronously and wait for their results☆29Updated 3 weeks ago
- Subclasses of Monoid with a solid theoretical foundation and practical purposes☆33Updated 2 months ago
- More strongly typed variant of the ixset Haskell package☆23Updated 3 months ago
- An implementation of the Dunfield-Krishnaswami "Sound and Complete" type-system☆84Updated 6 years ago
- A typechecker for WebAssembly, written in Agda (WIP)☆17Updated 6 years ago
- Edit is a monad for rewriting things.☆23Updated 4 years ago
- Dependent sums and supporting typeclasses for comparing and displaying them☆54Updated last year
- being an experiment with potato power☆23Updated 4 years ago
- A simple implementation of linear type theory☆38Updated 7 years ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 4 years ago
- Kleene algebra, regular expressions☆32Updated last year
- Haskell98 indexed functors, monads, comonads☆25Updated 2 years ago
- An efficient packed, immutable UTF8-backed Unicode text type for Haskell☆33Updated 6 years ago