pa-ba / calc-compLinks
Coq proofs for the paper "Calculating Correct Compilers"
☆31Updated 2 years ago
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
- Miller/pattern unification in Agda☆66Updated 2 months ago
- Automatically exported from code.google.com/p/trellys☆47Updated 6 years ago
- being the beginnings of at least zero typecheckers☆34Updated 8 years ago
- System F in coq.☆19Updated 10 years ago
- A version of Epigram 1 that can run with newer GHCs☆55Updated 8 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 8 months ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆53Updated 6 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 8 years ago
- Link to preprints for POPL'18 and colocated events☆86Updated 7 years ago
- being some experiments, working towards some equipment I wish I had☆37Updated 9 years ago
- A classical propositional theorem prover in Haskell, using Wang's Algorithm.☆36Updated 6 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 3 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- A small implementation of a proof refinement logic.☆50Updated 8 years ago
- An interactive theorem prover based on lambda-tree syntax☆98Updated this week
- The Prettiest Printer☆35Updated last year
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- Tiny type-checker with dependent types☆78Updated 12 years ago
- Martin-Löf Extensible Specification and Simulator☆29Updated 10 years ago
- The Mechanization of Standard ML☆74Updated 3 years ago
- Observational Type Theory as an Agda library☆56Updated 8 years ago
- A dynamically-typed CBPV language embedded in Racket☆39Updated last year
- "Toy" SMT Solver for Educational Purposes☆20Updated 12 years ago
- Resurrecting Lennart Augustsson's implementation of Cayenne☆38Updated 12 years ago
- An implementation of Typed Assembly Language (Morrisett, Walker, Crary, Glew)☆150Updated 4 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆46Updated 3 years ago
- higher order dependently typed logic programing☆173Updated 7 years ago
- A Racket library for interacting with Idris over the IDE protocol☆31Updated 8 years ago