Alternatives and similar repositories for mlang

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

• Guest0x0 / normalization-bench
  Benchmarking various normalization algorithms for the lambda calculus
  ☆46Updated 2 years ago
• adamgundry / type-inference
  Unification and type inference algorithms
  ☆125Updated 10 years ago
• edwinb / SPLV20
  SPLV20 course notes
  ☆112Updated 2 years ago
• lambda-pi-plus / lambda-pi-plus
  A simple Depdently-Typed Language for Research and Learning
  ☆57Updated 9 years ago
• msp-strath / TypOS
  being an operating system for typechecking processes
  ☆128Updated 2 years ago
• plclub / metalib
  The Penn Locally Nameless Metatheory Library
  ☆75Updated 5 months ago
• wenkokke / schmitty
  Agda bindings to SMT-LIB2 compatible solvers.
  ☆101Updated 2 weeks ago
• agda / agda-pkg
  apkg - package manager for Agda
  ☆38Updated 4 years ago
• sstucki / system-f-agda
  A formalization of the polymorphic lambda calculus extended with iso-recursive types
  ☆72Updated 6 years ago
• pedagand / typechecker-evolution
  The Evolution of a Typechecker
  ☆54Updated 6 years ago
• pigworker / TypesWhoSayNi
  being the materials for a paper I have in mind to write about the bidirectional discipline
  ☆52Updated last month
• andreasabel / miniagda
  A prototypical dependently typed languages with sized types and variances
  ☆111Updated last month
• mortberg / yacctt
  yacctt: Yet Another Cartesian Cubical Type Theory
  ☆75Updated 7 years ago
• jozefg / nbe-for-mltt
  Normalization by Evaluation for Martin-Löf Type Theory
  ☆128Updated last year
• plclub / lngen
  Tool for generating Locally Nameless definitions and proofs in Coq, working together with Ott
  ☆32Updated 10 months ago
• david-christiansen / derive-all-the-instances
  Work on type class deriving with elaboration reflection
  ☆32Updated 6 years ago
• guillaumebrunerie / initiality
  A formalized proof of a version of the initiality conjecture
  ☆43Updated 4 years ago
• scmu / aopa
  Algebra of Programming in Agda: Dependent Types for Relational Program Derivation
  ☆83Updated 9 years ago
• AndrasKovacs / stlc-nbe
  Correctness of normalization-by-evaluation for STLC
  ☆23Updated 5 years ago
• zaklogician / linear-constructive
  Linear Logic for Constructive Mathematics, in Agda
  ☆17Updated 6 years ago
• dlicata335 / cart-cube
  Cartesian Cubical Type Theory
  ☆71Updated 4 years ago
• sweirich / replib
  Replib: generic programming & Unbound: generic treatment of binders
  ☆45Updated 2 years ago
• gallais / potpourri
  Where my everyday research happens
  ☆55Updated 2 months ago
• xnning / EvEff
  Efficient Haskell effect handlers based on evidence translation.
  ☆84Updated 4 years ago
• alhassy / next-700-module-systems
  PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.
  ☆82Updated 3 years ago
• tomdjong / MGS-domain-theory
  Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…
  ☆46Updated last year
• unicoq / unicoq
  An enhanced unification algorithm for Coq
  ☆56Updated 4 months ago
• jldodds / coq-lean-cheatsheet
  A quick reference for mapping Coq tactics to Lean tactics
  ☆72Updated 4 years ago
• AndrasKovacs / implicit-fun-elaboration
  Implementation for ICFP 2020 paper
  ☆54Updated 4 years ago
• Trebor-Huang / combinator-nbe
  Normalization by evaluation of simply typed combinators.
  ☆26Updated 3 years ago