jozefg / blottLinks
An experimental type checker for a modal dependent type theory.
☆112Updated 5 years ago
Alternatives and similar repositories for blott
Users that are interested in blott are comparing it to the libraries listed below
Sorting:
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 3 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆128Updated last year
- System F-omega normalization by hereditary substitution in Agda☆59Updated 5 years ago
- A prototypical dependently typed languages with sized types and variances☆111Updated last week
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆75Updated 3 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆82Updated 3 years ago
- MetaML and MetaOCaml bibliography☆94Updated 8 months ago
- Notes and handouts from OPLSS 2018☆55Updated 7 years ago
- being the materials for a paper I have in mind to write about the bidirectional discipline☆52Updated last week
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- ☆86Updated last year
- Automatically exported from code.google.com/p/trellys☆47Updated 6 years ago
- An interactive theorem prover based on lambda-tree syntax☆96Updated 2 months ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- being bits and pieces I'm inclined to leave lying around☆53Updated last month
- Toy typechecker for Insanely Dependent Types☆81Updated 11 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 3 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆75Updated this week
- An enhanced unification algorithm for Coq☆56Updated 3 months ago
- Simplified Observational Type Theory☆83Updated 2 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Work in progress☆37Updated last month
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆83Updated 9 years ago
- A "implementation" of Girard's paradox in OCaml☆109Updated 10 years ago
- Benchmarks for capture-avoiding substitution☆119Updated 2 months ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- A version of Epigram 1 that can run with newer GHCs☆53Updated 8 years ago