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
- An enhanced unification algorithm for Coq☆54Updated last month
- Bedrock Bit Vector Library☆27Updated last year
- Denotational Semantics of the Untyped Lambda Calculus☆16Updated 2 months ago
- ☆55Updated last week
- Experiment with synthetic domain theory in cubical agda☆14Updated 2 years ago
- ModTT in Agda☆11Updated 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
- Meta-theory and normalization for Fitch-style modal lambda calculi☆18Updated 10 months ago
- Coq plugin providing tactics for rewriting universally quantified equations, modulo associative (and possibly commutative) operators [mai…☆31Updated last month
- a version of the 2048 game for Coq☆22Updated last year
- A bare-bones LCF-style proof assistant☆22Updated 5 years ago
- Matita (proof assistant) with embedded elpi☆12Updated 7 years ago
- Implementation of Nuprl's type theory in Coq☆45Updated 4 months ago
- An automated theorem prover for intuitionistic propostional logic☆12Updated 4 years ago
- AACMM's generic-syntax, but with QTT-style annotations☆20Updated last year
- "Toy" SMT Solver for Educational Purposes☆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
- Experiments in formalizing refinement type systems in Coq☆17Updated 9 years ago
- my phd thesis☆26Updated 8 months ago
- Coq library and tactic for deciding Kleene algebras [maintainer=@tchajed]☆23Updated 5 months ago
- ☆21Updated 3 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 years ago
- Implementation of sprintf for Coq☆18Updated 5 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 2 weeks ago
- Notes (and implementation) of unification with binders☆14Updated 2 weeks ago
- Deadlock freedom by type checking☆20Updated last year
- Generalized syntax & semantics for universe hierarchies☆29Updated last year
- 🧊 kado カド: Cofibrations in Cartesian Cubical Type Theory☆19Updated 6 months ago