Alternatives and similar repositories for phd-dissertation

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

• CakeML / pure
  A verified compiler for a lazy functional language
  ☆37Updated this week
• rzrn / anders
  Anders: Cubical Type Checker
  ☆23Updated last year
• RedPRL / asai
  🩺 A library for compiler diagnostics
  ☆47Updated last month
• RedPRL / stagedtt
  🪆 A Staged Type Theory
  ☆35Updated 2 years ago
• RedPRL / algaett
  🦠 An experimental elaborator for dependent type theory using effects and handlers
  ☆37Updated last month
• sweirich / rebound
  # A simple variable binding library based on well-scoped indices and environments
  ☆17Updated this week
• AndrasKovacs / dtt-rtcg
  Demo for dependent types + runtime code generation
  ☆71Updated 7 months ago
• CakeML / candle
  The Candle theorem prover (fork of the HOL Light sources)
  ☆15Updated last year
• rocq-community / topology
  General topology in Coq [maintainers=@amiloradovsky,@Columbus240,@stop-cran]
  ☆51Updated 11 months ago
• ToposInstitute / polytt
  A type theory with native support for Polynomial Functors.
  ☆39Updated last year
• jespercockx / agda-core
  A work-in-progress core language for Agda, in Agda
  ☆55Updated 3 weeks ago
• math-comp / hierarchy-builder
  High level commands to declare a hierarchy based on packed classes
  ☆102Updated last week
• polytypic / f-omega-mu
  Fωμ type checker and compiler
  ☆54Updated 2 years ago
• coq-tactician / coq-tactician
  A Seamless, Interactive Tactic Learner and Prover for Coq
  ☆74Updated last month
• neel-krishnaswami / inverse-bidirectional-typechecking
  A Toy Inverse Bidirectional Typechecker
  ☆32Updated 6 years ago
• HarrisonGrodin / agda-calf
  A cost-aware logical framework, embedded in Agda.
  ☆66Updated 2 weeks ago
• adrieng / melitte
  Toy implementation of Martin-Löf Type Theory
  ☆30Updated 3 years ago
• jkoppel / ecta
  ☆36Updated last year
• effectfully / inference-in-agda
  A tutorial on how Agda infers things
  ☆61Updated 2 months ago
• RedPRL / algaeff
  🦠 Reusable components based on algebraic effects
  ☆51Updated last month
• ocaml-gospel / cameleer
  A Deductive Verification Tool for OCaml Programs
  ☆75Updated last month
• xnning / MpEff
  Efficient effect handlers based on Evidence Passing Semantics.
  ☆32Updated 4 years ago
• metaocaml / metaocaml-bibliography
  MetaML and MetaOCaml bibliography
  ☆93Updated 9 months ago
• andrejbauer / clerical
  Command-like expressions for real infinite-precision calculations
  ☆54Updated last month
• dunhamsteve / newt
  A toy dependent typed language.
  ☆32Updated this week
• maxsnew / grammars-and-semantic-actions
  Intrinsic Verification of Formal Grammar Theory
  ☆26Updated 2 months ago
• UChicago-PL / smyth
  Programming-by-example in a typed functional language with sketches. Smyth = Sketching + Myth.
  ☆55Updated 4 years ago
• emilyriehl / yoneda
  comparative formalizations of the Yoneda lemma for 1-categories and infinity-categories
  ☆68Updated 11 months ago
• lexa-lang / lexa
  ☆37Updated last month
• mb64 / xtt
  A simple implementation of XTT, "A cubical language for Bishop sets"
  ☆27Updated 3 years ago