ToTal / total
☆11Updated 8 years ago
Alternatives and similar repositories for total
Users that are interested in total are comparing it to the libraries listed below
Sorting:
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14Updated 8 years ago
- An implementation of (some fragment of) cubical type theory using rewrite rules, based on a talk given by Conor McBride at the 23rd Agda'…☆12Updated 8 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- SML implementation of System T from PFPL.☆11Updated 7 years ago
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- A discouraging story.☆15Updated 7 years ago
- being my notes and exercises for the Types Summer School in Ohrid, (FYRO) Macedonia, July 2017☆9Updated 7 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Updated 5 years ago
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22Updated 9 years ago
- Some basic categorical & algebraic structures for Standard ML☆9Updated 7 years ago
- what I did on my holidays☆12Updated 6 years ago
- An abstract machine using indexed containers and their zippers☆14Updated 8 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- A dependently typed type checker for a TT with intervals☆23Updated 5 years ago
- Haskell implementation of the Edinburgh Logical Framework☆28Updated 2 weeks ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- Type-Theory in Sequent Calculus☆13Updated 9 years ago
- Agda code for experimenting with internal models of cubical type theory☆14Updated 7 years ago
- Playing with incremental parsing and later compiler passes☆12Updated 6 years ago
- ☆11Updated 4 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 5 years ago
- STLC-related snippets in Agda☆16Updated 12 years ago
- being the materials from my YOW LambdaJam 2016 talk☆10Updated 8 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 3 years ago
- A type system for ML-style modules, solving the avoidance problem by focusing [Crary 2020]☆10Updated 4 years ago
- being an experiment with potato power☆23Updated 5 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 2 years ago
- Desc'n crunch: Descriptions, levitation, and reflecting the elaborator.☆11Updated 6 years ago