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 5 months ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Miller/pattern unification in Agda☆68Updated 11 years ago
- A bare-bones LCF-style proof assistant☆24Updated 6 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- A Racket library for interacting with Idris over the IDE protocol☆31Updated 7 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 4 months ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated 4 months ago
- Observational Type Theory as an Agda library☆56Updated 8 years ago
- Work in progress☆38Updated 4 months ago
- being bits and pieces I'm inclined to leave lying around☆54Updated 3 months ago
- IO using sized types and copatterns☆36Updated 4 years ago
- System F in coq.☆19Updated 10 years ago
- being the beginnings of at least zero typecheckers☆34Updated 8 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 5 years ago
- Fun plugin to play with the Gallina AST.☆38Updated 6 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 3 months ago
- Martin-Löf Extensible Specification and Simulator☆29Updated 10 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- Formalizing nbe in agda☆31Updated 12 years ago
- Mtac in Agda☆28Updated 4 years ago
- Implementation of Nuprl's type theory in Coq☆46Updated 10 months ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 8 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 7 months ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated this week
- A version of Epigram 1 that can run with newer GHCs☆54Updated 8 years ago
- A playground for type theory implementations in Racket☆20Updated 9 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆53Updated 6 years ago
- A language-integrated proof assistant, for and in Racket☆39Updated 9 years ago