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 verified compiler for a lazy functional language☆37Updated last week
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- bidirectional type checking algorithms for higher-ranked polymorphism☆19Updated 3 years ago
- Fωμ type checker and compiler☆54Updated 2 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆76Updated 3 weeks ago
- A deterministic parser with fused lexing☆74Updated 2 years ago
- A LaTeX-typeset reproduction of Reynolds' "Types, Abstraction and Parametric Polymorphism"☆30Updated last year
- 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 dependent type theory with user defined data types☆47Updated 3 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 4 years ago
- Duo - A research language exploring duality in programming language design☆57Updated 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
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆22Updated 4 months ago
- A repository for the material of my course on lambda-calculus and categories☆43Updated 4 years ago
- ☆28Updated last week
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 4 years ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- We define a simple programming language, simp_lang, then instantiate Iris to verify simple simp_lang programs with concurrent separation …☆55Updated 2 months ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 6 months ago
- ☆37Updated last month
- A tutorial on how Agda infers things☆61Updated 2 months ago
- being bits and pieces I'm inclined to leave lying around☆54Updated 2 months ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆62Updated last year
- Deadlock freedom by type checking☆20Updated 2 years ago
- Building A Correct-By-Construction Proof Checkers For Type Theories☆25Updated this week
- Template project for program verification in Coq, showcasing reasoning on CompCert's Clight language using the Verified Software Toolchai…☆32Updated last year
- being a particular fragment of Haskell, extended to a proof system☆34Updated last month