david-christiansen / tt-playgroundLinks
A playground for type theory implementations in Racket
☆20Updated 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:
- A Racket library for interacting with Idris over the IDE protocol☆31Updated 8 years ago
- A language-integrated proof assistant, for and in Racket☆39Updated 9 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- SML implementation of System T from PFPL.☆11Updated 8 years ago
- Agda formalization of the paper, "Higher-Order Functions and Brouwer's Thesis". Deduces a Brouwer ordinal from a function ((nat -> nat) -…☆13Updated 5 years ago
- Martin-Löf Extensible Specification and Simulator☆29Updated 10 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 8 years ago
- ☆21Updated 8 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 8 years ago
- A small implementation of a proof refinement logic.☆50Updated 8 years ago
- Miller/pattern unification in Agda☆66Updated 2 months ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 9 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated last year
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22Updated 9 years ago
- Typecoin: Massively Multiplayer Online Linear Logic☆18Updated 8 years ago
- System F in coq.☆19Updated 10 years ago
- Domain theory and denotational semantics in Coq☆10Updated 11 years ago
- A dynamically-typed CBPV language embedded in Racket☆39Updated last year
- PLT Redex model of basic Dependently Typed Racket calculus☆18Updated 10 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 7 months ago
- being the beginnings of at least zero typecheckers☆34Updated 8 years ago
- An abstract machine using indexed containers and their zippers☆13Updated 9 years ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆53Updated 6 years ago
- Coq proof for the paper "Compiling a Fifty Year Journey"☆13Updated 8 years ago
- second-order abstract syntax☆31Updated 4 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- Control.Effects☆19Updated 6 years ago
- System POSIX bindings for Idris.☆36Updated 6 years ago