jashug / FormalizedCompilerAlgorithmsLinks
Formalization in Coq of algorithms used in compilers for the Compiler.org project
☆15Updated 6 years ago
Alternatives and similar repositories for FormalizedCompilerAlgorithms
Users that are interested in FormalizedCompilerAlgorithms are comparing it to the libraries listed below
Sorting:
- secret project☆17Updated 7 years ago
- A Certified Interpreter for ML with Structural Polymorphism☆44Updated 3 months ago
- ☆22Updated 9 years ago
- A stack-driven generator of arbitrary WebAssembly programs☆19Updated 3 years ago
- 🌳 Generate a fresh bonsai in your terminal☆28Updated 3 years ago
- ML modules and functors as first-class citizens by unifying ML modules and ML records with path dependent types and subtyping.☆38Updated 3 years ago
- 👹 A library for hierarchical names and lexical scoping☆26Updated 10 months ago
- ☆18Updated last year
- Toy demo of lexing/parsing in Coq☆12Updated 6 years ago
- A Coq plugin that implements exceptions in Coq☆14Updated 4 years ago
- A minimal example of a formally verified parser using ocamllex and Menhir's Coq backend.☆20Updated 10 years ago
- Higher kinded polymorphism in SML☆15Updated 4 years ago
- A Pretty Printer, based on Philip Wadler's "A prettier printer". But heavily modified to be efficient in a strict language.☆19Updated 4 years ago
- Formalising session types in Coq☆17Updated 5 years ago
- Choice operator in OCaml, providing a backtracking monad☆26Updated 3 years ago
- Code for "Staged Generic Programming" (ICFP 2017)☆26Updated last year
- A clean implementation of Parsing with Zippers.☆38Updated 6 years ago
- an encoding of affine effect handlers using pthreads☆14Updated 2 years ago
- Monad-based linear types in OCaml, with a few syntax extensions☆37Updated 5 years ago
- Work on modular implicits☆24Updated 6 years ago
- Efficient binder representation in OCaml☆43Updated last year
- Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…☆22Updated 4 years ago
- OCaml implementation of DSub, a ML like language with subtyping and path dependent types.☆13Updated 8 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- Fun plugin to play with the Gallina AST.☆38Updated 5 years ago
- Malfunction backend for Idris with a FFI to OCaml☆28Updated 5 years ago
- Selective applicative functors laws and theorems☆14Updated 5 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 4 months 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 simple λProlog interpreter☆20Updated 3 years ago