timjs / idris-cleanLinks
A priliminary backend for Idris that compiles to Clean.
☆15Updated 8 years ago
Alternatives and similar repositories for idris-clean
Users that are interested in idris-clean are comparing it to the libraries listed below
Sorting:
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- IO using sized types and copatterns☆35Updated 4 years ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29Updated 4 years ago
- GRIN backend for Idris☆50Updated 5 years ago
- Extensible records for Idris☆25Updated 4 years ago
- OCaml backend for Idris2☆19Updated 4 years ago
- Interpreter for λ̅μμ̃-calculus of Herbelin and Curien (for educational purposes).☆20Updated 4 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Experiments with sequent calculi☆27Updated 4 years ago
- Bidirectional programming in Haskell with monadic profunctors☆46Updated 3 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- Concurrent IO language with Uniqueness Types☆9Updated 10 years ago
- System F implemented in Haskell☆24Updated 13 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Updated 3 years ago
- being bits and pieces I'm inclined to leave lying around☆52Updated last week
- First class patterns and pattern matching, using type families☆17Updated 4 years ago
- A usable type system for call by push-value☆33Updated 5 years ago
- Work on type class deriving with elaboration reflection☆32Updated 6 years ago
- being a thing I build on a Saturday☆28Updated 7 years ago
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 3 years ago
- Experiments in implementing functional data structures in Idris☆15Updated 5 years ago
- Recursion schemes for Idris☆65Updated 6 years ago
- GRIN backend for Idris2☆33Updated 3 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- ICFP tutorial☆39Updated 3 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 7 months ago
- classical sequent calculus, embedded in Haskell☆20Updated 3 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago