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

• anton-trunov / coq-lecture-notes
  Coq Lecture Notes (WIP)
  ☆54Updated 4 years ago
• mtt-lang / mtt-lang
  A toy functional language based on modal type theory. Try it online: https://mtt-lang.github.io/mtt-web
  ☆45Updated 3 years ago
• rocq-community / fav-ssr
  Functional Data Structures and Algorithms in SSReflect [maintainer=@clayrat]
  ☆49Updated 8 months ago
• svenkeidel / sturdy
  Sturdy is a library for developing sound static analyses in Haskell.
  ☆62Updated 2 years ago
• sequents / code
  Proof theory seminar
  ☆35Updated 4 years ago
• alhassy / next-700-module-systems
  PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.
  ☆82Updated 3 years ago
• llelf / icfp2020-papers
  ICFP 2020 papers. Crowd-sourced
  ☆91Updated 5 years ago
• anuyts / agda-sessions
  Learn the Agda basics in three 2-hour sessions.
  ☆60Updated last year
• effectfully / inference-in-agda
  A tutorial on how Agda infers things
  ☆61Updated last month
• pi8027 / lambda-calculus
  A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2
  ☆83Updated 5 years ago
• unicoq / unicoq
  An enhanced unification algorithm for Coq
  ☆56Updated 4 months ago
• InitialTypes / Club
  Organization and planning for the Initial Types Club
  ☆73Updated 2 years ago
• wenkokke / schmitty
  Agda bindings to SMT-LIB2 compatible solvers.
  ☆101Updated 2 weeks ago
• LPCIC / coq-elpi
  Coq plugin embedding elpi
  ☆173Updated 3 weeks ago
• uwplse / pumpkin-pi
  An extension to PUMPKIN PATCH with support for proof repair across type equivalences.
  ☆49Updated last week
• adamgundry / type-inference
  Unification and type inference algorithms
  ☆125Updated 10 years ago
• jsiek / abstract-binding-trees
  Abstract binding trees (abstract syntax trees plus binders), as a library in Agda
  ☆76Updated this week
• rocq-community / autosubst
  Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]
  ☆61Updated 11 months ago
• mgrabovsky / fm-notes
  Unassorted scribbles on formal methods, type theory, category theory, and so on, and so on
  ☆23Updated last year
• sweirich / lambda-n-ways
  Benchmarks for capture-avoiding substitution
  ☆119Updated 3 months ago
• TyGuS / hoogle_plus
  Type-driven, component based synthesis, showcasing TYpe Guided Abstract Refinement (TYGAR)
  ☆60Updated last month
• lpw25 / girards-paradox
  A "implementation" of Girard's paradox in OCaml
  ☆109Updated 10 years ago
• abella-prover / abella
  An interactive theorem prover based on lambda-tree syntax
  ☆96Updated 3 months ago
• plclub / metalib
  The Penn Locally Nameless Metatheory Library
  ☆75Updated 5 months ago
• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆114Updated 5 years ago
• conal / paper-2021-language-derivatives
  Paper and talk
  ☆54Updated 2 years ago
• plclub / hs-to-coq
  Convert Haskell source code to Coq source code.
  ☆86Updated 2 months ago
• IagoAbal / haskell-z3
  Haskell bindings to Microsoft's Z3 API (unofficial).
  ☆60Updated last year
• scmu / aopa
  Algebra of Programming in Agda: Dependent Types for Relational Program Derivation
  ☆83Updated 9 years ago
• AndrasKovacs / SemanticsWithApplications
  Formal semantics in Agda.
  ☆16Updated 10 years ago