pa-ba / calc-compLinks
Coq proofs for the paper "Calculating Correct Compilers"
☆30Updated last year
Alternatives and similar repositories for calc-comp
Users that are interested in calc-comp are comparing it to the libraries listed below
Sorting:
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- System F in coq.☆19Updated 10 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- A Racket library for interacting with Idris over the IDE protocol☆31Updated 7 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.☆54Updated 5 years ago
- Miller/pattern unification in Agda☆65Updated 11 years ago
- Haskell implementation of the Edinburgh Logical Framework☆28Updated 3 weeks ago
- OCaml backend for Agda☆40Updated 6 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- The Prettiest Printer☆34Updated last year
- A Specification for Dependent Types in Haskell (Core)☆64Updated 2 years ago
- Automatically exported from code.google.com/p/trellys☆46Updated 5 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- A small implementation of a proof refinement logic.☆50Updated 7 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆73Updated 3 years ago
- ☆26Updated 8 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
- being the beginnings of at least zero typecheckers☆33Updated 8 years ago
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated 2 years ago
- A version of Epigram 1 that can run with newer GHCs☆52Updated 7 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- ☆82Updated last year
- Replib: generic programming & Unbound: generic treatment of binders☆45Updated 2 years ago
- A bare-bones LCF-style proof assistant☆24Updated 5 years ago
- PLT Redex model of basic Dependently Typed Racket calculus☆18Updated 10 years ago
- A language-integrated proof assistant, for and in Racket☆39Updated 8 years ago
- Implementation of Nuprl's type theory in Coq☆45Updated 5 months ago