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:
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆81Updated 3 years ago
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- A verified compiler for a lazy functional language☆36Updated 3 weeks ago
- A dependent type theory with user defined data types☆46Updated 3 years ago
- Prototype code that accompanies the paper "Compiling Successor ML Pattern Guards"☆25Updated 2 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
- Deadlock freedom by type checking☆20Updated 2 years ago
- Fωμ type checker and compiler☆54Updated 2 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- A bare-bones LCF-style proof assistant☆24Updated 5 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 4 months ago
- Full implementation of F-ing Modules, with the power of sequent calculus☆20Updated 4 years ago
- bidirectional type checking algorithms for higher-ranked polymorphism☆19Updated 3 years ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆83Updated 5 years ago
- ☆35Updated 9 months ago
- Dafny for Metatheory of Programming Languages☆25Updated 2 months ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆75Updated last week
- We define a simple programming language, simp_lang, then instantiate Iris to verify simple simp_lang programs with concurrent separation …☆52Updated 2 weeks ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- A deterministic parser with fused lexing☆73Updated 2 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆19Updated 2 months ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 4 years ago
- Finite sets and maps for Coq with extensional equality☆30Updated last month
- The Evolution of a Typechecker☆54Updated 6 years ago
- a version of the 2048 game for Coq☆22Updated last year
- Haskell implementation of the Edinburgh Logical Framework☆30Updated 2 months ago
- being an implementation of the calculus of constructions☆17Updated 2 years ago
- Duo - A research language exploring duality in programming language design☆57Updated 2 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago