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
- A toy functional language based on modal type theory. Try it online: https://mtt-lang.github.io/mtt-web☆45Updated 3 years ago
- Functional Data Structures and Algorithms in SSReflect [maintainer=@clayrat]☆49Updated 8 months ago
- Sturdy is a library for developing sound static analyses in Haskell.☆62Updated 2 years ago
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆49Updated last month
- A tutorial on how Agda infers things☆61Updated 2 months ago
- Partial Commutative Monoids☆29Updated 3 months ago
- Learn the Agda basics in three 2-hour sessions.☆60Updated last year
- Proof theory seminar☆35Updated 4 years ago
- ICFP 2020 papers. Crowd-sourced☆91Updated 5 years ago
- Organization and planning for the Initial Types Club☆73Updated 3 years ago
- A framework for implementing and certifying impure computations in Coq☆53Updated last year
- Relation algebra library for Coq☆49Updated this week
- Haskell bindings to Microsoft's Z3 API (unofficial).☆62Updated last year
- A repository for the material of my course on lambda-calculus and categories☆43Updated 4 years ago
- Intermediate Memory Model (IMM) and compilation correctness proofs for it☆29Updated 7 months ago
- Convert Haskell source code to Coq source code.☆87Updated 2 months ago
- SPLV20 course notes☆112Updated 2 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- Monadic effects and equational reasoning in Rocq☆72Updated this week
- Agda bindings to SMT-LIB2 compatible solvers.☆102Updated last month
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆83Updated 9 years ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆84Updated 5 years ago
- An interactive theorem prover based on lambda-tree syntax☆96Updated 4 months ago
- An enhanced unification algorithm for Coq☆56Updated 5 months ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆76Updated 3 weeks ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- The Penn Locally Nameless Metatheory Library☆75Updated 5 months ago
- Unassorted scribbles on formal methods, type theory, category theory, and so on, and so on☆23Updated last year
- Coq plugin embedding elpi☆174Updated this week