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
- ☆54Updated 2 weeks ago
- An enhanced unification algorithm for Coq☆54Updated 2 weeks ago
- ☆22Updated 9 years ago
- Regular Language Representations in Coq [maintainers=@chdoc,@palmskog]☆41Updated last month
- Ring, field, lra, nra, and psatz tactics for Mathematical Components☆33Updated last month
- ModTT in Agda☆11Updated 3 years ago
- Constructive Galois connections☆32Updated 6 years ago
- Stable sort algorithms and their stability proofs in Coq☆22Updated 3 weeks ago
- Implementation of Nuprl's type theory in Coq☆45Updated 3 months ago
- Mechanization of a noninterference proof for a toy imperative language with small-step semantics in Coq☆18Updated 5 years ago
- AACMM's generic-syntax, but with QTT-style annotations☆20Updated 11 months ago
- A language-generic implementation of equality saturation in Haskell☆21Updated 6 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆30Updated 3 years ago
- a version of the 2048 game for Coq☆22Updated last year
- Verified C programming in Agda☆16Updated 4 years ago
- A rosetta stone for metaprogramming in Coq, with different examples of tactics, plugins, etc implemented in different metaprogramming lan…☆17Updated last year
- Experiment with synthetic domain theory in cubical agda☆14Updated 2 years ago
- Experiments in formalizing refinement type systems in Coq☆17Updated 9 years ago
- A package Index for agda libraries☆12Updated 4 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
- Haskell implementation of P4F Control-Flow Analysis☆21Updated 2 years ago
- ☆21Updated 3 years ago
- An automated theorem prover for intuitionistic propostional logic☆12Updated 4 years ago
- An implementation of scoped algebraic effects and handlers in Agda.☆12Updated 4 years ago
- LL(1) parser generator verified in Coq☆45Updated 5 years ago
- my phd thesis☆26Updated 7 months ago
- Formalization of type theory☆22Updated 3 years ago
- Denotational Semantics of the Untyped Lambda Calculus☆16Updated last month