Alternatives and similar repositories for mlang:

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

• plclub / lngen
  Tool for generating Locally Nameless definitions and proofs in Coq, working together with Ott
  ☆30Updated 3 months ago
• Guest0x0 / normalization-bench
  Benchmarking various normalization algorithms for the lambda calculus
  ☆44Updated 2 years ago
• sstucki / system-f-agda
  A formalization of the polymorphic lambda calculus extended with iso-recursive types
  ☆70Updated 5 years ago
• AndrasKovacs / stlc-nbe
  Correctness of normalization-by-evaluation for STLC
  ☆22Updated 5 years ago
• unicoq / unicoq
  An enhanced unification algorithm for Coq
  ☆53Updated last week
• ekmett / bound
  Combinators for manipulating locally-nameless generalized de Bruijn terms
  ☆123Updated 6 months ago
• sweirich / replib
  Replib: generic programming & Unbound: generic treatment of binders
  ☆44Updated 2 years ago
• adamgundry / type-inference
  Unification and type inference algorithms
  ☆124Updated 9 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)…
  ☆44Updated 11 months ago
• wenkokke / schmitty
  Agda bindings to SMT-LIB2 compatible solvers.
  ☆95Updated 4 months ago
• lambda-pi-plus / lambda-pi-plus
  A simple Depdently-Typed Language for Research and Learning
  ☆57Updated 8 years ago
• zaklogician / linear-constructive
  Linear Logic for Constructive Mathematics, in Agda
  ☆17Updated 5 years ago
• scmu / aopa
  Algebra of Programming in Agda: Dependent Types for Relational Program Derivation
  ☆80Updated 8 years ago
• edwinb / SPLV20
  SPLV20 course notes
  ☆108Updated 2 years ago
• andreasabel / miniagda
  A prototypical dependently typed languages with sized types and variances
  ☆106Updated 2 years ago
• dlicata335 / hott-agda
  ☆84Updated 7 years ago
• lambdageek / unbound-generics
  Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)
  ☆56Updated 10 months ago
• fredefox / cat
  A formalization of category theory in cubical Agda
  ☆57Updated 4 years ago
• Saizan / cubical-demo
  ☆45Updated 5 years ago
• pigworker / CS410-18
  being the teaching materials and exercises for CS410 in the 2018/19 session
  ☆56Updated 5 years ago
• Trebor-Huang / combinator-nbe
  Normalization by evaluation of simply typed combinators.
  ☆26Updated 2 years ago
• msp-strath / TypOS
  being an operating system for typechecking processes
  ☆123Updated last year
• dlicata335 / cart-cube
  Cartesian Cubical Type Theory
  ☆71Updated 3 years ago
• wenkokke / AutoInAgda
  Proof automation – for Agda, in Agda.
  ☆44Updated 4 years ago
• pigworker / MetaprogAgda
  being the materials for Summer 2013's course
  ☆112Updated last year
• AndrasKovacs / setoidtt
  Prototype implementations of systems based on setoid type theory
  ☆65Updated 4 years ago
• mortberg / yacctt
  yacctt: Yet Another Cartesian Cubical Type Theory
  ☆75Updated 6 years ago
• pedagand / typechecker-evolution
  The Evolution of a Typechecker
  ☆54Updated 6 years ago
• ayberkt / formal-topology-in-UF
  Formal Topology in Univalent Foundations (WIP).
  ☆35Updated 2 years ago
• sweirich / corespec
  A Specification for Dependent Types in Haskell (Core)
  ☆64Updated 2 years ago