dbp / howtoproveacompiler
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:
- LL(1) parser generator verified in Coq☆46Updated 5 years ago
- A verified compiler for a lazy functional language☆35Updated this week
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated last month
- Deadlock freedom by type checking☆20Updated last year
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- A Toy Inverse Bidirectional Typechecker☆31Updated 6 years ago
- 🪆 A Staged Type Theory☆35Updated 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 tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆36Updated last year
- Prototype code that accompanies the paper "Compiling Successor ML Pattern Guards"☆25Updated 2 years ago
- 🩺 A library for compiler diagnostics☆45Updated 3 months ago
- A dependent type theory with user defined data types☆46Updated 3 years ago
- ☆33Updated 7 months ago
- Formalization of Typed Assembly Language (TAL) in Coq☆17Updated last year
- Efficient effect handlers based on Evidence Passing Semantics.☆29Updated 4 years ago
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- Full implementation of F-ing Modules, with the power of sequent calculus☆20Updated 4 years ago
- A rosetta stone for metaprogramming in Coq, with different examples of tactics, plugins, etc implemented in different metaprogramming lan…☆17Updated last year
- A bare-bones LCF-style proof assistant☆22Updated 5 years ago
- A simple implementation of XTT, "A cubical language for Bishop sets"☆26Updated 3 years ago
- Benchmark repository of polyglot effect handler examples☆24Updated last month
- Experimental type-checker for internally parametric type theory☆32Updated last month
- Haskell implementation of the Edinburgh Logical Framework☆27Updated last week
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- Lambda normalization and conversion checking benchmarks for various implementations☆57Updated 4 years ago
- ModTT in Agda☆11Updated 3 years ago
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆19Updated 2 weeks ago
- mirror of A simple type-theoretic language: Mini-TT☆38Updated 8 years ago