Alternatives and similar repositories for T2048

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

• tomdjong / domain-theory-in-uf
  ☆11Updated 5 years ago
• gmalecha / coq-interaction-trees
  Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.
  ☆18Updated 7 years ago
• uemurax / synthetic-topos-theory
  ☆15Updated 2 years ago
• peterlefanulumsdaine / palmgren-archive
  Research material of Erik Palmgren (1963–2019)
  ☆21Updated 7 months ago
• AndrasKovacs / thesis
  my phd thesis
  ☆26Updated last year
• UlfNorell / quasi-quote
  Quasi-quoting library for agda
  ☆18Updated last year
• proofengineering / proofengineering-bib
  BibTeX bibliographies for proof engineering-related papers
  ☆30Updated 6 years ago
• ezyang / lr-agda
  Logical relations proof in Agda
  ☆27Updated 10 years ago
• MetaRocq / rocq-verified-extraction
  Verified Extraction from Rocq to OCaml/Malfunction
  ☆13Updated 6 months ago
• jespercockx / popl19-tutorial
  Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais
  ☆26Updated 6 years ago
• cofibrant / agda-nbe
  Verified NbE via gluing in Agda
  ☆11Updated last year
• nmvdw / Three-HITs
  All higher inductive types can be obtained from three simple HITs.
  ☆17Updated 7 years ago
• SimonBoulier / TypingFlags
  A Coq plugin to disable positivity check, guard check and termination check
  ☆16Updated 6 years ago
• gmalecha / coq-printf
  Implementation of sprintf for Coq
  ☆18Updated 5 years ago
• andreasabel / helf
  Haskell implementation of the Edinburgh Logical Framework
  ☆31Updated 7 months ago
• lambdabetaeta / modal-logics
  Agda formalisation of dual-context constructive modal logics.
  ☆20Updated 5 years ago
• Lysxia / system-F
  Formalization of the polymorphic lambda calculus and its parametricity theorem
  ☆36Updated 8 months ago
• FrozenWinters / SbE
  An extension of the NbE algorithm to produce computational traces
  ☆22Updated 3 years ago
• metaborg / linear.agda
  A library and case-study for linear, intrinsically-typed interpreters in Agda
  ☆36Updated 5 years ago
• pigworker / LEOG
  being an implementation of the calculus of constructions
  ☆17Updated 2 years ago
• jwiegley / coq-lattice
  A reflection-based proof tactic for lattices in Coq
  ☆21Updated 2 years ago
• ayberkt / sequents
  Proof search for intuitionistic propositional logic using Dyckhoff's LJT.
  ☆26Updated 2 years ago
• andreasabel / ipl
  Agda formalization of Intuitionistic Propositional Logic
  ☆22Updated 3 weeks ago
• jonsterling / coq-domains
  ☆18Updated 3 years ago
• pigworker / EGTBS
  being the introduction to co-de-Bruijn metasyntax
  ☆23Updated 3 years ago
• jonsterling / agda-synthetic-domain-theory
  ☆17Updated 3 years ago
• andrejbauer / miniLCF
  A bare-bones LCF-style proof assistant
  ☆25Updated 6 years ago
• L-TChen / MtacAR
  Mtac in Agda
  ☆28Updated 4 years ago
• logsem / mitten_preorder
  ☆30Updated 2 years ago
• jespercockx / cubes
  An implementation of (some fragment of) cubical type theory using rewrite rules, based on a talk given by Conor McBride at the 23rd Agda'…
  ☆12Updated 9 years ago