Alternatives and similar repositories for FiniteSets

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

• jonsterling / coq-domains
  ☆18Updated 3 years ago
• ualib / ualib.github.io
  The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…
  ☆20Updated 3 years ago
• metaborg / linear.agda
  A library and case-study for linear, intrinsically-typed interpreters in Agda
  ☆36Updated 5 years ago
• sstucki / pts-agda
  A formalization of Pure Type Systems (PTS) in Agda
  ☆27Updated 5 months ago
• danelahman / Normalization-By-Evaluation
  Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories
  ☆15Updated last month
• AndrasKovacs / universes
  Generalized syntax & semantics for universe hierarchies
  ☆32Updated last year
• gallais / agda-sizedIO
  IO using sized types and copatterns
  ☆36Updated 4 years ago
• AndrasKovacs / thesis
  my phd thesis
  ☆26Updated last year
• L-TChen / MtacAR
  Mtac in Agda
  ☆28Updated 4 years ago
• JorisCeulemans / sikkel
  Multimode simple type theory as an Agda library.
  ☆23Updated last year
• UlfNorell / quasi-quote
  Quasi-quoting library for agda
  ☆18Updated last year
• AndrasKovacs / preordertt
  Experiments with preordered set models of (directed) type theories
  ☆15Updated 6 years ago
• gallais / typing-with-leftovers
  Self-contained repository for the eponymous paper
  ☆30Updated 6 years ago
• tomdjong / domain-theory-in-uf
  ☆11Updated 5 years ago
• uemurax / synthetic-topos-theory
  ☆15Updated 2 years ago
• Zekt / Type-Embellishment
  Experimenting on ornamentation in Agda via reflection.
  ☆12Updated 2 years ago
• Deducteam / Agda2Dedukti
  ☆21Updated 3 years ago
• cofibrant / agda-nbe
  Verified NbE via gluing in Agda
  ☆11Updated last year
• limemloh / cubical-congruence
  Congruence Closure Procedure in Cubical Agda
  ☆18Updated 5 years ago
• gallais / thesis
  Syntaxes with Binding, Their Programs, and Proofs
  ☆23Updated 2 years ago
• L-TChen / ModalTypeTheory
  ☆21Updated 4 years ago
• nmvdw / Three-HITs
  All higher inductive types can be obtained from three simple HITs.
  ☆17Updated 7 years ago
• andreasabel / agda2lagda
  Simple conversion from Agda text to literate Agda text.
  ☆14Updated last week
• L-TChen / BiSig
  Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically
  ☆21Updated last year
• rahulc29 / realizability
  Experiments with Realizability in Univalent Type Theory
  ☆19Updated last year
• andreasabel / helf
  Haskell implementation of the Edinburgh Logical Framework
  ☆31Updated 6 months ago
• jespercockx / reflection-tutorial
  ☆17Updated 7 years ago
• tsung-ju / SystemF
  An Agda formalization of System F and the Brown-Palsberg self-interpreter
  ☆26Updated 5 years ago
• gergoerdi / generic-syntax
  Library implementation of "Generic description of well-scoped, well-typed syntaxes"
  ☆12Updated 7 years ago
• jespercockx / popl19-tutorial
  Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais
  ☆26Updated 6 years ago