jashug / FormalizedCompilerAlgorithms
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
- secret project☆17Updated 7 years ago
- A Coq plugin to disable positivity check, guard check and termination check☆16Updated 5 years ago
- Formalising session types in Coq☆17Updated 5 years ago
- 👹 A library for hierarchical names and lexical scoping☆25Updated 5 months ago
- Toy demo of lexing/parsing in Coq☆12Updated 5 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 4 years ago
- A Coq plugin that implements exceptions in Coq☆13Updated 4 years ago
- A minimal example of a formally verified parser using ocamllex and Menhir's Coq backend.☆20Updated 10 years ago
- A Datalog implementation with an OCaml inspired module system☆44Updated 6 years ago
- A bare-bones LCF-style proof assistant☆22Updated 5 years ago
- Implementation of sprintf for Coq☆18Updated 4 years ago
- Experimentation project☆16Updated 11 years ago
- flexible 'let rec' generation for MetaOCaml☆26Updated last year
- Experimental functional language☆17Updated 2 years ago
- ☆22Updated 9 years ago
- An infinity-categorical coherence typechecker☆15Updated 4 months ago
- A repository of MetaOCaml packages☆12Updated last year
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- 🌳 Generate a fresh bonsai in your terminal☆24Updated 3 years ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Updated 3 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
- an encoding of affine effect handlers using pthreads☆14Updated 2 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 years ago
- Higher kinded polymorphism in SML☆15Updated 4 years ago
- A Certified Interpreter for ML with Structural Polymorphism☆43Updated 2 years ago
- Fintie Sets in Cubical Agda☆12Updated 5 years ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆17Updated 6 years ago
- a version of the 2048 game for Coq☆22Updated last year
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- ☆17Updated 6 years ago