Alternatives and similar repositories for xquant

Users that are interested in xquant are comparing it to the libraries listed below

• effectfully / OTT
  Observational Type Theory as an Agda library
  ☆53Updated 8 years ago
• pigworker / ProgrammerCommaCon
  being a collection of Agda-facilitated ramblings
  ☆33Updated 5 years ago
• xgrommx / agda-ecosystem
  ☆30Updated 7 years ago
• jonsterling / hs-abt
  Type safe abstract binding trees for Haskell, using Vinyl
  ☆16Updated 7 years ago
• vmchale / permutations
  Provides a type-safe way of working with permutations in Idris
  ☆36Updated 3 years ago
• konn / equational-reasoning-in-haskell
  Agda-style equational reasoning in Haskell
  ☆53Updated 3 months ago
• brunjlar / protop
  topos programming
  ☆31Updated 6 years ago
• mikeshulman / dirtt
  Directed type theory for formal category theory
  ☆17Updated 8 years ago
• gallais / agda-sizedIO
  IO using sized types and copatterns
  ☆35Updated 4 years ago
• pcapriotti / agda-categories
  Category theory and algebra
  ☆28Updated 8 years ago
• jmchapman / TT-in-TT
  Type theory in type theory
  ☆16Updated 13 years ago
• ericfinster / catt
  Coherence typechecker for Grothendieck/Maltsiniotis style infinity categories
  ☆15Updated 8 years ago
• gallais / typing-with-leftovers
  Self-contained repository for the eponymous paper
  ☆30Updated 6 years ago
• gallais / generic-syntax
  A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs
  ☆73Updated 3 years ago
• pigworker / Totality
  being the programs and code for a paper about general recursion
  ☆26Updated 10 years ago
• nbenton / coqdomains
  Domain theory and denotational semantics in Coq
  ☆10Updated 10 years ago
• ericfinster / opetopic
  Web based opetopic editor
  ☆35Updated 8 months ago
• pigworker / Bi71
  being a bidirectional reformulation of Martin-Löf's 1971 type theory
  ☆25Updated 7 years ago
• gergoerdi / tandoori
  Compositional type checking for Haskell
  ☆37Updated 14 years ago
• neel-krishnaswami / linearml
  A simple implementation of linear type theory
  ☆38Updated 8 years ago
• ericfinster / opetopes-in-agda
  Formalization of Opetopes and Opetopic Sets in Agda
  ☆18Updated 8 years ago
• bitonic / hakyll-agda
  Hakyll support for Agda literate files
  ☆19Updated 3 years ago
• andreasabel / ipl
  Agda formalization of Intuitionistic Propositional Logic
  ☆22Updated last month
• agda / ooAgda
  Interactive and object-oriented programming in Agda using coinductive types
  ☆23Updated last month
• jwiegley / coq-cds4ltl
  A formalization of finite, constructive log analysis using linear temporal logic
  ☆22Updated last month
• japesinator / Idris-Profunctors
  A small profunctor library for idris
  ☆17Updated 2 years ago
• byorgey / enumeration
  Simple Haskell package for efficiently indexable finite and infinite enumerations.
  ☆12Updated 2 months ago
• OPLSS / oplss-notes-2017
  handouts and notes from the 2017 edition of the summer school
  ☆39Updated 8 years ago
• lambdabetaeta / modal-logics
  Agda formalisation of dual-context constructive modal logics.
  ☆20Updated 5 years ago
• gallais / agda-nbe
  Formalizing nbe in agda
  ☆31Updated 12 years ago