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
- ☆55Updated 4 months ago
- An enhanced unification algorithm for Coq☆56Updated 4 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
- Implementation of Nuprl's type theory in Coq☆45Updated 8 months ago
- Constructive Galois connections☆35Updated 7 years ago
- Gallina to Bedrock2 compilation toolkit☆59Updated last week
- A general yet easy-to-use formalization of Big O, Big Theta, and more based on seminormed vector spaces.☆35Updated 8 years ago
- Formalizations of Gradually Typed Languages in Agda☆57Updated 6 months ago
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆49Updated last month
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- Denotational semantics based on graph and filter models☆23Updated 8 months ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 4 years ago
- A framework for implementing and certifying impure computations in Coq☆52Updated last year
- ☆36Updated 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
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 3 months ago
- A proof of Abel-Ruffini theorem.☆30Updated last month
- A language-generic implementation of equality saturation in Haskell☆21Updated 6 years ago
- A Unifying Cartesian Cubical Set Model☆34Updated 5 years ago
- Experiments in formalizing refinement type systems in Coq☆18Updated 9 years ago
- A certified semantics for relational programming workout.☆26Updated 4 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 5 months ago
- ☆22Updated 9 years ago
- FunTAL: mixing a functional language with assembly.☆40Updated 8 years ago
- Denotational Semantics of the Untyped Lambda Calculus☆17Updated 6 months ago
- Bedrock Bit Vector Library☆28Updated 2 months ago
- "Toy" SMT Solver for Educational Purposes☆20Updated 12 years ago