anton-trunov / csclub-coq-course-spring-2021
A course on formal verification at https://compsciclub.ru/en, Spring term 2021
☆56Updated last year
Related projects ⓘ
Alternatives and complementary repositories for csclub-coq-course-spring-2021
- Coq Lecture Notes (WIP)☆50Updated 4 years ago
- A toy functional language based on modal type theory. Try it online: https://mtt-lang.github.io/mtt-web☆42Updated 2 years ago
- Sturdy is a library for developing sound static analyses in Haskell.☆60Updated last year
- Functional Algorithms Verified in SSReflect [maintainer=@clayrat]☆45Updated last month
- Hoare Type Theory☆69Updated last month
- Convert Haskell source code to Coq source code.☆78Updated 2 months ago
- Proof theory seminar☆31Updated 3 years ago
- Formalization of C++ for verification purposes.☆69Updated this week
- ICFP 2020 papers. Crowd-sourced☆92Updated 4 years ago
- Hahn: A Coq library☆30Updated 4 months ago
- Coq plugin embedding elpi☆139Updated this week
- An interactive theorem prover based on lambda-tree syntax☆90Updated 3 weeks ago
- Documentation on goals of the coq-community organization, the shared contributing guide and code of conduct.☆68Updated 6 months ago
- Agda formalisation of second-order abstract syntax☆51Updated 2 years ago
- Partial Commutative Monoids☆26Updated last week
- Organization and planning for the Initial Types Club☆70Updated 2 years ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆52Updated last month
- A tutorial on how Agda infers things☆34Updated 3 years ago
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆49Updated last month
- Monadic effects and equational reasonig in Coq☆68Updated 2 weeks ago
- Haskell bindings to Microsoft's Z3 API (unofficial).☆57Updated 8 months ago
- The category theory by example book☆57Updated last year
- This aims to be the most pretentious implementation of stlc in existence☆60Updated 2 years ago
- A Coq library for parametric coinduction☆43Updated last month
- Agda bindings to SMT-LIB2 compatible solvers.☆95Updated last month
- Facilities for generating dependently-typed data☆24Updated this week
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆78Updated 8 years ago
- Coq Enhancement Proposals☆45Updated this week
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆71Updated 2 months ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆78Updated 4 years ago