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:
- ☆38Updated last month
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆22Updated 5 months ago
- Building A Correct-By-Construction Proof Checkers For Type Theories☆26Updated this week
- A verified compiler for a lazy functional language☆37Updated last week
- being an implementation of the calculus of constructions☆17Updated 2 years ago
- A LaTeX-typeset reproduction of Reynolds' "Types, Abstraction and Parametric Polymorphism"☆30Updated last year
- Duo - A research language exploring duality in programming language design☆57Updated 2 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- ☆41Updated 3 weeks ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 6 months ago
- Coq development for the course "Mechanized semantics", Collège de France, 2019-2020☆68Updated last year
- ♾️ A library for universe levels and universe polymorphism☆35Updated last month
- A style guide for Coq☆18Updated 3 years ago
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- ☆48Updated last month
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- Deadlock freedom by type checking☆20Updated 2 years ago
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆78Updated last month
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- Mechanizations of Type Theories☆32Updated last month
- Lambda normalization and conversion checking benchmarks for various implementations☆59Updated 4 years ago
- Finite sets and maps for Coq with extensional equality☆30Updated 4 months ago
- A cost-aware logical framework, embedded in Agda.☆66Updated last week
- a version of the 2048 game for Coq☆22Updated 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
- A tutorial on how Agda infers things☆61Updated 2 months ago
- Gallina to Bedrock2 compilation toolkit☆60Updated last week
- A bare-bones LCF-style proof assistant☆24Updated 6 years ago
- Yet another plugin tutorial, this time as an exercise for 598☆38Updated 2 years ago