anton-trunov / csclub-coq-course-spring-2021
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
- Coq Lecture Notes (WIP)☆54Updated 4 years ago
- A toy functional language based on modal type theory. Try it online: https://mtt-lang.github.io/mtt-web☆43Updated 2 years ago
- Proof theory seminar☆33Updated 3 years ago
- Sturdy is a library for developing sound static analyses in Haskell.☆61Updated last year
- Partial Commutative Monoids☆28Updated 2 months ago
- Learn the Agda basics in three 2-hour sessions.☆56Updated last year
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆49Updated last week
- A tutorial on how Agda infers things☆41Updated 4 years ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆81Updated 4 years ago
- A SuperCompiler for Martin-Löf's Type Theory☆120Updated 3 years ago
- Agda bindings to SMT-LIB2 compatible solvers.☆96Updated 5 months ago
- The theory of algebraic graphs formalised in Agda☆89Updated 6 years ago
- Hahn: A Coq library☆30Updated 9 months ago
- ICFP 2020 papers. Crowd-sourced☆91Updated 4 years ago
- ☆21Updated 4 months ago
- Experiments with sequent calculi☆27Updated 4 years ago
- Functional Data Structures and Algorithms in SSReflect [maintainer=@clayrat]☆46Updated 3 months ago
- A verified compiler for a lazy functional language☆34Updated last month
- A Coq library for parametric coinduction☆45Updated 2 months ago
- The category theory by example book☆58Updated last year
- Rocq RFCs: documents to discuss changes to the Rocq Prover☆56Updated 2 months ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆80Updated 8 years ago
- Haskell bindings to Microsoft's Z3 API (unofficial).☆58Updated last year
- Monadic effects and equational reasonig in Coq☆70Updated 3 weeks ago
- Unification and type inference algorithms☆125Updated 10 years ago
- Organization and planning for the Initial Types Club☆73Updated 2 years ago
- Facilities for generating dependently-typed data☆26Updated this week
- ☆84Updated 7 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆75Updated 4 months ago
- An interactive theorem prover based on lambda-tree syntax☆94Updated 2 months ago