dbp / howtoproveacompilerLinks
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:
- Deadlock freedom by type checking☆20Updated 2 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- bidirectional type checking algorithms for higher-ranked polymorphism☆19Updated 3 years ago
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- A Toy Inverse Bidirectional Typechecker☆31Updated 6 years ago
- Prototype code that accompanies the paper "Compiling Successor ML Pattern Guards"☆25Updated 2 years ago
- Benchmark repository of polyglot effect handler examples☆24Updated 2 months ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- ☆33Updated 8 months ago
- Full implementation of F-ing Modules, with the power of sequent calculus☆20Updated 4 years ago
- A bare-bones LCF-style proof assistant☆24Updated 5 years ago
- A dependent type theory with user defined data types☆46Updated 3 years ago
- A verified compiler for a lazy functional language☆36Updated this week
- Efficient effect handlers based on Evidence Passing Semantics.☆30Updated 4 years ago
- An interpreter of F-ing modules☆19Updated 6 years ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Updated last year
- Experimental type-checker for internally parametric type theory☆32Updated 3 months ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- 🪆 A Staged Type Theory☆35Updated last year
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 4 years ago
- 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☆22Updated 3 years ago
- Examples from our paper "Capturing the Future by Replaying the Past"☆21Updated 9 months ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- A toy dependent typed language.☆29Updated last week
- Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…☆22Updated 4 years ago
- being an implementation of the calculus of constructions☆17Updated 2 years ago
- Artifact for paper "When Subtyping Constraints Liberate: A Novel Type Inference Approach for First-Class Polymorphism" (https://popl24.si…☆15Updated last year
- A compiler and runtime for normalizing the untyped λ-calculus☆31Updated 3 years ago