dot-iris
Type verification library
Mechanized formalization of soundness for DOT with logical relations in Coq
Scala Step-by-Step: Soundness for DOT with Step-Indexed Logical Relations in Iris — Coq Formalization
30 stars
5 watching
1 forks
Language: HTML
last commit: 4 months ago coqcoq-formalizationcoq-formalizationsdot-calculuspapersoundnesstype-theory
Related projects:
Repository | Description | Stars |
---|---|---|
| A formalization of Dependent Object Types (DOT) calculus in Coq to support type safety proofs for a new foundation for Scala's type system | 62 |
| Mechanized proof of soundness for a type-theoretic foundation for languages like Scala | 155 |
| Instantiates a simple programming language with Iris to verify concurrent separation logic programs | 49 |
| Formalizing Brainfuck in Coq to prove its properties and verify a compiler for simple arithmetic expressions. | 26 |
| A comprehensive Coq library providing formal definitions and proofs of rewriting theory, lambda-calculus, and termination. | 35 |
| A Coq formalization of Damas-Milner type system and its algorithm W for verifying the correctness of type inference tools. | 25 |
| A formalization of polymorphic lambda calculus with a proof of parametricity theorem. | 33 |
| A personal repository of formally verified mathematics using the Coq proof assistant | 292 |
| A collection of formal verification tools and libraries for writing secure and reliable software using the Coq proof assistant | 444 |
| A Coq-based library for synthesizing correct-by-construction abstract data types and parsers from formal specifications | 149 |
| A verified hash-based approximate membership structure library in Coq | 121 |
| Formal verification of Python code using Coq | 30 |
| Development of formal semantics and verification tools for imperative languages and functional programming languages. | 64 |