Alternatives and similar repositories for unification:

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

• andreasabel / helf
  Haskell implementation of the Edinburgh Logical Framework
  ☆27Updated 5 months ago
• gmalecha / coq-interaction-trees
  Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.
  ☆17Updated 6 years ago
• sstucki / pts-agda
  A formalization of Pure Type Systems (PTS) in Agda
  ☆23Updated 2 months ago
• pigworker / Bi71
  being a bidirectional reformulation of Martin-Löf's 1971 type theory
  ☆25Updated 7 years ago
• andrejbauer / miniLCF
  A bare-bones LCF-style proof assistant
  ☆22Updated 5 years 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
• wilbowma / cic-redex
  A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.
  ☆33Updated 7 years ago
• tomdjong / domain-theory-in-uf
  ☆11Updated 4 years ago
• cedille / cedille-developments
  A showcase of interesting code and proof developments in Cedille
  ☆36Updated 2 years ago
• jonsterling / coq-domains
  ☆18Updated 2 years ago
• 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 7 years ago
• thery / T2048
  a version of the 2048 game for Coq
  ☆22Updated last year
• pigworker / Totality
  being the programs and code for a paper about general recursion
  ☆25Updated 10 years ago
• pigworker / Ohrid-Agda
  being my notes and exercises for the Types Summer School in Ohrid, (FYRO) Macedonia, July 2017
  ☆9Updated 7 years ago
• nbenton / coqdomains
  Domain theory and denotational semantics in Coq
  ☆10Updated 10 years ago
• gallais / agda-sizedIO
  IO using sized types and copatterns
  ☆33Updated 3 years ago
• jozefg / undergraduate-thesis
  A discouraging story.
  ☆15Updated 6 years ago
• L-TChen / FiniteSets
  Fintie Sets in Cubical Agda
  ☆12Updated 5 years ago
• danelahman / Normalization-By-Evaluation
  Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories
  ☆15Updated 11 years ago
• laMudri / quantitative
  ☆16Updated 3 years ago
• heades / System-F-Coq
  System F in coq.
  ☆19Updated 10 years ago
• gallais / typing-with-leftovers
  Self-contained repository for the eponymous paper
  ☆29Updated 6 years ago
• andreasabel / ipl
  Agda formalization of Intuitionistic Propositional Logic
  ☆22Updated last year
• nmvdw / Three-HITs
  All higher inductive types can be obtained from three simple HITs.
  ☆17Updated 6 years ago
• jonsterling / constructive-sheaf-semantics
  I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.
  ☆17Updated 10 years ago
• IanOrton / cubical-topos-experiments
  Agda code for experimenting with internal models of cubical type theory
  ☆13Updated 6 years ago
• jashug / WhyNotW
  Repository holding code and latex sources for paper "Why Not W?"
  ☆11Updated 4 years ago
• UlfNorell / quasi-quote
  Quasi-quoting library for agda
  ☆17Updated 3 months ago
• AndrasKovacs / universes
  Generalized syntax & semantics for universe hierarchies
  ☆29Updated last year