e-wrks / edhLinks
Đ (Edh) - The next-big-things ought to happen with Haskell not C/C++
☆28Updated last year
Alternatives and similar repositories for edh
Users that are interested in edh are comparing it to the libraries listed below
Sorting:
- A usable type system for call by push-value☆33Updated 5 years ago
- The compilation target that functional programmers always wanted.☆62Updated 5 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- ICFP tutorial☆39Updated 4 years ago
- Grammatical parsers - combinator library for parsing general context-free grammars☆42Updated 2 weeks ago
- Stroll: an experimental build system☆41Updated 2 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆40Updated 4 years ago
- ☆12Updated 4 years ago
- Ties the knot on data structures that reference each other by unique keys☆47Updated last year
- Quantitative Type Theory implementation☆54Updated 4 years ago
- Home of the fast-arithmetic library for number theory in ATS and Haskell.☆25Updated last year
- ☆30Updated 2 months ago
- Automatic piecewise-mutable references for your types☆42Updated 5 years ago
- Funny little Haskell impl☆18Updated 4 years ago
- Fast polynomial arithmetic in Haskell (dense and sparse, univariate and multivariate, usual and Laurent)☆69Updated 2 weeks ago
- High level, generic library for interrogative user interfaces in Haskell☆41Updated 4 years ago
- a functional programming language with algebraic effects and handlers☆82Updated 7 months ago
- Agda-style equational reasoning in Haskell☆54Updated 5 months ago
- A compiler for a simple language using llvm☆35Updated 2 years ago
- classical sequent calculus, embedded in Haskell☆21Updated 3 weeks ago
- Compositional type checking for Haskell☆37Updated 14 years ago
- Efficient parser combinators for Haskell☆39Updated last week
- A tiny language for teaching and experimenting with Refinement Types☆48Updated 4 years ago
- An efficient graph library for Haskell☆38Updated 3 weeks ago
- A framework for defining text adventures via Haskell files. Play by combining functions, not by guessing phrases.☆32Updated 5 years ago
- Showing how some simple mathematical theories naturally give rise to some common data-structures☆39Updated last year
- Implementing a small functional language with a combinator based graph-reduction machine☆36Updated last week
- A nano "theorem prover".☆62Updated 6 years ago
- Existential type.☆37Updated 8 months ago
- Build tool for ATS.☆42Updated 3 years ago