david-christiansen / pudding-old
A language-integrated proof assistant, for and in Racket
☆39Updated 8 years ago
Alternatives and similar repositories for pudding-old:
Users that are interested in pudding-old are comparing it to the libraries listed below
- A Scheme-like CBPV language with Racket Interoperability☆39Updated last year
- A Racket library for interacting with Idris over the IDE protocol☆31Updated 7 years ago
- A bare-bones LCF-style proof assistant☆22Updated 5 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 7 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- A playground for type theory implementations in Racket☆20Updated 9 years ago
- ☆21Updated 7 years ago
- Martin-Löf Extensible Specification and Simulator☆29Updated 9 years ago
- Miller/pattern unification in Agda☆65Updated 11 years ago
- A miniKanren interpreter... in miniKanren. Relationally run your relations relationally!☆22Updated 9 years ago
- PLT Redex model of basic Dependently Typed Racket calculus☆18Updated 10 years ago
- Tool for detecting bad style in Standard ML programs☆16Updated 6 years ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 11 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- Racket bindings for Z3☆24Updated 5 years ago
- System F in coq.☆19Updated 10 years ago
- Haskell implementation of the Edinburgh Logical Framework☆27Updated 6 months ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 5 months ago
- The Prettiest Printer☆34Updated last year
- An idris backend compiling to chez scheme☆46Updated 7 years ago
- OCaml backend for Agda☆40Updated 6 years ago
- being the beginnings of at least zero typecheckers☆33Updated 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
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 7 years ago
- IO using sized types and copatterns☆34Updated 4 years ago
- Mirror of Conor McBride’s 2011 Agda course materials☆12Updated 6 years ago
- (Somewhat) Algebraic Data Types for Racket☆34Updated 2 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- A version of Epigram 1 that can run with newer GHCs☆52Updated 7 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago