anton-trunov / csclub-coq-course-spring-2021Links
A course on formal verification at https://compsciclub.ru/en, Spring term 2021
☆57Updated 2 years ago
Alternatives and similar repositories for csclub-coq-course-spring-2021
Users that are interested in csclub-coq-course-spring-2021 are comparing it to the libraries listed below
Sorting:
- Coq Lecture Notes (WIP)☆54Updated 4 years ago
- Sturdy is a library for developing sound static analyses in Haskell.☆61Updated 2 years ago
- A toy functional language based on modal type theory. Try it online: https://mtt-lang.github.io/mtt-web☆44Updated 3 years ago
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆49Updated this week
- Learn the Agda basics in three 2-hour sessions.☆59Updated last year
- Hahn: A Coq library☆30Updated last year
- Functional Data Structures and Algorithms in SSReflect [maintainer=@clayrat]☆48Updated 5 months ago
- Proof theory seminar☆35Updated 4 years ago
- Partial Commutative Monoids☆28Updated 2 weeks ago
- Agda formalisation of second-order abstract syntax☆55Updated 2 years ago
- A SuperCompiler for Martin-Löf's Type Theory☆121Updated 3 years ago
- An enhanced unification algorithm for Coq☆56Updated 2 months ago
- Unification and type inference algorithms☆125Updated 10 years ago
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆81Updated 3 years ago
- Agda bindings to SMT-LIB2 compatible solvers.☆99Updated 8 months ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆59Updated 9 months ago
- Organization and planning for the Initial Types Club☆73Updated 2 years ago
- ☆55Updated 2 months ago
- An experimental type checker for a modal dependent type theory.☆112Updated 5 years ago
- Hoare Type Theory☆76Updated 2 weeks ago
- ☆38Updated last year
- ☆84Updated 7 years ago
- ICFP 2020 papers. Crowd-sourced☆91Updated 4 years ago
- An interactive theorem prover based on lambda-tree syntax☆95Updated last month
- A "implementation" of Girard's paradox in OCaml☆108Updated 10 years ago
- Coq library for reasoning on randomized algorithms [maintainers=@anton-trunov,@volodeyka]☆25Updated 3 years ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆82Updated 4 years ago
- Proof Updater Mechanically Passing Knowledge Into New Proofs, Assisting The Coq Hacker☆51Updated 11 months ago
- The theory of algebraic graphs formalised in Agda☆90Updated 6 years ago
- A tutorial on how Agda infers things☆43Updated 4 years ago