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
- A Toy Inverse Bidirectional Typechecker☆31Updated 5 years ago
- LL(1) parser generator verified in Coq☆46Updated 5 years ago
- bidirectional type checking algorithms for higher-ranked polymorphism☆19Updated 3 years ago
- Deadlock freedom by type checking☆20Updated last year
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 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
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated last month
- Examples from our paper "Capturing the Future by Replaying the Past"☆21Updated 7 months ago
- A dependent type theory with user defined data types☆46Updated 3 years ago
- A verified compiler for a lazy functional language☆35Updated this week
- 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☆35Updated last year
- An extension of the NbE algorithm to produce computational traces☆21Updated 2 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 3 weeks ago
- Coq library for handling names☆19Updated 2 years ago
- 🩺 A library for compiler diagnostics☆43Updated 2 months ago
- Efficient effect handlers based on Evidence Passing Semantics.☆28Updated 4 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆47Updated 2 years ago
- Experimental functional language☆17Updated 2 years ago
- 🪆 A Staged Type Theory☆35Updated last year
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- A simple implementation of XTT, "A cubical language for Bishop sets"☆26Updated 3 years ago
- Haskell implementation of the Edinburgh Logical Framework☆27Updated 6 months ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- being an implementation of the calculus of constructions☆15Updated 2 years ago
- Benchmark repository of polyglot effect handler examples☆23Updated last week
- A toy dependent typed language.☆28Updated this week
- ☆17Updated last year
- ☆29Updated 2 years ago