dbp / howtoproveacompiler
Writeup that goes along with this:
☆39Updated 7 years ago
Alternatives and similar repositories for howtoproveacompiler:
Users that are interested in howtoproveacompiler are comparing it to the libraries listed below
- Coq library for handling names☆19Updated 2 years ago
- Simply typed lambda calculus in cubical agda☆21Updated 4 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- A LaTeX-typeset reproduction of Reynolds' "Types, Abstraction and Parametric Polymorphism"☆29Updated 6 months ago
- A Toy Inverse Bidirectional Typechecker☆31Updated 5 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 8 months ago
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 5 years ago
- LL(1) parser generator verified in Coq☆45Updated 5 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 2 months ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated 5 years ago
- Session types in Idris2!☆27Updated 4 years ago
- A simple supercompiler formally verified in Agda☆32Updated 7 years ago
- A verified compiler for a lazy functional language☆34Updated this week
- Full implementation of F-ing Modules, with the power of sequent calculus☆20Updated 3 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- Work in progress on semi-simplicial types☆23Updated 2 years ago
- A bare-bones LCF-style proof assistant☆21Updated 5 years ago
- A dependent type theory with user defined data types☆46Updated 3 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- Deadlock freedom by type checking☆19Updated last year
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- An extension of the NbE algorithm to produce computational traces☆21Updated 2 years ago
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated 2 years ago
- Verified C programming in Agda☆16Updated 3 years ago
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 7 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- Prototype code that accompanies the paper "Compiling Successor ML Pattern Guards"☆25Updated 2 years ago
- 🪆 A Staged Type Theory☆34Updated last year
- Haskell implementation of the Edinburgh Logical Framework☆27Updated 4 months ago