ivashkev / math-formalizationsLinks
Formalization of some elementary mathematical theories in Coq
☆15Updated 5 years ago
Alternatives and similar repositories for math-formalizations
Users that are interested in math-formalizations are comparing it to the libraries listed below
Sorting:
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago
- mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics☆21Updated last year
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29Updated 4 years ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- Formalization of type theory☆22Updated 4 years ago
- Various mechanized proof files for fun.☆13Updated 3 months ago
- Source files used for the Cedille Cast videos☆13Updated 5 years ago
- Intrinsic Verification of Formal Grammar Theory☆27Updated this week
- NumLin: Linear Types for Linear Algebra☆23Updated 2 years ago
- Mechanized Theory of Event Structures☆16Updated 2 years ago
- ☆16Updated 9 months ago
- A certified semantics for relational programming workout.☆26Updated 5 years ago
- Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…☆22Updated 4 years ago
- Proof combinators used in Liquid Haskell for theorem proving☆12Updated 7 years ago
- 🪆 A Staged Type Theory☆35Updated 2 years ago
- An implementation of Haskell’s MVars in Racket☆30Updated last year
- translations of a lambda abstraction to combinations of operators☆18Updated 6 years ago
- A toy functional language based on modal type theory. Try it online: https://mtt-lang.github.io/mtt-web☆46Updated 3 years ago
- Formalization of the Truly Stateless Concurrency Model Checker in Coq☆13Updated 4 years ago
- An experimental language server for SomewhatML☆24Updated 2 years ago
- Quantitative Type Theory implementation☆54Updated 4 years ago
- Scala Step-by-Step: Soundness for DOT with Step-Indexed Logical Relations in Iris — Coq Formalization☆36Updated 2 months ago
- Anders: Cubical Type Checker☆23Updated 2 years ago
- A verified compiler for a lazy functional language☆36Updated last week
- ☆37Updated last year
- Constructive Galois connections☆35Updated 7 years ago
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆19Updated 4 years ago
- Generation of abstract binding trees☆27Updated last month
- Dafny for Metatheory of Programming Languages☆26Updated 2 months ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago