brendanzab / rust-nbe-for-mlttLinks
Normalization by evaluation for Martin-Löf Type Theory with dependent records
☆98Updated 3 years ago
Alternatives and similar repositories for rust-nbe-for-mltt
Users that are interested in rust-nbe-for-mltt are comparing it to the libraries listed below
Sorting:
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆60Updated last year
- (WIP) Dependently-typed programming language with Agda style dependent pattern matching☆80Updated 4 years ago
- A dependent type theory with user defined data types☆46Updated 3 years ago
- Dependently-typed row-polymorphic programming language, evolved from minitt-rs☆97Updated 4 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 3 years ago
- An experimental type checker for a modal dependent type theory.☆112Updated 5 years ago
- ☆90Updated 3 years ago
- A type checker for the Lean theorem prover☆41Updated 4 years ago
- Implementation of "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism"☆112Updated 6 years ago
- Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"☆131Updated 4 years ago
- Automagical variable binding library for Rust☆67Updated 5 years ago
- A prototypical dependently typed languages with sized types and variances☆109Updated 2 years ago
- Inigo: A Package Manager for Idris2☆62Updated 2 years ago
- 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
- Higher kinded polymorphism in a language with unboxed, statically sized datatypes.☆51Updated 5 months ago
- Duo - A research language exploring duality in programming language design☆57Updated 2 years ago
- Hindley-Milner type inference using constraints☆50Updated 8 years ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Updated last year
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆30Updated 3 years ago
- ☆39Updated 11 months ago
- Refinement types + dependent types = ❤️☆58Updated 2 years ago
- An implementation of a predicative polymorphic language with bidirectional type inference and algebraic data types☆90Updated 2 years ago
- A compiler and runtime for normalizing the untyped λ-calculus☆31Updated 3 years ago
- Accessing Agda's interaction mode via command line & external tactic for Agda.☆26Updated 4 years ago
- The essence of Rust.☆125Updated 3 years ago
- A pure type system implemented in OCaml☆78Updated 4 years ago
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- ☆35Updated 6 years ago
- Implementing the type system described in the paper "Complete and Easy Bidirectional Type Inference" in Rust☆46Updated 9 years ago
- Oversimplified version of Simple-sub: without recursive types, without nested let polymorphism, and with approximated type-variable-to-ty…☆26Updated 3 years ago