wilbowma / cic-redexLinks
A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.
☆34Updated 8 years ago
Alternatives and similar repositories for cic-redex
Users that are interested in cic-redex are comparing it to the libraries listed below
Sorting:
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 7 months ago
- Miller/pattern unification in Agda☆66Updated last month
- Fun plugin to play with the Gallina AST.☆38Updated 6 years ago
- A Racket library for interacting with Idris over the IDE protocol☆31Updated 8 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated last month
- A showcase of interesting code and proof developments in Cedille☆36Updated 6 months ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- A bare-bones LCF-style proof assistant☆25Updated 6 years ago
- A dynamically-typed CBPV language embedded in Racket☆39Updated last year
- A self-contained implementation of forward and backward inference for intuitionistic propositional logic☆18Updated 8 years ago
- Observational Type Theory as an Agda library☆56Updated 8 years ago
- The Prettiest Printer☆35Updated last year
- handouts and notes from the 2017 edition of the summer school☆39Updated 8 years ago
- IO using sized types and copatterns☆36Updated 4 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
- Formalizing nbe in agda☆32Updated 13 years ago
- being the beginnings of at least zero typecheckers☆34Updated 8 years ago
- A version of Epigram 1 that can run with newer GHCs☆54Updated 8 years ago
- Work in progress☆38Updated 6 months ago
- being bits and pieces I'm inclined to leave lying around☆55Updated 5 months ago
- Implementation of Nuprl's type theory in Coq☆46Updated last year
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆36Updated 9 months ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- A small implementation of a proof refinement logic.☆50Updated 8 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14Updated 8 years ago
- Harper's Modernized ALGOL in SML using multi-sorted nominal abstract binding trees☆15Updated 8 years ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆53Updated 6 years ago
- Logical relations proof in Agda☆27Updated 10 years ago