arthuraa / memory-safe-languageLinks
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
Sorting:
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 4 years ago
- An enhanced unification algorithm for Coq☆56Updated 5 months ago
- A framework for implementing and certifying impure computations in Coq☆52Updated last year
- ☆55Updated 5 months ago
- Constructive Galois connections☆35Updated 7 years ago
- Formalizations of Gradually Typed Languages in Agda☆57Updated 7 months ago
- Experiments in formalizing refinement type systems in Coq☆18Updated 9 years ago
- "Toy" SMT Solver for Educational Purposes☆20Updated 12 years ago
- Gallina to Bedrock2 compilation toolkit☆59Updated this week
- A language-generic implementation of equality saturation in Haskell☆21Updated 6 years ago
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- Inline, type safe X86-64 assembly programming in Agda☆70Updated 6 years ago
- Implementation of Nuprl's type theory in Coq☆45Updated 9 months ago
- The Coq Effective Algebra Library [maintainers=@CohenCyril,@proux01]☆72Updated this week
- Denotational semantics based on graph and filter models☆23Updated 8 months ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- A proof of Abel-Ruffini theorem.☆30Updated 2 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
- Syntaxes with Binding, Their Programs, and Proofs☆23Updated last year
- 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
- Finite sets, finite maps, multisets and generic sets☆50Updated 2 months ago
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆30Updated 4 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 3 years ago
- Regular Language Representations in Coq [maintainers=@chdoc,@palmskog]☆45Updated 4 months ago
- Coq library and tactic for deciding Kleene algebras [maintainer=@tchajed]☆24Updated 10 months ago
- FunTAL: mixing a functional language with assembly.☆40Updated 8 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 5 months 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