arthuraa / memory-safe-language
A formalization of properties of a simple imperative, memory-safe language.
☆19Updated 3 years ago
Alternatives and similar repositories for memory-safe-language:
Users that are interested in memory-safe-language are comparing it to the libraries listed below
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- ☆22Updated 9 years ago
- ☆55Updated last month
- Bedrock Bit Vector Library☆27Updated last year
- Regular Language Representations in Coq [maintainers=@chdoc,@palmskog]☆42Updated last week
- A language-generic implementation of equality saturation in Haskell☆21Updated 6 years ago
- Experiments in formalizing refinement type systems in Coq☆17Updated 9 years ago
- "Toy" SMT Solver for Educational Purposes☆20Updated 12 years ago
- LL(1) parser generator verified in Coq☆46Updated 5 years ago
- Coq plugin providing tactics for rewriting universally quantified equations, modulo associative (and possibly commutative) operators [mai…☆31Updated 2 months ago
- An enhanced unification algorithm for Coq☆56Updated 3 weeks ago
- Mechanization of a noninterference proof for a toy imperative language with small-step semantics in Coq☆18Updated 5 years ago
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆30Updated 3 years ago
- The source for "Compiling with Dependent Types" (my dissertation)☆30Updated 2 years ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 11 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
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- my phd thesis☆26Updated 8 months ago
- Coq library and tactic for deciding Kleene algebras [maintainer=@tchajed]☆23Updated 6 months ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- Lenses in Coq☆18Updated 2 years ago
- An automated theorem prover for intuitionistic propostional logic☆12Updated 4 years ago
- ☆21Updated 3 years ago
- Based on paper by Greg Morrisett , TAL-0 is the design of a RISC-style typed assembly language which focuses on control-flow safety.☆22Updated 8 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- Implementation of sprintf for Coq☆18Updated 5 years ago
- AACMM's generic-syntax, but with QTT-style annotations☆20Updated last year
- A small NuPRL style proof assistant☆31Updated 6 years ago
- Graded Dependent Type systems☆24Updated last year
- Formalization of type theory☆22Updated 3 years ago