ashinkarov / hehLinks
A programming language with infinite arrays
☆31Updated 6 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 2 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- A Certified Interpreter for ML with Structural Polymorphism☆45Updated 9 months ago
- A dependent type theory with user defined data types☆47Updated 4 years ago
- Malfunction backend for Idris with a FFI to OCaml☆28Updated 6 years ago
- MetaML and MetaOCaml bibliography☆98Updated last year
- A Dependently Typed Programming Language☆27Updated 5 years ago
- A tiny language for teaching and experimenting with Refinement Types☆49Updated 4 years ago
- OCaml backend for Agda☆39Updated 7 years ago
- Showing how some simple mathematical theories naturally give rise to some common data-structures☆39Updated last year
- FunTAL: mixing a functional language with assembly.☆41Updated 8 years ago
- An experimental type checker for a modal dependent type theory.☆116Updated 5 years ago
- A prototype implementation of the Frank programming language☆17Updated 9 years ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- Unofficial git mirror of the BER MetaOCaml patchset.☆69Updated 8 months ago
- The Alms Programming Language☆44Updated 7 years ago
- A bare-bones LCF-style proof assistant☆25Updated 6 years ago
- A Coq to Cedille compiler written in Coq☆34Updated 5 years ago
- Miller/pattern unification in Agda☆67Updated 3 months ago
- Self-contained repository for the eponymous paper☆30Updated 7 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago
- Algebraic, staged parsing for OCaml: typed, compositional, and faster than yacc☆104Updated 8 months ago
- Experimental type-checker for internally parametric type theory☆32Updated 10 months ago
- A clean implementation of Parsing with Zippers.☆38Updated 7 years ago
- Efficient binder representation in OCaml☆43Updated last year
- A nano "theorem prover".☆62Updated 6 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 7 months ago
- LL(1) parser generator verified in Coq☆48Updated 6 years ago
- A Datalog implementation with an OCaml inspired module system☆42Updated 7 years ago