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
- A Dependently Typed Programming Language☆27Updated 5 years ago
- OCaml backend for Agda☆39Updated 7 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- MetaML and MetaOCaml bibliography☆94Updated 11 months ago
- FunTAL: mixing a functional language with assembly.☆40Updated 8 years ago
- Example row-polymorphism implementations☆61Updated 2 years ago
- A tiny language for teaching and experimenting with Refinement Types☆49Updated 4 years ago
- A dependent type theory with user defined data types☆47Updated 4 years ago
- The Alms Programming Language☆44Updated 7 years ago
- Efficient binder representation in OCaml☆43Updated last year
- A Certified Interpreter for ML with Structural Polymorphism☆45Updated 6 months ago
- Malfunction backend for Idris with a FFI to OCaml☆28Updated 6 years ago
- A nano "theorem prover".☆62Updated 6 years ago
- A prototype programming language for programming with runners☆91Updated 4 years ago
- ☆29Updated 10 years ago
- The artifact associated with "Parsing with Zippers (Functional Pearl)" (Darragh and Adams) to appear in ICFP 2020.☆29Updated last year
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- Algebraic, staged parsing for OCaml: typed, compositional, and faster than yacc☆102Updated 5 months ago
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated 2 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- An experimental type checker for a modal dependent type theory.☆115Updated 5 years ago
- Unofficial git mirror of the BER MetaOCaml patchset.☆68Updated 5 months ago
- System Fω interpreter for use in Advanced Functional Programming course☆66Updated 2 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
- Idris Binary Integer Arithmetic, porting PArith, NArith, and ZArith from Coq☆37Updated 4 years ago
- Observational Type Theory as an Agda library☆56Updated 8 years ago
- source code for the bondi programming language☆41Updated 6 years ago
- The compilation target that functional programmers always wanted.☆62Updated 5 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 4 months ago