dbp / howtoproveacompilerLinks
Writeup that goes along with this:
☆40Updated 7 years ago
Alternatives and similar repositories for howtoproveacompiler
Users that are interested in howtoproveacompiler are comparing it to the libraries listed below
Sorting:
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- A proof tree viewer that works with Coq through Proof General☆28Updated 4 years ago
- A verified compiler for a lazy functional language☆37Updated last week
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆22Updated 8 months ago
- being an implementation of the calculus of constructions☆17Updated 2 years ago
- Command-like expressions for real infinite-precision calculations☆55Updated 4 months ago
- ☆46Updated 3 months ago
- Coq library on rewriting theory and termination☆37Updated 3 weeks ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago
- Verified Extraction from Rocq to OCaml/Malfunction☆13Updated 7 months ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- A LaTeX-typeset reproduction of Reynolds' "Types, Abstraction and Parametric Polymorphism"☆31Updated last year
- A pure type system implemented in OCaml☆78Updated 4 years ago
- Full implementation of F-ing Modules, with the power of sequent calculus☆20Updated 4 years ago
- A deterministic parser with fused lexing☆75Updated 2 years ago
- A tiny language for teaching and experimenting with Refinement Types☆49Updated 4 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆36Updated 9 months ago
- bidirectional type checking algorithms for higher-ranked polymorphism☆19Updated 3 years ago
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆82Updated 4 years ago
- A dependent type theory with user defined data types☆47Updated 4 years ago
- Fωμ type checker and compiler☆56Updated 2 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- Coq & Haskell code for Calculating Correct Compilers II☆12Updated 3 years ago
- Fun plugin to play with the Gallina AST.☆38Updated 6 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆85Updated 4 years ago
- Typing the linear pi calculus in Agda☆29Updated 3 years ago
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated 2 years ago
- Coq library for handling names☆19Updated 3 years ago
- We define a simple programming language, simp_lang, then instantiate Iris to verify simple simp_lang programs with concurrent separation …☆56Updated 5 months ago