Simplified Observational Type Theory
☆87Feb 17, 2026Updated last month
Alternatives and similar repositories for sott
Users that are interested in sott are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- A version of Epigram 1 that can run with newer GHCs☆55Jul 22, 2017Updated 8 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14May 15, 2017Updated 8 years ago
- being the introduction to co-de-Bruijn metasyntax☆23Apr 29, 2022Updated 3 years ago
- Domain theory and denotational semantics in Coq☆10Dec 13, 2014Updated 11 years ago
- Typecoin: Massively Multiplayer Online Linear Logic☆18May 5, 2017Updated 8 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34May 27, 2017Updated 8 years ago
- Formalising Type Theory in a modular way for translations between type theories☆95Jan 10, 2018Updated 8 years ago
- An experimental type checker for a modal dependent type theory.☆116May 9, 2020Updated 5 years ago
- Formalizations of strong normalization proofs☆35Jul 8, 2019Updated 6 years ago
- being the emperor of Mongo, but also a verb☆15Dec 25, 2018Updated 7 years ago
- being a thing I build on a Saturday☆28Mar 5, 2018Updated 8 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Nov 14, 2025Updated 4 months ago
- what I did on my holidays☆12Jul 9, 2018Updated 7 years ago
- Specification of Agda.☆25Jan 13, 2019Updated 7 years ago
- A polynomial model of a Martin-Löf type theory + a bit of game semantics☆31Dec 3, 2021Updated 4 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Dec 21, 2019Updated 6 years ago
- Mtac in Agda☆29May 4, 2021Updated 4 years ago
- Haskell implementation of the Edinburgh Logical Framework☆32Jan 12, 2026Updated 2 months ago
- being the beginnings of at least zero typecheckers☆34Apr 13, 2017Updated 8 years ago
- ☆20Aug 13, 2024Updated last year
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Mar 5, 2022Updated 4 years ago
- Agda suffices: software written from A to Z in Agda☆16Mar 31, 2019Updated 6 years ago
- a compiler from a lambda language to an assembly language, as a rewrite system☆16Sep 23, 2025Updated 5 months ago
- being bits and pieces I'm inclined to leave lying around☆58Mar 11, 2026Updated last week
- A small implementation of higher-order unification☆192Aug 6, 2017Updated 8 years ago
- Type Theory with Indexed Equality☆26Apr 7, 2017Updated 8 years ago
- SML implementation of System T from PFPL.☆11Jun 28, 2017Updated 8 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Sep 6, 2017Updated 8 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆133Jun 5, 2024Updated last year
- An implementation of Typed Assembly Language (Morrisett, Walker, Crary, Glew)☆150Sep 30, 2021Updated 4 years ago
- Observational Type Theory as an Agda library☆59May 27, 2017Updated 8 years ago
- Where my everyday research happens☆56Mar 10, 2026Updated last week
- Experimental type-checker for internally parametric type theory☆32Mar 27, 2025Updated 11 months ago
- A small Haskell implementation of Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism☆101May 9, 2017Updated 8 years ago
- 👹 A library for hierarchical names and lexical scoping☆26Nov 21, 2025Updated 4 months ago
- Interpreter for functional pure type systems.☆21Jun 30, 2017Updated 8 years ago
- System F-omega normalization by hereditary substitution in Agda☆62Aug 31, 2019Updated 6 years ago
- Hopefully verifiable code generation in GHC☆93May 10, 2017Updated 8 years ago
- A clean implementation of Parsing with Zippers.☆38Sep 22, 2018Updated 7 years ago