bobatkey / sott
Simplified Observational Type Theory
☆81Updated last year
Related projects ⓘ
Alternatives and complementary repositories for sott
- The Evolution of a Typechecker☆54Updated 5 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆70Updated 2 years ago
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆70Updated 5 years ago
- Prototype implementations of systems based on setoid type theory☆64Updated 3 years ago
- Tiny type-checker with dependent types☆76Updated 10 years ago
- A prototypical dependently typed languages with sized types and variances☆104Updated 2 years ago
- Haskell implementation of nominal datatypes and functions☆39Updated 4 years ago
- second-order abstract syntax☆31Updated 3 years ago
- Where my everyday research happens☆53Updated last week
- A small implementation of a proof refinement logic.☆50Updated 7 years ago
- Automatically exported from code.google.com/p/trellys☆46Updated 5 years ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated last year
- ☆80Updated 6 months ago
- Unification and type inference algorithms☆123Updated 9 years ago
- being the materials for Summer 2013's course☆110Updated last year
- Self-contained repository for the eponymous paper☆29Updated 5 years ago
- ☆47Updated last month
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- Observational Type Theory as an Agda library☆50Updated 7 years ago
- Work on type class deriving with elaboration reflection☆31Updated 6 years ago
- Formalizing nbe in agda☆30Updated 12 years ago
- A Specification for Dependent Types in Haskell (Core)☆65Updated 2 years ago
- Formalising Type Theory in a modular way for translations between type theories☆90Updated 6 years ago
- Compiler for type theoretic lambda calculi equipped with system primtives which compiles side-effecting, strict expressions into efficien…☆42Updated 5 years ago
- Library of categories, with categorical constructions on them☆54Updated last year
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated 8 months ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆42Updated 10 months ago
- A "implementation" of Girard's paradox in OCaml☆105Updated 9 years ago
- ☆82Updated 7 years ago