Alternatives and similar repositories for aopa

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

• adamgundry / type-inference
  Unification and type inference algorithms
  ☆125Updated 10 years ago
• gallais / generic-syntax
  A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs
  ☆77Updated 3 years ago
• dlicata335 / hott-agda
  ☆84Updated 8 years ago
• jozefg / nbe-for-mltt
  Normalization by Evaluation for Martin-Löf Type Theory
  ☆129Updated last year
• andreasabel / miniagda
  A prototypical dependently typed languages with sized types and variances
  ☆112Updated 3 months ago
• pigworker / MetaprogAgda
  being the materials for Summer 2013's course
  ☆113Updated 2 years ago
• steshaw / lennart-lambda
  λλλλ Lennart Augustsson's λ-calculus cooked four ways
  ☆53Updated 8 years ago
• gallais / potpourri
  Where my everyday research happens
  ☆55Updated last month
• algebraic-graphs / agda
  The theory of algebraic graphs formalised in Agda
  ☆91Updated 7 years ago
• jsiek / abstract-binding-trees
  Abstract binding trees (abstract syntax trees plus binders), as a library in Agda
  ☆78Updated 2 months ago
• UlfNorell / agda-prelude
  Programming library for Agda
  ☆133Updated last year
• effectfully / inference-in-agda
  A tutorial on how Agda infers things
  ☆63Updated 4 months ago
• jyp / nano-Agda
  Tiny type-checker with dependent types
  ☆78Updated 11 years ago
• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆115Updated 5 years ago
• UlfNorell / insane
  Toy typechecker for Insanely Dependent Types
  ☆82Updated 3 weeks ago
• sweirich / lambda-n-ways
  Benchmarks for capture-avoiding substitution
  ☆120Updated 5 months 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 4 years ago
• pigworker / TypesWhoSayNi
  being the materials for a paper I have in mind to write about the bidirectional discipline
  ☆52Updated 3 months ago
• sweirich / challenge
  Strongly-typed System F in Haskell
  ☆119Updated 3 years ago
• abella-prover / abella
  An interactive theorem prover based on lambda-tree syntax
  ☆99Updated last month
• wenkokke / schmitty
  Agda bindings to SMT-LIB2 compatible solvers.
  ☆103Updated 3 months ago
• mortberg / yacctt
  yacctt: Yet Another Cartesian Cubical Type Theory
  ☆75Updated 7 years ago
• sweirich / trellys
  Automatically exported from code.google.com/p/trellys
  ☆47Updated 6 years ago
• abooij / wiwikwlhott
  What I wish I knew when learning HoTT
  ☆53Updated 6 years ago
• gebner / hott3
  HoTT in Lean 3
  ☆82Updated 5 years ago
• agda / agda-pkg
  apkg - package manager for Agda
  ☆38Updated 4 years ago
• AndrasKovacs / system-f-omega
  System F-omega normalization by hereditary substitution in Agda
  ☆60Updated 6 years ago
• OPLSS / oplss-notes-2018
  Notes and handouts from OPLSS 2018
  ☆55Updated 7 years ago
• jaycech3n / Isabelle-HoTT
  An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle
  ☆34Updated 2 years ago
• wenkokke / AutoInAgda
  Proof automation – for Agda, in Agda.
  ☆44Updated 5 years ago