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:
- being an implementation of the calculus of constructions☆17Updated 2 years ago
- A LaTeX-typeset reproduction of Reynolds' "Types, Abstraction and Parametric Polymorphism"☆30Updated 11 months ago
- A style guide for Coq☆18Updated 3 years ago
- A verified compiler for a lazy functional language☆37Updated 2 weeks ago
- Duo - A research language exploring duality in programming language design☆57Updated 2 years ago
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆19Updated 3 months ago
- We define a simple programming language, simp_lang, then instantiate Iris to verify simple simp_lang programs with concurrent separation …☆52Updated last month
- Deadlock freedom by type checking☆20Updated 2 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆75Updated last week
- ☆35Updated 10 months ago
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- ♾️ A library for universe levels and universe polymorphism☆34Updated 8 months ago
- A proof tree viewer that works with Coq through Proof General☆28Updated 4 years ago
- A deterministic parser with fused lexing☆74Updated 2 years ago
- Verified Extraction from Rocq to OCaml/Malfunction☆13Updated 2 months ago
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆82Updated 3 years ago
- A rosetta stone for metaprogramming in Coq, with different examples of tactics, plugins, etc implemented in different metaprogramming lan…☆17Updated last year
- Typing the linear pi calculus in Agda☆29Updated 3 years ago
- Fωμ type checker and compiler☆54Updated 2 years ago
- A work-in-progress core language for Agda, in Agda☆55Updated 2 months ago
- Building A Correct-By-Construction Proof Checkers For Type Theories☆24Updated 2 weeks ago
- bidirectional type checking algorithms for higher-ranked polymorphism☆19Updated 3 years ago
- Finite sets and maps for Coq with extensional equality☆30Updated 2 months ago
- A dependent type theory with user defined data types☆47Updated 3 years ago
- an encoding of affine effect handlers using pthreads☆14Updated 2 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 4 months ago
- Logical Relation for MLTT in Coq☆27Updated last month
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Updated last year
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆25Updated 4 years ago