jozefg / blott
An experimental type checker for a modal dependent type theory.
☆110Updated 4 years ago
Alternatives and similar repositories for blott:
Users that are interested in blott are comparing it to the libraries listed below
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- ☆84Updated 7 years ago
- System F-omega normalization by hereditary substitution in Agda☆57Updated 5 years ago
- Toy typechecker for Insanely Dependent Types☆79Updated 11 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- A "implementation" of Girard's paradox in OCaml☆105Updated 9 years ago
- Agda formalisation of second-order abstract syntax☆53Updated 2 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 8 months ago
- A prototypical dependently typed languages with sized types and variances☆107Updated 2 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆70Updated 5 years ago
- Agda bindings to SMT-LIB2 compatible solvers.☆96Updated 4 months 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
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆54Updated 5 months ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 2 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆43Updated last year
- Unification and type inference algorithms☆124Updated 10 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆122Updated 8 months ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- Observational Type Theory as an Agda library☆52Updated 7 years ago
- Paper and talk☆51Updated last year
- A small implementation of a proof refinement logic.☆50Updated 7 years ago
- being the materials for Summer 2013's course☆112Updated last year
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆30Updated 3 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆71Updated 2 years ago
- Documentation on goals of the coq-community organization, the shared contributing guide and code of conduct.☆68Updated 10 months ago
- Old Coq plugin for parametricity [maintainer=@ppedrot]☆45Updated this week
- Experimental proof assistant (and architecture) for dependent linear logic☆47Updated 2 years ago
- ☆82Updated 9 months ago