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☆46Updated 3 years ago
- Functional Data Structures and Algorithms in SSReflect [maintainer=@clayrat]☆49Updated 2 months ago
- Sturdy is a library for developing sound static analyses in Haskell.☆62Updated 2 years ago
- ICFP 2020 papers. Crowd-sourced☆90Updated 5 years ago
- Proof theory seminar☆36Updated 4 years ago
- SPLV20 course notes☆114Updated 3 years ago
- Formal semantics in Agda.☆16Updated 10 years ago
- The Penn Locally Nameless Metatheory Library☆76Updated 8 months ago
- Facilities for generating dependently-typed data☆29Updated this week
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆49Updated 3 months ago
- Unification and type inference algorithms☆125Updated 10 years ago
- A survey of semantics styles in Coq, from natural semantics through structural operational, axiomatic, and denotational semantics, to abs…☆55Updated 2 weeks ago
- Partial Commutative Monoids☆32Updated 6 months ago
- A tutorial on how Agda infers things☆63Updated 5 months ago
- A framework for implementing and certifying impure computations in Coq☆53Updated last year
- Unassorted scribbles on formal methods, type theory, category theory, and so on, and so on☆22Updated last year
- An interactive theorem prover based on lambda-tree syntax☆98Updated 2 weeks ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆84Updated 9 years ago
- Convert Haskell source code to Coq source code.☆93Updated 5 months ago
- General topology in Coq [maintainers=@amiloradovsky,@Columbus240,@stop-cran]☆51Updated last year
- Agda bindings to SMT-LIB2 compatible solvers.☆103Updated 4 months ago
- Haskell bindings to Microsoft's Z3 API (unofficial).☆62Updated last year
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆86Updated 5 years ago
- Organization and planning for the Initial Types Club☆75Updated 3 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆79Updated 3 months ago
- An enhanced unification algorithm for Coq☆58Updated 2 weeks ago
- A Coq library for parametric coinduction☆51Updated 10 months ago
- Hoare Type Theory☆83Updated 6 months ago
- Formalizations of Gradually Typed Languages in Agda☆59Updated last week