Alternatives and similar repositories for group-theory:

Users that are interested in group-theory are comparing it to the libraries listed below

• alhassy / AgdaCheatSheet
  Basics of the dependently-typed functional language Agda ^_^
  ☆39Updated 3 years ago
• RyanGlScott / ghc-software-foundations
  The Software Foundations book, in GHC
  ☆82Updated 2 months ago
• anuyts / agda-sessions
  Learn the Agda basics in three 2-hour sessions.
  ☆56Updated last year
• monadfix / named
  Named parameters (keyword arguments) for Haskell
  ☆94Updated 4 months ago
• pigworker / MetaprogAgda
  being the materials for Summer 2013's course
  ☆112Updated last year
• lambdageek / unbound-generics
  Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)
  ☆56Updated 11 months ago
• sjoerdvisscher / data-category
  Library of categories, with categorical constructions on them
  ☆56Updated last year
• lamdu / hypertypes
  Hypertypes - generic programming for heterogeneous recursive types
  ☆121Updated 2 months ago
• AndrasKovacs / setoidtt
  Prototype implementations of systems based on setoid type theory
  ☆65Updated 4 years ago
• steshaw / lennart-lambda
  λλλλ Lennart Augustsson's λ-calculus cooked four ways
  ☆52Updated 7 years ago
• ekmett / bound
  Combinators for manipulating locally-nameless generalized de Bruijn terms
  ☆123Updated 7 months ago
• Bodigrim / poly
  Fast polynomial arithmetic in Haskell (dense and sparse, univariate and multivariate, usual and Laurent)
  ☆68Updated 4 months ago
• effectfully / inference-in-agda
  A tutorial on how Agda infers things
  ☆41Updated 4 years ago
• scmu / aopa
  Algebra of Programming in Agda: Dependent Types for Relational Program Derivation
  ☆80Updated 8 years ago
• LightAndLight / qtt
  Quantitative Type Theory implementation
  ☆54Updated 3 years ago
• con-kitty / categorifier
  Interpret Haskell programs into any cartesian closed category.
  ☆58Updated last month
• TOTBWF / refinery
  ⛏️ A refinement proof framework for haskell
  ☆69Updated last year
• DimaSamoz / agda-soas
  Agda formalisation of second-order abstract syntax
  ☆54Updated 2 years ago
• AndrasKovacs / system-f-omega
  System F-omega normalization by hereditary substitution in Agda
  ☆57Updated 5 years ago
• aspiwack / peppermint-prover
  Experimental proof assistant (and architecture) for dependent linear logic
  ☆47Updated 2 years ago
• kowainik / typerep-map
  ⚡️Efficient implementation of Map with types as keys
  ☆101Updated last year
• agda / agda-language-server
  Language Server for Agda
  ☆106Updated 2 months ago
• kim-em / lean-category-theory
  An experimental category theory library for Lean
  ☆49Updated last year
• ivanbakel / hout-prover
  A non-interactive proof assistant using the Haskell type system
  ☆36Updated 4 years ago
• jsiek / abstract-binding-trees
  Abstract binding trees (abstract syntax trees plus binders), as a library in Agda
  ☆74Updated 4 months ago
• AndrasKovacs / cctt
  high-performance cubical evaluation
  ☆70Updated 3 months ago
• gallais / potpourri
  Where my everyday research happens
  ☆52Updated this week
• pigworker / CS410-18
  being the teaching materials and exercises for CS410 in the 2018/19 session
  ☆56Updated 5 years ago
• sjoerdvisscher / proarrow
  Haskell library for doing category theory with a central role for profunctors
  ☆21Updated this week
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆82Updated 3 years ago