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)☆56Updated 5 years ago
- A toy functional language based on modal type theory. Try it online: https://mtt-lang.github.io/mtt-web☆47Updated 3 years ago
- Functional Data Structures and Algorithms in SSReflect [maintainer=@clayrat]☆50Updated 2 months ago
- Proof theory seminar☆36Updated 4 years ago
- Sturdy is a library for developing sound static analyses in Haskell.☆62Updated 2 years ago
- The Penn Locally Nameless Metatheory Library☆76Updated 9 months ago
- Partial Commutative Monoids☆32Updated 6 months ago
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆82Updated 4 years ago
- Unassorted scribbles on formal methods, type theory, category theory, and so on, and so on☆22Updated last year
- Documentation on goals of the Rocq-community organization, the shared contributing guide and code of conduct.☆68Updated 9 months ago
- Rocq RFCs: documents to discuss changes to the Rocq Prover☆60Updated 11 months ago
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆49Updated 4 months ago
- ICFP 2020 papers. Crowd-sourced☆90Updated 5 years ago
- ☆56Updated 2 weeks ago
- A tutorial on how Agda infers things☆63Updated 5 months ago
- An enhanced unification algorithm for Coq☆58Updated last month
- SPLV20 course notes☆114Updated 3 years ago
- A survey of semantics styles in Coq, from natural semantics through structural operational, axiomatic, and denotational semantics, to abs…☆56Updated last month
- A Coq library for parametric coinduction☆51Updated 11 months ago
- Minimalistic dependent type theory with syntactic metaprogramming☆60Updated last year
- Unification and type inference algorithms☆125Updated 10 years ago
- An interactive theorem prover based on lambda-tree syntax☆98Updated last month
- Hoare Type Theory☆84Updated 6 months ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆86Updated 5 years ago
- Convert Haskell source code to Coq source code.☆93Updated 6 months ago
- A formalisation of the Calculus of Constructions☆70Updated last year
- A "implementation" of Girard's paradox in OCaml☆110Updated 10 years ago
- Formal semantics in Agda.☆16Updated 10 years ago
- ☆42Updated 7 years ago
- Agda bindings to SMT-LIB2 compatible solvers.☆103Updated 4 months ago