ashinkarov / hehLinks
A programming language with infinite arrays
☆31Updated 5 years ago
Alternatives and similar repositories for heh
Users that are interested in heh are comparing it to the libraries listed below
Sorting:
- A simple implementation of linear type theory☆38Updated 8 years ago
- The artifact associated with "Parsing with Zippers (Functional Pearl)" (Darragh and Adams) to appear in ICFP 2020.☆29Updated last year
- Malfunction backend for Idris with a FFI to OCaml☆28Updated 6 years ago
- A Dependently Typed Programming Language☆27Updated 5 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- OCaml backend for Agda☆40Updated 7 years ago
- Idris Binary Integer Arithmetic, porting PArith, NArith, and ZArith from Coq☆36Updated 4 years ago
- FunTAL: mixing a functional language with assembly.☆40Updated 8 years ago
- A tiny language for teaching and experimenting with Refinement Types☆48Updated 4 years ago
- The Alms Programming Language☆44Updated 7 years ago
- A prototype implementation of the Frank programming language☆17Updated 9 years ago
- A nano "theorem prover".☆62Updated 6 years ago
- A small implementation of a proof refinement logic.☆50Updated 8 years ago
- A dependent type theory with user defined data types☆47Updated 4 years ago
- A Certified Interpreter for ML with Structural Polymorphism☆45Updated 6 months ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- ET (IPL) language interpreters and literature☆26Updated 6 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 3 years ago
- MetaML and MetaOCaml bibliography☆93Updated 10 months ago
- Observational Type Theory as an Agda library☆56Updated 8 years ago
- OCaml backend for Idris2☆19Updated 5 years ago
- ☆29Updated 10 years ago
- Automatically exported from code.google.com/p/trellys☆47Updated 6 years ago
- A version of Epigram 1 that can run with newer GHCs☆54Updated 8 years ago
- Mirror of Epigram 2, by Conor McBride, et al.☆50Updated 5 years ago
- Miller/pattern unification in Agda☆68Updated 11 years ago
- ML modules and functors as first-class citizens by unifying ML modules and ML records with path dependent types and subtyping.☆38Updated 3 years ago
- The compilation target that functional programmers always wanted.☆62Updated 5 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- A bare-bones LCF-style proof assistant☆24Updated 6 years ago