lortabac / arielLinks
A simple, purely-functional programming language
☆25Updated 3 years ago
Alternatives and similar repositories for ariel
Users that are interested in ariel are comparing it to the libraries listed below
Sorting:
- 🌋 Idris implementation of patricia tree☆23Updated 5 years ago
- A compiler for a simple language using llvm☆36Updated 2 years ago
- An interpreter for the concatenative language Joy, written in Haskell using extensible-effects☆35Updated last year
- Small implementation of OutsideIn(X) type checking algorithm☆31Updated 10 years ago
- Austin's supercompiler work☆21Updated 6 years ago
- ICFP Bingo 2017 (Idris edition)☆30Updated 6 years ago
- Build tool for ATS.☆42Updated 3 years ago
- Automatic piecewise-mutable references for your types☆42Updated 5 years ago
- Edit is a monad for rewriting things.☆23Updated 5 years ago
- 🔖 Better Haskell documentation.☆17Updated 5 years ago
- Haskell port of the WebAssembly OCaml reference interpreter☆45Updated 2 years ago
- used to be something more ambitious, cut scope to just a simple compiler for thesis project☆17Updated 6 years ago
- A two-dimensional parser combinator library.☆41Updated 8 years ago
- High level, generic library for interrogative user interfaces in Haskell☆41Updated 4 years ago
- Non-empty Vectors☆26Updated 7 months ago
- Zippers for cofree types☆13Updated 4 years ago
- Template for Hindley-Milner based languages☆39Updated 4 years ago
- The compilation target that functional programmers always wanted.☆62Updated 5 years ago
- 💧 Liquid Haskell integration for Cabal and Stack☆25Updated 6 years ago
- Deep evaluation of data structures☆43Updated 5 months ago
- A simple library I wrote to allow me to quickly and easily construct command line interfaces.☆28Updated 2 years ago
- Classes for types where we know all the values☆39Updated 11 months ago
- A partial binary associative operator (appendMaybe :: a → a → Maybe a)☆13Updated last year
- ICFP tutorial☆39Updated 4 years ago
- System F implemented in Haskell☆24Updated 13 years ago
- Efficient implementation of the implicit treap data structure☆63Updated 4 years ago
- ☆23Updated 2 years ago
- Extra type-level operations on GHC.TypeLits.Nat and a custom solver☆18Updated last week
- Kleene algebra, regular expressions☆33Updated 2 years ago
- Reification of data structures using observable sharing☆29Updated last year