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
- Deadlock freedom by type checking☆19Updated last year
- A verified compiler for a lazy functional language☆34Updated last month
- A Toy Inverse Bidirectional Typechecker☆31Updated 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
- A dependent type theory with user defined data types☆46Updated 3 years ago
- LL(1) parser generator verified in Coq☆45Updated 5 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated 5 years ago
- Benchmark repository of polyglot effect handler examples☆23Updated 4 months ago
- bidirectional type checking algorithms for higher-ranked polymorphism☆19Updated 2 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 4 years ago
- an encoding of affine effect handlers using pthreads☆14Updated 2 years ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆35Updated last year
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- Formalization of Typed Assembly Language (TAL) in Coq☆17Updated last year
- a version of the 2048 game for Coq☆22Updated last year
- Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…☆22Updated 3 years ago
- The Steel separation logic library for F*☆33Updated last week
- 🩺 A library for compiler diagnostics☆38Updated last month
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- Examples from our paper "Capturing the Future by Replaying the Past"☆21Updated 6 months ago
- Stable sort algorithms and their stability proofs in Coq☆22Updated 2 weeks ago
- Efficient effect handlers based on Evidence Passing Semantics.☆28Updated 3 years ago
- Coq library for handling names☆19Updated 2 years ago
- Prototype code that accompanies the paper "Compiling Successor ML Pattern Guards"☆25Updated 2 years ago
- Public course materials for CSE 131 (Compilers)☆18Updated 4 years ago
- Full implementation of F-ing Modules, with the power of sequent calculus☆20Updated 4 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆47Updated 2 years ago
- Duo - A research language exploring duality in programming language design☆57Updated last year