bobatkey / sottLinks
Simplified Observational Type Theory
☆83Updated 2 years ago
Alternatives and similar repositories for sott
Users that are interested in sott are comparing it to the libraries listed below
Sorting:
- The Evolution of a Typechecker☆54Updated 6 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆71Updated 6 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- An experimental type checker for a modal dependent type theory.☆112Updated 5 years ago
- A prototypical dependently typed languages with sized types and variances☆109Updated 2 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆73Updated 3 years ago
- ☆47Updated 3 weeks ago
- IO using sized types and copatterns☆35Updated 4 years ago
- Observational Type Theory as an Agda library☆53Updated 8 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 4 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 10 months ago
- ☆83Updated last year
- Replib: generic programming & Unbound: generic treatment of binders☆45Updated 2 years ago
- A simple Depdently-Typed Language for Research and Learning☆57Updated 8 years ago
- Where my everyday research happens☆53Updated last week
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- A "implementation" of Girard's paradox in OCaml☆108Updated 10 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Example row-polymorphism implementations☆61Updated last year
- A small implementation of a proof refinement logic.☆50Updated 7 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 2 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- Formalizing nbe in agda☆31Updated 12 years ago
- Implementation for ICFP 2020 paper☆53Updated 3 years ago
- Compiler for type theoretic lambda calculi equipped with system primtives which compiles side-effecting, strict expressions into efficien…☆43Updated 5 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- yacctt: Yet Another Cartesian Cubical Type Theory☆75Updated 6 years ago
- Formalising Type Theory in a modular way for translations between type theories☆95Updated 7 years ago