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
- Malfunction backend for Idris with a FFI to OCaml☆28Updated 5 years ago
- A dependent type theory with user defined data types☆46Updated 3 years ago
- The artifact associated with "Parsing with Zippers (Functional Pearl)" (Darragh and Adams) to appear in ICFP 2020.☆28Updated last year
- A Toy Inverse Bidirectional Typechecker☆31Updated 6 years ago
- OCaml backend for Agda☆40Updated 6 years ago
- MetaML and MetaOCaml bibliography☆94Updated 7 months ago
- A clean implementation of Parsing with Zippers.☆38Updated 6 years ago
- mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics☆21Updated last year
- IO using sized types and copatterns☆35Updated 4 years ago
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆30Updated 3 years ago
- A prototype programming language for programming with runners☆90Updated 3 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 4 years ago
- Experimental functional language☆17Updated 3 years ago
- A Certified Interpreter for ML with Structural Polymorphism☆44Updated 3 months ago
- A Dependently Typed Programming Language☆27Updated 4 years ago
- FunTAL: mixing a functional language with assembly.☆40Updated 8 years ago
- An experimental type checker for a modal dependent type theory.☆112Updated 5 years ago
- source code for the bondi programming language☆40Updated 6 years ago
- The Alms Programming Language☆44Updated 6 years ago
- A bare-bones LCF-style proof assistant☆24Updated 5 years ago
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated 2 years ago
- Observational Type Theory as an Agda library☆53Updated 8 years ago
- ☆29Updated 9 years ago
- Parallel Environment for optimal Lambda Calculus Reduction☆28Updated 3 years ago
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- 🧊 An indexed construction of semi-simplicial and semi-cubical sets☆29Updated last week
- A showcase of interesting code and proof developments in Cedille☆36Updated last month
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- Algebraic, staged parsing for OCaml: typed, compositional, and faster than yacc☆101Updated 2 months ago