Alternatives and similar repositories for domain-theory-in-uf:

Users that are interested in domain-theory-in-uf are comparing it to the libraries listed below

• nmvdw / Three-HITs
  All higher inductive types can be obtained from three simple HITs.
  ☆17Updated 6 years ago
• sstucki / pts-agda
  A formalization of Pure Type Systems (PTS) in Agda
  ☆23Updated 2 months ago
• IanOrton / cubical-topos-experiments
  Agda code for experimenting with internal models of cubical type theory
  ☆13Updated 6 years ago
• jonsterling / coq-domains
  ☆18Updated 2 years ago
• L-TChen / FiniteSets
  Fintie Sets in Cubical Agda
  ☆12Updated 5 years ago
• UlfNorell / quasi-quote
  Quasi-quoting library for agda
  ☆17Updated 4 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 3 years ago
• nbenton / coqdomains
  Domain theory and denotational semantics in Coq
  ☆10Updated 10 years ago
• L-TChen / MtacAR
  Mtac in Agda
  ☆28Updated 3 years ago
• uemurax / synthetic-topos-theory
  ☆15Updated last year
• AndrasKovacs / preordertt
  Experiments with preordered set models of (directed) type theories
  ☆15Updated 5 years ago
• jonsterling / agda-synthetic-domain-theory
  ☆17Updated 2 years ago
• Deducteam / Agda2Dedukti
  ☆18Updated 3 years ago
• flupe / generics
  ☆23Updated 9 months ago
• andreasabel / agda2lagda
  Simple conversion from Agda text to literate Agda text.
  ☆14Updated 2 weeks ago
• AndrasKovacs / universes
  Generalized syntax & semantics for universe hierarchies
  ☆29Updated last year
• 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 8 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
• 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
• AndrasKovacs / thesis
  my phd thesis
  ☆26Updated 7 months ago
• andreasabel / helf
  Haskell implementation of the Edinburgh Logical Framework
  ☆27Updated 5 months ago
• mietek / imla2017
  Agda formalisation of NbE for λ□
  ☆18Updated 7 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 12 years ago
• FrozenWinters / SbE
  An extension of the NbE algorithm to produce computational traces
  ☆21Updated 2 years ago
• laMudri / quantitative
  ☆16Updated 3 years ago
• limemloh / cubical-congruence
  Congruence Closure Procedure in Cubical Agda
  ☆17Updated 4 years ago
• ericfinster / opetopic-types
  Higher Algebra with Opetopic Types
  ☆14Updated 2 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
• jashug / WhyNotW
  Repository holding code and latex sources for paper "Why Not W?"
  ☆11Updated 4 years ago