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 8 years ago
- "operating system" based on the calculus of constructions☆18Updated 2 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
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- a self-hosting lambda calculus compiler☆35Updated last month
- IO using sized types and copatterns☆34Updated 4 years ago
- The artifact associated with "Parsing with Zippers (Functional Pearl)" (Darragh and Adams) to appear in ICFP 2020.☆27Updated last year
- Toy typechecker for Insanely Dependent Types☆79Updated 11 years ago
- The compilation target that functional programmers always wanted.☆62Updated 4 years ago
- ☆29Updated 9 years ago
- ☆60Updated 5 years ago
- A usable type system for call by push-value☆33Updated 5 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 10 months ago
- The Alms Programming Language☆44Updated 6 years ago
- Miller/pattern unification in Agda☆65Updated 11 years ago
- Example row-polymorphism implementations☆61Updated last year
- source code for the bondi programming language☆40Updated 6 years ago
- mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics☆21Updated 10 months ago
- Parallel Environment for optimal Lambda Calculus Reduction☆28Updated 2 years ago
- 🧊 An indexed construction of semi-simplicial and semi-cubical sets☆28Updated last week
- Implementation of Martin-Löf Type Theory in Haskell☆16Updated 9 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 3 years ago
- A nano "theorem prover".☆62Updated 6 years ago
- OCaml backend for Agda☆40Updated 6 years ago
- A Toy Inverse Bidirectional Typechecker☆31Updated 5 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 years ago
- Generation of abstract binding trees☆28Updated 6 months ago
- An interpreter for the concatenative language Joy, written in Haskell using extensible-effects☆35Updated 6 months ago
- A Datalog implementation with an OCaml inspired module system☆44Updated 6 years ago