Alternatives and similar repositories for acs-category-theory-notes-2017

Users that are interested in acs-category-theory-notes-2017 are comparing it to the libraries listed below

• 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
• andrejbauer / miniLCF
  A bare-bones LCF-style proof assistant
  ☆24Updated 5 years ago
• gergoerdi / stlc-agda
  STLC-related snippets in Agda
  ☆16Updated 12 years ago
• jozefg / miniprl
  A small implementation of a proof refinement logic.
  ☆50Updated 7 years ago
• gallais / typing-with-leftovers
  Self-contained repository for the eponymous paper
  ☆30Updated 6 years ago
• IanOrton / cubical-topos-experiments
  Agda code for experimenting with internal models of cubical type theory
  ☆14Updated 7 years ago
• ericfinster / higher-alg
  An approach to higher algebra in type theory
  ☆23Updated 5 years ago
• AndrasKovacs / universes
  Generalized syntax & semantics for universe hierarchies
  ☆29Updated last year
• sstucki / f-omega-int-agda
  F-omega with interval kinds mechanized in Agda
  ☆13Updated 10 months ago
• mietek / research
  Work in progress
  ☆34Updated last week
• mietek / imla2017
  Agda formalisation of NbE for λ□
  ☆18Updated 7 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
• effectfully / random-stuff
  ☆19Updated 9 months ago
• sweirich / trellys
  Automatically exported from code.google.com/p/trellys
  ☆46Updated 5 years ago
• sconybeare / mltt
  Implementation of Martin-Löf Type Theory in Haskell
  ☆16Updated 9 years ago
• rodrigogribeiro / unification
  Formalisation of a type unification algorithm in Coq proof assistant.
  ☆19Updated 6 years ago
• peterlefanulumsdaine / palmgren-archive
  Research material of Erik Palmgren (1963–2019)
  ☆20Updated 2 months ago
• ericfinster / opetopes-in-agda
  Formalization of Opetopes and Opetopic Sets in Agda
  ☆18Updated 8 years ago
• tomdjong / domain-theory-in-uf
  ☆11Updated 4 years ago
• wilbowma / cic-redex
  A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.
  ☆34Updated 8 years ago
• laMudri / quantitative
  ☆16Updated 3 years ago
• sstucki / pts-agda
  A formalization of Pure Type Systems (PTS) in Agda
  ☆23Updated 4 months ago
• pigworker / Samizdat
  being bits and pieces I'm inclined to leave lying around
  ☆50Updated 5 months ago
• nachivpn / nbe-course
  NbE course @ Chalmers
  ☆28Updated 8 months 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 8 years ago
• andreasabel / agda2lagda
  Simple conversion from Agda text to literate Agda text.
  ☆14Updated 2 months ago
• FrozenWinters / SbE
  An extension of the NbE algorithm to produce computational traces
  ☆22Updated 3 years ago
• anuyts / menkar
  The multimode presheaf proof-assistant
  ☆36Updated 2 years ago
• Deducteam / Agda2Dedukti
  ☆19Updated 3 years ago
• nbenton / coqdomains
  Domain theory and denotational semantics in Coq
  ☆10Updated 10 years ago