david-christiansen / pudding-oldLinks
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
Sorting:
- 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 Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- A playground for type theory implementations in Racket☆20Updated 9 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- A bare-bones LCF-style proof assistant☆24Updated 5 years ago
- Martin-Löf Extensible Specification and Simulator☆29Updated 9 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- Miller/pattern unification in Agda☆65Updated 11 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 7 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
- ☆21Updated 8 years ago
- Coq proof for the paper "Compiling a Fifty Year Journey"☆13Updated 7 years ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 11 years ago
- The Prettiest Printer☆34Updated last year
- PLT Redex model of basic Dependently Typed Racket calculus☆18Updated 10 years ago
- System F in coq.☆19Updated 10 years ago
- Fintie Sets in Cubical Agda☆12Updated 5 years ago
- An abstract machine using indexed containers and their zippers☆14Updated 8 years ago
- A miniKanren interpreter... in miniKanren. Relationally run your relations relationally!☆22Updated 9 years ago
- OCaml backend for Agda☆40Updated 6 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- A version of Epigram 1 that can run with newer GHCs☆52Updated 7 years ago
- being the programs and code for a paper about general recursion☆25Updated 10 years ago
- Racket bindings for Z3☆24Updated 6 years ago
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 7 years ago
- Coq proofs for the paper "Calculating Correct Compilers"☆30Updated last year
- Agda formalization of Intuitionistic Propositional Logic☆22Updated 2 weeks ago
- MPRI-2.4 Dependently-typed Functional Programming☆32Updated 4 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago