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☆24Updated 4 years ago
- An enhanced unification algorithm for Coq☆56Updated 2 months ago
- ☆55Updated 2 months ago
- ☆22Updated 9 years ago
- A package Index for agda libraries☆12Updated 4 years ago
- Bedrock Bit Vector Library☆28Updated last year
- a version of the 2048 game for Coq☆22Updated last year
- "Toy" SMT Solver for Educational Purposes☆20Updated 12 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 4 years ago
- FunTAL: mixing a functional language with assembly.☆40Updated 8 years ago
- Denotational semantics based on graph and filter models☆23Updated 6 months ago
- Ring, field, lra, nra, and psatz tactics for Mathematical Components☆33Updated last month
- Haskell implementation of the Edinburgh Logical Framework☆30Updated last month
- The source for "Compiling with Dependent Types" (my dissertation)☆30Updated 3 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- Constructive Galois connections☆32Updated 7 years ago
- Stable sort algorithms and their stability proofs in Rocq☆22Updated this week
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- Idris, but it's C☆24Updated 7 years ago
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- Implementation of sprintf for Coq☆18Updated 5 years ago
- A formalization of bitset operations in Coq and the corresponding axiomatization and extraction to OCaml native integers [maintainer=@ant…☆23Updated last month
- Specification of Agda.☆25Updated 6 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 3 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
- Coq library and tactic for deciding Kleene algebras [maintainer=@tchajed]☆23Updated 8 months ago
- Deadlock freedom by type checking☆20Updated 2 years ago
- A language-generic implementation of equality saturation in Haskell☆21Updated 6 years ago
- A small NuPRL style proof assistant☆31Updated 6 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 2 years ago