bobatkey / sottLinks
Simplified Observational Type Theory
☆87Updated 2 years ago
Alternatives and similar repositories for sott
Users that are interested in sott are comparing it to the libraries listed below
Sorting:
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆74Updated 6 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- The Evolution of a Typechecker☆54Updated 7 years ago
- An experimental type checker for a modal dependent type theory.☆116Updated 5 years ago
- ☆84Updated last year
- Tiny type-checker with dependent types☆78Updated 12 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- System F-omega normalization by hereditary substitution in Agda☆62Updated 6 years ago
- Where my everyday research happens☆55Updated 2 weeks ago
- Self-contained repository for the eponymous paper☆30Updated 7 years ago
- A prototypical dependently typed languages with sized types and variances☆115Updated 2 weeks ago
- Toy typechecker for Insanely Dependent Types☆82Updated 3 months ago
- being the materials for Summer 2013's course☆113Updated 2 years ago
- being a thing I build on a Saturday☆28Updated 7 years ago
- being bits and pieces I'm inclined to leave lying around☆55Updated 6 months ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆53Updated 6 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- A tiny language for teaching and experimenting with Refinement Types☆49Updated 4 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆131Updated last year
- second-order abstract syntax☆31Updated 4 years ago
- Formalizing nbe in agda☆32Updated 13 years ago
- yacctt: Yet Another Cartesian Cubical Type Theory☆76Updated 7 years ago
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆82Updated 4 years ago
- Unification and type inference algorithms☆127Updated 10 years ago
- A small implementation of a proof refinement logic.☆50Updated 8 years ago
- Observational Type Theory as an Agda library☆56Updated 8 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆128Updated this week
- A self-contained repository for the paper Type and Scope Preserving Semantics☆23Updated 6 years ago
- Haskell implementation of nominal datatypes and functions☆44Updated 5 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆55Updated 8 years ago