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:
- ☆46Updated 3 months ago
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- A verified compiler for a lazy functional language☆37Updated this week
- A bare-bones LCF-style proof assistant☆25Updated 6 years ago
- Coq library on rewriting theory and termination☆37Updated last week
- Duo - A research language exploring duality in programming language design☆61Updated 2 years ago
- being an implementation of the calculus of constructions☆17Updated 2 years ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆79Updated 3 months ago
- ☆41Updated 4 months ago
- A dependent type theory with user defined data types☆47Updated 4 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- Coq library for handling names☆19Updated 3 years ago
- Fωμ type checker and compiler☆56Updated 2 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆84Updated 4 years ago
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆22Updated 7 months ago
- Building A Correct-By-Construction Proof Checkers For Type Theories☆29Updated last week
- A tutorial on how Agda infers things☆63Updated 5 months ago
- A work-in-progress core language for Agda, in Agda☆61Updated last week
- Setoid type theory implementation☆38Updated 2 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 deterministic parser with fused lexing☆74Updated 2 years ago
- ♾️ A library for universe levels and universe polymorphism☆35Updated 2 weeks ago
- bidirectional type checking algorithms for higher-ranked polymorphism☆19Updated 3 years ago
- # A simple variable binding library based on well-scoped indices and environments☆27Updated last month
- ☆51Updated 3 months ago
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- being a particular fragment of Haskell, extended to a proof system☆42Updated last week
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆36Updated 8 months ago
- A pure type system implemented in OCaml☆78Updated 4 years ago