ashinkarov / heh
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
- A simple implementation of linear type theory☆38Updated 7 years ago
- Example row-polymorphism implementations☆61Updated last year
- The compilation target that functional programmers always wanted.☆62Updated 4 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
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 10 months ago
- A Toy Inverse Bidirectional Typechecker☆31Updated 5 years ago
- A nano "theorem prover".☆62Updated 6 years ago
- IO using sized types and copatterns☆33Updated 4 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- Quantitative Type Theory implementation☆54Updated 3 years ago
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago
- source code for the bondi programming language☆40Updated 6 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆47Updated 2 years ago
- "operating system" based on the calculus of constructions☆18Updated 2 years ago
- mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics☆21Updated 10 months ago
- ☆29Updated 9 years ago
- OCaml backend for Idris2☆19Updated 4 years ago
- Miller/pattern unification in Agda☆65Updated 11 years ago
- The Alms Programming Language☆44Updated 6 years ago
- MetaML and MetaOCaml bibliography☆89Updated 4 months ago
- a self-hosting lambda calculus compiler☆35Updated 2 weeks ago
- Observational Type Theory as an Agda library☆52Updated 7 years ago
- A copy of Daan Leijen's reference implementation of HMF (type inference)☆16Updated 8 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 years ago
- Hindley-Milner type inference using constraints☆50Updated 8 years ago
- Idris Binary Integer Arithmetic, porting PArith, NArith, and ZArith from Coq☆36Updated 4 years ago
- Efficient binder representation in OCaml☆42Updated 9 months ago
- A Dependently Typed Programming Language☆27Updated 4 years ago
- LaTeX sources for the Habit Programming Language Report☆24Updated 6 years ago