dbp / howtoproveacompilerLinks
Writeup that goes along with this:
☆40Updated 8 years ago
Alternatives and similar repositories for howtoproveacompiler
Users that are interested in howtoproveacompiler are comparing it to the libraries listed below
Sorting:
- being an implementation of the calculus of constructions☆17Updated 2 years ago
- Deadlock freedom by type checking☆20Updated 2 years ago
- Building A Correct-By-Construction Proof Checkers For Type Theories☆29Updated this week
- A LaTeX-typeset reproduction of Reynolds' "Types, Abstraction and Parametric Polymorphism"☆32Updated last year
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- Coq library on rewriting theory and termination☆37Updated last month
- Functions and proofs about game trees in Rocq, implemented as rose trees.☆11Updated last month
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- ☆42Updated 5 months ago
- LL(1) parser generator verified in Coq☆48Updated 5 years ago
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- ☆46Updated 4 months ago
- A deterministic parser with fused lexing☆75Updated 2 years ago
- Coq & Haskell code for Calculating Correct Compilers II☆12Updated 3 years ago
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆22Updated 8 months ago
- Typing the linear pi calculus in Agda☆29Updated 3 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆36Updated 10 months ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆80Updated 4 months ago
- ☆15Updated 5 months ago
- a version of the 2048 game for Coq☆22Updated 2 years ago
- Full implementation of F-ing Modules, with the power of sequent calculus☆20Updated 4 years ago
- Coq development for the course "Mechanized semantics", Collège de France, 2019-2020☆70Updated last year
- Monadic effects and equational reasoning in Rocq☆74Updated last month
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆68Updated last year
- Duo - A research language exploring duality in programming language design☆61Updated 2 years ago
- A dependent type theory with user defined data types☆47Updated 4 years ago
- Verified Extraction from Rocq to OCaml/Malfunction☆14Updated 7 months ago
- Coq library for handling names☆19Updated 3 years ago
- A verified compiler for a lazy functional language☆37Updated this week