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 2 months ago
- Miller/pattern unification in Agda☆65Updated 11 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- A bare-bones LCF-style proof assistant☆24Updated 5 years ago
- A Racket library for interacting with Idris over the IDE protocol☆31Updated 7 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated last month
- Fun plugin to play with the Gallina AST.☆38Updated 5 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated last month
- a version of the 2048 game for Coq☆22Updated last year
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆74Updated 3 years ago
- Work in progress☆37Updated last month
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 12 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
- A dynamically-typed CBPV language embedded in Racket☆39Updated last year
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 4 months ago
- being bits and pieces I'm inclined to leave lying around☆53Updated last month
- Observational Type Theory as an Agda library☆54Updated 8 years ago
- An experimental type checker for a modal dependent type theory.☆112Updated 5 years ago
- being the beginnings of at least zero typecheckers☆34Updated 8 years ago
- ☆18Updated 3 years ago
- A language-integrated proof assistant, for and in Racket☆39Updated 8 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 3 weeks ago
- A playground for type theory implementations in Racket☆20Updated 9 years ago
- Implementation of sprintf for Coq☆18Updated 5 years ago
- ☆11Updated 5 years ago
- A small implementation of a proof refinement logic.☆50Updated 8 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 8 years ago
- Agda formalisation of dual-context constructive modal logics.☆20Updated 5 years ago