Alternatives and similar repositories for IsarMathLib

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

• gilith / opentheory
  The opentheory tool processes higher order logic theory packages
  ☆16Updated 2 years ago
• gmalecha / coq-printf
  Implementation of sprintf for Coq
  ☆18Updated 5 years ago
• wilbowma / cic-redex
  A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.
  ☆34Updated 8 years ago
• peterlefanulumsdaine / general-type-theories
  A (formalised) general definition of type theories
  ☆59Updated 4 years ago
• uwplse / CoqAST
  Fun plugin to play with the Gallina AST.
  ☆38Updated 6 years ago
• mortberg / gen-cart
  A Unifying Cartesian Cubical Set Model
  ☆35Updated 6 years ago
• AndrasKovacs / universes
  Generalized syntax & semantics for universe hierarchies
  ☆32Updated 2 years ago
• pigworker / Samizdat
  being bits and pieces I'm inclined to leave lying around
  ☆55Updated 6 months ago
• iwilare / church-rosser
  A complete proof in Agda of the Church-Rosser theorem for untyped λ-calculus formalizing the methods by Komori-Matsuda-Yamakawa (2014) an…
  ☆29Updated 3 years ago
• arthuraa / deriving
  Class instances for Coq inductive types with little boilerplate
  ☆27Updated last week
• Lysxia / system-F
  Formalization of the polymorphic lambda calculus and its parametricity theorem
  ☆36Updated 9 months ago
• gbaz / mess
  Martin-Löf Extensible Specification and Simulator
  ☆29Updated 10 years ago
• ionathanch / parapoly
  A LaTeX-typeset reproduction of Reynolds' "Types, Abstraction and Parametric Polymorphism"
  ☆32Updated last year
• andrejbauer / miniLCF
  A bare-bones LCF-style proof assistant
  ☆25Updated 6 years ago
• jonsterling / agda-synthetic-domain-theory
  ☆17Updated 3 years ago
• Saizan / miller
  Miller/pattern unification in Agda
  ☆66Updated 2 months ago
• gallais / generic-syntax
  A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs
  ☆77Updated 3 years ago
• L-TChen / FiniteSets
  Fintie Sets in Cubical Agda
  ☆12Updated 6 years ago
• zydeco-lang / fiddle
  A dynamically-typed CBPV language embedded in Racket
  ☆39Updated last year
• peterlefanulumsdaine / palmgren-archive
  Research material of Erik Palmgren (1963–2019)
  ☆21Updated 9 months ago
• mr-ohman / logrel-mltt
  A Logical Relation for Martin-Löf Type Theory in Agda
  ☆55Updated 4 months ago
• guillaumebrunerie / initiality
  A formalized proof of a version of the initiality conjecture
  ☆45Updated 5 years ago
• kangxyz / cubical-classics
  An attempt towards univalent classical mathematics in Cubical Agda.
  ☆32Updated 2 years ago
• msp-strath / ask
  being a particular fragment of Haskell, extended to a proof system
  ☆43Updated last month
• vrahli / NuprlInCoq
  Implementation of Nuprl's type theory in Coq
  ☆46Updated last year
• CMU-HoTT / serre-finiteness
  ☆24Updated 2 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 2 months ago
• math-comp / Abel
  A proof of Abel-Ruffini theorem.
  ☆30Updated 2 months ago
• mietek / research
  Work in progress
  ☆39Updated 7 months 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 4 years ago