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
- Deadlock freedom by type checking☆19Updated last year
- bidirectional type checking algorithms for higher-ranked polymorphism☆19Updated 3 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated this week
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- LL(1) parser generator verified in Coq☆45Updated 5 years ago
- Prototype code that accompanies the paper "Compiling Successor ML Pattern Guards"☆25Updated 2 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- A verified compiler for a lazy functional language☆34Updated last month
- A dependent type theory with user defined data types☆46Updated 3 years ago
- Demo for dependent types + runtime code generation☆67Updated last month
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆81Updated 3 years ago
- Haskell implementation and Coq proof for an implicit polymorphic gradual type system.☆16Updated 4 years ago
- a version of the 2048 game for Coq☆22Updated last year
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆35Updated last year
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- A toy dependent typed language.☆28Updated this week
- Formalization of Typed Assembly Language (TAL) in Coq☆17Updated last year
- Lambda normalization and conversion checking benchmarks for various implementations☆55Updated 3 years ago
- Haskell implementation of the Edinburgh Logical Framework☆27Updated 5 months ago
- Experimental functional language☆17Updated 2 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 4 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
- being an implementation of the calculus of constructions☆15Updated 2 years ago
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated 2 years ago
- being bits and pieces I'm inclined to leave lying around☆49Updated 3 months ago
- Verified C programming in Agda☆16Updated 4 years ago
- An enhanced unification algorithm for Coq☆54Updated 3 weeks ago