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

• uemurax / synthetic-topos-theory
  ☆15Updated last year
• nmvdw / Three-HITs
  All higher inductive types can be obtained from three simple HITs.
  ☆17Updated 7 years ago
• peterlefanulumsdaine / palmgren-archive
  Research material of Erik Palmgren (1963–2019)
  ☆21Updated 5 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 12 years ago
• lambdabetaeta / modal-logics
  Agda formalisation of dual-context constructive modal logics.
  ☆20Updated 5 years ago
• jonsterling / agda-synthetic-domain-theory
  ☆17Updated 3 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
• thery / T2048
  a version of the 2048 game for Coq
  ☆22Updated last year
• IanOrton / cubical-topos-experiments
  Agda code for experimenting with internal models of cubical type theory
  ☆15Updated 7 years ago
• cofibrant / agda-nbe
  Verified NbE via gluing in Agda
  ☆11Updated last year
• jonsterling / coq-domains
  ☆18Updated 3 years ago
• AndrasKovacs / thesis
  my phd thesis
  ☆26Updated last year
• L-TChen / MtacAR
  Mtac in Agda
  ☆28Updated 4 years ago
• AndrasKovacs / polynomial-model
  A polynomial model of a Martin-Löf type theory + a bit of game semantics
  ☆32Updated 3 years ago
• nachivpn / nbe-course
  NbE course @ Chalmers
  ☆28Updated 11 months ago
• pigworker / Bi71
  being a bidirectional reformulation of Martin-Löf's 1971 type theory
  ☆25Updated 8 years ago
• UlfNorell / quasi-quote
  Quasi-quoting library for agda
  ☆18Updated 9 months ago
• sstucki / pts-agda
  A formalization of Pure Type Systems (PTS) in Agda
  ☆27Updated 2 months ago
• logsem / mitten_preorder
  ☆29Updated 2 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
• flupe / generics
  ☆23Updated last year
• mietek / imla2017
  Agda formalisation of NbE for λ□
  ☆18Updated 7 years ago
• gallais / thesis
  Syntaxes with Binding, Their Programs, and Proofs
  ☆23Updated last year
• andreasabel / ipl
  Agda formalization of Intuitionistic Propositional Logic
  ☆22Updated 3 months ago
• rahulc29 / realizability
  Experiments with Realizability in Univalent Type Theory
  ☆18Updated 10 months ago
• pigworker / EGTBS
  being the introduction to co-de-Bruijn metasyntax
  ☆23Updated 3 years ago
• Deducteam / Agda2Dedukti
  ☆21Updated 3 years ago
• andreasabel / agda2lagda
  Simple conversion from Agda text to literate Agda text.
  ☆14Updated last week
• andreasabel / helf
  Haskell implementation of the Edinburgh Logical Framework
  ☆31Updated 4 months ago
• L-TChen / BiSig
  Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically
  ☆21Updated last year