dot-calculus
Type System Compiler
A formalization of Dependent Object Types (DOT) calculus in Coq to support type safety proofs for a new foundation for Scala's type system
Formalization of the Dependent Object Types (DOT) calculus
62 stars
5 watching
9 forks
Language: Coq
last commit: over 2 years ago
Linked from 1 awesome list
Related projects:
Repository | Description | Stars |
---|---|---|
| Mechanized proof of soundness for a type-theoretic foundation for languages like Scala | 155 |
| Mechanized formalization of soundness for DOT with logical relations in Coq | 30 |
| A Coq formalization of Damas-Milner type system and its algorithm W for verifying the correctness of type inference tools. | 25 |
| Formalizations of logical deduction systems using Coq | 44 |
| A package for defining functions in Coq using dependent types and pattern-matching. | 223 |
| Translates Coq terms into Cedille terms for a specific domain-specific language | 33 |
| A Coq implementation of mathematical concepts from N. Bourbaki's Elements of Mathematics | 30 |
| Formalizations of compiler design and virtual machine calculations in Coq | 30 |
| Mechanizations for two dependently-typed languages with graded types | 24 |
| A project that formalizes refinement types and dependent types in the Agda language | 58 |
| Automates formalizing syntactic theories with variable binders in Coq | 52 |
| A formalization of information theory and linear error-correcting codes in Coq. | 64 |
| A library of abstract interfaces for various mathematical structures to facilitate algebraic manipulation and type class-based reasoning in Coq | 162 |