david-christiansen / tt-playgroundView external linksLinks
A playground for type theory implementations in Racket
☆20Dec 2, 2015Updated 10 years ago
Alternatives and similar repositories for tt-playground
Users that are interested in tt-playground are comparing it to the libraries listed below
Sorting:
- An implementation of (some fragment of) cubical type theory using rewrite rules, based on a talk given by Conor McBride at the 23rd Agda'…☆12Aug 5, 2016Updated 9 years ago
- A language-integrated proof assistant, for and in Racket☆39Aug 26, 2016Updated 9 years ago
- A Racket library for interacting with Idris over the IDE protocol☆31Nov 10, 2017Updated 8 years ago
- Implementation of Nuprl's type theory in Coq☆46Dec 3, 2024Updated last year
- A dependently typed programming language, and verification tool☆27Apr 3, 2016Updated 9 years ago
- An Introduction to Redex with Abstracting Abstract Machines☆104Mar 21, 2024Updated last year
- Strange Loop 2015 talk: knot notation, enumeration, and drawing☆31Sep 27, 2015Updated 10 years ago
- An interactive interpreter for asynchronous algebraic effects☆15Jun 19, 2024Updated last year
- ☆11Jul 20, 2016Updated 9 years ago
- being the beginnings of at least zero typecheckers☆34Apr 13, 2017Updated 8 years ago
- being the materials for CS410 Advanced Functional Programming in the 2015/16 session☆40May 24, 2016Updated 9 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Dec 15, 2016Updated 9 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22May 13, 2016Updated 9 years ago
- Domain theory and denotational semantics in Coq☆10Dec 13, 2014Updated 11 years ago
- A version of Epigram 1 that can run with newer GHCs☆55Jul 22, 2017Updated 8 years ago
- Agda formalization of the paper, "Higher-Order Functions and Brouwer's Thesis". Deduces a Brouwer ordinal from a function ((nat -> nat) -…☆13Sep 22, 2020Updated 5 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34May 27, 2017Updated 8 years ago
- Tuple data type and utility functions☆26Sep 17, 2022Updated 3 years ago
- SML implementation of System T from PFPL.☆11Jun 28, 2017Updated 8 years ago
- ☆13Nov 21, 2025Updated 2 months ago
- ☆11Aug 11, 2016Updated 9 years ago
- A discouraging story.☆16May 8, 2018Updated 7 years ago
- An proof refinement logic for computational type theory. Inspired by Nuprl. [For up-to-date development, see JonPRL's successor, RedPRL: …☆110Feb 20, 2019Updated 6 years ago
- Work in progress☆40Jun 7, 2025Updated 8 months ago
- Web based opetopic editor☆36Oct 21, 2024Updated last year
- ☆29Sep 14, 2015Updated 10 years ago
- Agda code for experimenting with internal models of cubical type theory☆15Apr 3, 2018Updated 7 years ago
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Feb 13, 2018Updated 8 years ago
- An experimental type checker for a modal dependent type theory.☆116May 9, 2020Updated 5 years ago
- Martin-Löf Extensible Specification and Simulator☆29Jul 1, 2015Updated 10 years ago
- ☆64Jun 24, 2019Updated 6 years ago
- Leibniz Equality☆19Jun 7, 2018Updated 7 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
- A thicker variant of Latin Modern Roman☆15Jun 6, 2025Updated 8 months ago
- A miniKanren interpreter... in miniKanren. Relationally run your relations relationally!☆24May 1, 2016Updated 9 years ago
- Optimizing Abstract Abstract Machines☆31Apr 6, 2017Updated 8 years ago
- A small implementation of a proof refinement logic.☆50Jul 3, 2017Updated 8 years ago
- A type checker for the Lean theorem prover☆40Mar 6, 2021Updated 4 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Oct 1, 2017Updated 8 years ago