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

• jonsterling / constructive-sheaf-semantics
  I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.
  ☆17Updated 10 years ago
• cedille / cedille-developments
  A showcase of interesting code and proof developments in Cedille
  ☆36Updated 2 years ago
• mietek / imla2017
  Agda formalisation of NbE for λ□
  ☆18Updated 7 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
• mietek / research
  Work in progress
  ☆34Updated 3 months ago
• gallais / typing-with-leftovers
  Self-contained repository for the eponymous paper
  ☆29Updated 6 years ago
• IanOrton / cubical-topos-experiments
  Agda code for experimenting with internal models of cubical type theory
  ☆13Updated 6 years ago
• sconybeare / mltt
  Implementation of Martin-Löf Type Theory in Haskell
  ☆16Updated 9 years ago
• gergoerdi / stlc-agda
  STLC-related snippets in Agda
  ☆16Updated 11 years ago
• laMudri / quantitative
  ☆16Updated 3 years ago
• sweirich / trellys
  Automatically exported from code.google.com/p/trellys
  ☆46Updated 5 years ago
• rodrigogribeiro / unification
  Formalisation of a type unification algorithm in Coq proof assistant.
  ☆19Updated 6 years ago
• tomdjong / domain-theory-in-uf
  ☆11Updated 4 years ago
• andrejbauer / miniLCF
  A bare-bones LCF-style proof assistant
  ☆22Updated 5 years ago
• ericfinster / opetopes-in-agda
  Formalization of Opetopes and Opetopic Sets in Agda
  ☆18Updated 8 years ago
• sstucki / f-omega-int-agda
  F-omega with interval kinds mechanized in Agda
  ☆13Updated 7 months ago
• wenkokke / msla2014
  wherein I implement several substructural logics in Agda
  ☆24Updated 6 years ago
• gergoerdi / generic-syntax
  Library implementation of "Generic description of well-scoped, well-typed syntaxes"
  ☆12Updated 6 years ago
• hazelgrove / agda-popl17
  Mechanization of Hazelnut, as submitted to POPL 2017
  ☆16Updated 3 years ago
• nachivpn / nbe-course
  NbE course @ Chalmers
  ☆28Updated 5 months ago
• effectfully / random-stuff
  ☆19Updated 6 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
• jozefg / miniprl
  A small implementation of a proof refinement logic.
  ☆50Updated 7 years ago
• pigworker / Gigs-Summer-2018
  what I did on my holidays
  ☆12Updated 6 years ago
• wilbowma / cic-redex
  A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.
  ☆33Updated 7 years ago
• sstucki / pts-agda
  A formalization of Pure Type Systems (PTS) in Agda
  ☆23Updated last month
• AndrasKovacs / universes
  Generalized syntax & semantics for universe hierarchies
  ☆29Updated last year
• danelahman / Directed-Containers
  An Agda formalisation of the theory of directed containers
  ☆11Updated 13 years ago
• AndrasKovacs / preordertt
  Experiments with preordered set models of (directed) type theories
  ☆15Updated 5 years ago
• gallais / type-scope-semantics
  A self-contained repository for the paper Type and Scope Preserving Semantics
  ☆22Updated 6 years ago