david-christiansen / tt-playgroundLinks
A playground for type theory implementations in Racket
☆20Updated 9 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:
- A Racket library for interacting with Idris over the IDE protocol☆31Updated 7 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 7 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- Type theory in type theory☆16Updated 13 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- Agda formalization of the paper, "Higher-Order Functions and Brouwer's Thesis". Deduces a Brouwer ordinal from a function ((nat -> nat) -…☆12Updated 4 years ago
- A language-integrated proof assistant, for and in Racket☆39Updated 8 years ago
- Martin-Löf Extensible Specification and Simulator☆29Updated 9 years ago
- being the programs and code for a paper about general recursion☆25Updated 10 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22Updated 9 years ago
- ☆12Updated 5 years ago
- A miniKanren interpreter... in miniKanren. Relationally run your relations relationally!☆22Updated 9 years ago
- An abstract machine using indexed containers and their zippers☆14Updated 8 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 3 years ago
- Mirror of Conor McBride’s 2011 Agda course materials☆12Updated 6 years ago
- ☆21Updated 8 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- Typecoin: Massively Multiplayer Online Linear Logic☆18Updated 8 years ago
- A dependently typed type checker for a TT with intervals☆23Updated 5 years ago
- ☆18Updated 3 years ago
- SML implementation of System T from PFPL.☆11Updated 7 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 6 months ago
- being a collection of Agda-facilitated ramblings☆33Updated 5 years ago
- A Scheme-like CBPV language with Racket Interoperability☆39Updated last year
- being the beginnings of at least zero typecheckers☆34Updated 8 years ago
- ☆17Updated 6 years ago
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14Updated 8 years ago
- ☆23Updated 7 years ago