granule-project / gerty
A small implementation of graded modal dependent type theory. A younger cousin to Granule.
☆56Updated 11 months ago
Alternatives and similar repositories for gerty:
Users that are interested in gerty are comparing it to the libraries listed below
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 9 months ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- A pure type system implemented in OCaml☆78Updated 4 years ago
- A dependent type theory with user defined data types☆46Updated 3 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- A bidirectional type checker☆62Updated 7 years ago
- Datatypes as quotients of polynomial functors☆35Updated 4 years ago
- A prototypical dependently typed languages with sized types and variances☆107Updated 2 years ago
- Demo for dependent types + runtime code generation☆68Updated last month
- A compiler and runtime for normalizing the untyped λ-calculus☆31Updated 3 years ago
- HoTT in Lean 3☆78Updated 4 years ago
- Normalization by evaluation for Martin-Löf Type Theory with dependent records☆97Updated 2 years ago
- A core language and API for dependently typed languages☆90Updated last month
- a functional programming language with algebraic effects and handlers☆81Updated last month
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago
- Toy typechecker for Insanely Dependent Types☆79Updated 11 years ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆35Updated last year
- Duo - A research language exploring duality in programming language design☆57Updated last year
- Build system☆123Updated last year
- A verified compiler for a lazy functional language☆34Updated last month
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆81Updated 3 years ago
- Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"☆131Updated 4 years ago
- Benchmarks for capture-avoiding substitution☆113Updated last week
- Staged compilation with dependent types☆170Updated 3 weeks ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 4 years ago
- Specification of the Cedille Core language☆29Updated 4 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆47Updated 2 years ago
- high-performance cubical evaluation☆70Updated 4 months ago
- LLVM code generation in Haskell☆54Updated 5 months ago
- ICFP tutorial☆39Updated 3 years ago