Alternatives and similar repositories for dissertation:

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

• wilbowma / cic-redex
  A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.
  ☆34Updated 7 years ago
• neel-krishnaswami / inverse-bidirectional-typechecking
  A Toy Inverse Bidirectional Typechecker
  ☆31Updated 5 years ago
• ucsd-progsys / mist
  A tiny language for teaching and experimenting with Refinement Types
  ☆47Updated 3 years ago
• andrejbauer / miniLCF
  A bare-bones LCF-style proof assistant
  ☆22Updated 5 years ago
• andreasabel / helf
  Haskell implementation of the Edinburgh Logical Framework
  ☆27Updated 6 months ago
• jonsterling / coq-guarded-computational-type-theory
  ☆21Updated 7 years ago
• hazelgrove / hazelnut-dynamics-agda
  mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics
  ☆21Updated 10 months ago
• jonsterling / coq-domains
  ☆18Updated 2 years ago
• rocq-community / dblib
  Coq library for working with de Bruijn indices [maintainer=@KevOrr]
  ☆30Updated 3 years ago
• david-christiansen / idris-interaction.rkt
  A Racket library for interacting with Idris over the IDE protocol
  ☆31Updated 7 years ago
• rowandavies / sml-cidre
  SML Checker for Intersection and Datasort Refinements (pronounced "cider")
  ☆20Updated 11 years ago
• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆110Updated 4 years ago
• jespercockx / reflection-tutorial
  ☆17Updated 6 years ago
• david-christiansen / epigram1
  A version of Epigram 1 that can run with newer GHCs
  ☆52Updated 7 years ago
• Lysxia / system-F
  Formalization of the polymorphic lambda calculus and its parametricity theorem
  ☆34Updated last month
• cedille / cedille-developments
  A showcase of interesting code and proof developments in Cedille
  ☆36Updated 2 years ago
• rodrigogribeiro / unification
  Formalisation of a type unification algorithm in Coq proof assistant.
  ☆19Updated 6 years ago
• robsimmons / abbot
  Generation of abstract binding trees
  ☆28Updated 6 months ago
• maxsnew / modal-scheme
  A Scheme-like CBPV language with Racket Interoperability
  ☆39Updated last year
• jozefg / undergraduate-thesis
  A discouraging story.
  ☆15Updated 6 years ago
• gallais / agda-sizedIO
  IO using sized types and copatterns
  ☆33Updated 4 years ago
• neel-krishnaswami / linearml
  A simple implementation of linear type theory
  ☆38Updated 8 years ago
• jespercockx / popl19-tutorial
  Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais
  ☆26Updated 6 years ago
• pigworker / Bi71
  being a bidirectional reformulation of Martin-Löf's 1971 type theory
  ☆25Updated 7 years ago
• thery / T2048
  a version of the 2048 game for Coq
  ☆22Updated last year
• UlfNorell / quasi-quote
  Quasi-quoting library for agda
  ☆17Updated 4 months ago
• Saizan / miller
  Miller/pattern unification in Agda
  ☆65Updated 11 years ago
• Mtac2 / Mtac2
  ☆55Updated 3 weeks ago
• zaklogician / typical-antiphrasis
  Paradoxes of type theory, described didactically. With accompanying proofs in Agda.
  ☆39Updated 4 years ago
• mietek / agda-intro
  Mirror of Conor McBride’s 2011 Agda course materials
  ☆12Updated 6 years ago