Alternatives and similar repositories for FiniteSets:

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

• tomdjong / domain-theory-in-uf
  ☆11Updated 4 years ago
• jonsterling / coq-domains
  ☆18Updated 2 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…
  ☆19Updated 3 years ago
• andreasabel / helf
  Haskell implementation of the Edinburgh Logical Framework
  ☆26Updated 3 months ago
• metaborg / linear.agda
  A library and case-study for linear, intrinsically-typed interpreters in Agda
  ☆34Updated 5 years ago
• L-TChen / MtacAR
  Mtac in Agda
  ☆28Updated 3 years ago
• gallais / agda-sizedIO
  IO using sized types and copatterns
  ☆33Updated 3 years ago
• sstucki / pts-agda
  A formalization of Pure Type Systems (PTS) in Agda
  ☆23Updated this week
• jashug / WhyNotW
  Repository holding code and latex sources for paper "Why Not W?"
  ☆11Updated 3 years ago
• IanOrton / cubical-topos-experiments
  Agda code for experimenting with internal models of cubical type theory
  ☆13Updated 6 years ago
• jespercockx / reflection-tutorial
  ☆17Updated 6 years ago
• AndrasKovacs / preordertt
  Experiments with preordered set models of (directed) type theories
  ☆15Updated 5 years ago
• TOTBWF / agda-sgd
  Experiments in Synthetic Differential Geometry
  ☆15Updated 3 years ago
• thery / T2048
  a version of the 2048 game for Coq
  ☆22Updated last year
• nmvdw / Three-HITs
  All higher inductive types can be obtained from three simple HITs.
  ☆17Updated 6 years ago
• andreasabel / agda2lagda
  Simple conversion from Agda text to literate Agda text.
  ☆14Updated last month
• UlfNorell / quasi-quote
  Quasi-quoting library for agda
  ☆17Updated last month
• RedPRL / sml-dependent-lcf
  A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!
  ☆16Updated 6 years ago
• limemloh / cubical-congruence
  Congruence Closure Procedure in Cubical Agda
  ☆16Updated 4 years ago
• ayberkt / simplc
  A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.
  ☆16Updated 5 years ago
• rodrigogribeiro / unification
  Formalisation of a type unification algorithm in Coq proof assistant.
  ☆19Updated 6 years ago
• andrejbauer / miniLCF
  A bare-bones LCF-style proof assistant
  ☆21Updated 5 years ago
• ericfinster / opetopic-types
  Higher Algebra with Opetopic Types
  ☆14Updated last year
• Deducteam / Agda2Dedukti
  ☆17Updated 2 years ago
• wilbowma / cic-redex
  A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.
  ☆33Updated 7 years ago
• flupe / generics
  ☆23Updated 6 months ago
• arthuraa / agda-hoas-demo
  Experiments with higher-order abstract syntax in Agda
  ☆19Updated 2 years ago
• jonsterling / constructive-sheaf-semantics
  I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.
  ☆16Updated 10 years ago
• bitonic / tog
  ☆26Updated 7 years ago
• ericfinster / opetopes-in-agda
  Formalization of Opetopes and Opetopic Sets in Agda
  ☆18Updated 8 years ago