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
  ☆36Updated 3 weeks ago
• rzrn / anders
  Anders: Cubical Type Checker
  ☆23Updated last year
• RedPRL / stagedtt
  🪆 A Staged Type Theory
  ☆35Updated last year
• ToposInstitute / polytt
  A type theory with native support for Polynomial Functors.
  ☆39Updated last year
• AndrasKovacs / dtt-rtcg
  Demo for dependent types + runtime code generation
  ☆69Updated 4 months ago
• RedPRL / asai
  🩺 A library for compiler diagnostics
  ☆46Updated 5 months ago
• neel-krishnaswami / inverse-bidirectional-typechecking
  A Toy Inverse Bidirectional Typechecker
  ☆31Updated 6 years ago
• polytypic / f-omega-mu
  Fωμ type checker and compiler
  ☆54Updated 2 years ago
• xnning / MpEff
  Efficient effect handlers based on Evidence Passing Semantics.
  ☆31Updated 4 years ago
• rocq-community / topology
  General topology in Coq [maintainers=@amiloradovsky,@Columbus240,@stop-cran]
  ☆48Updated 8 months ago
• frex-project / idris-frex
  ☆48Updated last month
• RedPRL / algaett
  🦠 An experimental elaborator for dependent type theory using effects and handlers
  ☆37Updated last year
• coq-tactician / coq-tactician
  A Seamless, Interactive Tactic Learner and Prover for Coq
  ☆72Updated this week
• adrieng / melitte
  Toy implementation of Martin-Löf Type Theory
  ☆28Updated 2 years ago
• yallop / ocaml-flap
  A deterministic parser with fused lexing
  ☆73Updated 2 years ago
• kwanghoon / bidi
  bidirectional type checking algorithms for higher-ranked polymorphism
  ☆19Updated 3 years ago
• effectfully / inference-in-agda
  A tutorial on how Agda infers things
  ☆58Updated last week
• thery / hanoi
  Hanoi tower in Coq
  ☆26Updated last week
• frex-project / agda-fragment
  Algebraic proof discovery in Agda
  ☆34Updated 3 years ago
• AndrasKovacs / normalization-bench
  Lambda normalization and conversion checking benchmarks for various implementations
  ☆59Updated 4 years ago
• hide-kawabata / traf
  A proof tree viewer that works with Coq through Proof General
  ☆28Updated 4 years ago
• zanzix / idris-neural-net
  An implementation of a simple Neural network in Idris using category theory.
  ☆23Updated 9 months ago
• Lysxia / system-F
  Formalization of the polymorphic lambda calculus and its parametricity theorem
  ☆35Updated 4 months ago
• FreeProving / free-compiler
  A Haskell to Coq compiler that represents effectful programs with the free monad
  ☆45Updated 3 years ago
• gelisam / typechecker-combinators
  ☆17Updated last year
• ocaml-gospel / cameleer
  A Deductive Verification Tool for OCaml Programs
  ☆73Updated last month
• UChicago-PL / smyth
  Programming-by-example in a typed functional language with sketches. Smyth = Sketching + Myth.
  ☆54Updated 4 years ago
• mmcqd / pure
  A pure type system implemented in OCaml
  ☆78Updated 4 years ago
• wenkokke / idris-sesh
  Session types in Idris2!
  ☆27Updated 4 years ago
• maxsnew / grammars-and-semantic-actions
  Intrinsic Verification of Formal Grammar Theory
  ☆26Updated this week