Alternatives and similar repositories for gradual-typing-in-agda

Users that are interested in gradual-typing-in-agda are comparing it to the libraries listed below

• jsiek / abstract-binding-trees
  Abstract binding trees (abstract syntax trees plus binders), as a library in Agda
  ☆80Updated 4 months ago
• abella-prover / abella
  An interactive theorem prover based on lambda-tree syntax
  ☆98Updated this week
• favonia / hdtt2020-notes
  ☆36Updated 4 years ago
• unicoq / unicoq
  An enhanced unification algorithm for Coq
  ☆58Updated last month
• scmu / aopa
  Algebra of Programming in Agda: Dependent Types for Relational Program Derivation
  ☆85Updated 9 years ago
• WhatisRT / meta-cedille
  Minimalistic dependent type theory with syntactic metaprogramming
  ☆60Updated last year
• gebner / hott3
  HoTT in Lean 3
  ☆82Updated 5 years ago
• mortberg / gen-cart
  A Unifying Cartesian Cubical Set Model
  ☆35Updated 6 years ago
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆85Updated 4 years ago
• Mtac2 / Mtac2
  ☆56Updated last week
• uwplse / pumpkin-pi
  An extension to PUMPKIN PATCH with support for proof repair across type equivalences.
  ☆49Updated 4 months ago
• jsiek / denotational_semantics
  Denotational semantics based on graph and filter models
  ☆23Updated last year
• andreasabel / miniagda
  A prototypical dependently typed languages with sized types and variances
  ☆115Updated 5 months ago
• rocq-community / manifesto
  Documentation on goals of the Rocq-community organization, the shared contributing guide and code of conduct.
  ☆68Updated 9 months ago
• adamgundry / type-inference
  Unification and type inference algorithms
  ☆127Updated 10 years ago
• AndrasKovacs / system-f-omega
  System F-omega normalization by hereditary substitution in Agda
  ☆62Updated 6 years ago
• HarrisonGrodin / agda-calf
  A cost-aware logical framework, embedded in Agda.
  ☆70Updated 2 months ago
• rocq-community / autosubst
  Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]
  ☆67Updated last year
• FrozenWinters / stlc
  This aims to be the most pretentious implementation of stlc in existence
  ☆65Updated 3 years ago
• vrahli / NuprlInCoq
  Implementation of Nuprl's type theory in Coq
  ☆46Updated last year
• AndrasKovacs / cctt
  high-performance cubical evaluation
  ☆77Updated 8 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
• nick8325 / twee
  An equational theorem prover based on Knuth-Bendix completion
  ☆57Updated last month
• sweirich / rebound
  # A simple variable binding library based on well-scoped indices and environments
  ☆28Updated 2 months ago
• rocq-archive / coq-in-coq
  A formalisation of the Calculus of Constructions
  ☆70Updated last year
• jozefg / nbe-for-mltt
  Normalization by Evaluation for Martin-Löf Type Theory
  ☆131Updated last year
• mit-plv / rupicola
  Gallina to Bedrock2 compilation toolkit
  ☆65Updated last week
• msp-strath / cs410-advanced-functional-programming
  CS410 "Advanced Functional Programming"
  ☆28Updated 7 months ago
• Lysxia / system-F
  Formalization of the polymorphic lambda calculus and its parametricity theorem
  ☆36Updated 9 months ago
• affeldt-aist / monae
  Monadic effects and equational reasoning in Rocq
  ☆74Updated 3 weeks ago