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

• favonia / hdtt2020-notes
  ☆36Updated 3 years ago
• jsiek / abstract-binding-trees
  Abstract binding trees (abstract syntax trees plus binders), as a library in Agda
  ☆74Updated 4 months ago
• Mtac2 / Mtac2
  ☆54Updated 2 weeks ago
• andreasabel / miniagda
  A prototypical dependently typed languages with sized types and variances
  ☆107Updated 2 years ago
• unicoq / unicoq
  An enhanced unification algorithm for Coq
  ☆54Updated 2 weeks ago
• vrahli / NuprlInCoq
  Implementation of Nuprl's type theory in Coq
  ☆45Updated 3 months ago
• coq-community / autosubst
  Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]
  ☆55Updated 5 months ago
• RedPRL / mugen
  ♾️ A library for universe levels and universe polymorphism
  ☆34Updated 3 months ago
• scmu / aopa
  Algebra of Programming in Agda: Dependent Types for Relational Program Derivation
  ☆80Updated 8 years ago
• AndrasKovacs / cctt
  high-performance cubical evaluation
  ☆70Updated 3 months ago
• jespercockx / ataca
  A TACtic library for Agda
  ☆48Updated 5 months ago
• effectfully / inference-in-agda
  A tutorial on how Agda infers things
  ☆41Updated 4 years ago
• adamgundry / type-inference
  Unification and type inference algorithms
  ☆125Updated 10 years ago
• math-comp / algebra-tactics
  Ring, field, lra, nra, and psatz tactics for Mathematical Components
  ☆33Updated last month
• WhatisRT / meta-cedille
  Minimalistic dependent type theory with syntactic metaprogramming
  ☆57Updated 8 months ago
• Lysxia / system-F
  Formalization of the polymorphic lambda calculus and its parametricity theorem
  ☆34Updated 5 years ago
• kino3 / Mini-TT
  mirror of A simple type-theoretic language: Mini-TT
  ☆38Updated 8 years ago
• abella-prover / abella
  An interactive theorem prover based on lambda-tree syntax
  ☆92Updated last month
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆82Updated 3 years ago
• plclub / metalib
  The Penn Locally Nameless Metatheory Library
  ☆74Updated 8 months ago
• coq-community / paramcoq
  Old Coq plugin for parametricity [maintainer=@ppedrot]
  ☆45Updated 2 weeks ago
• mit-plv / rupicola
  Gallina to Bedrock2 compilation toolkit
  ☆53Updated this week
• nick8325 / twee
  An equational theorem prover based on Knuth-Bendix completion
  ☆50Updated 2 weeks ago
• frex-project / idris-frex
  ☆47Updated 3 months ago
• CakeML / pure
  A verified compiler for a lazy functional language
  ☆34Updated last month
• AndrasKovacs / setoidtt
  Prototype implementations of systems based on setoid type theory
  ☆65Updated 4 years ago
• jmlowenthal / agda-c
  Verified C programming in Agda
  ☆16Updated 3 years ago
• cedille / cedille-developments
  A showcase of interesting code and proof developments in Cedille
  ☆36Updated 2 years ago
• RedPRL / algaett
  🦠 An experimental elaborator for dependent type theory using effects and handlers
  ☆35Updated last year
• AndrasKovacs / normalization-bench
  Lambda normalization and conversion checking benchmarks for various implementations
  ☆54Updated 3 years ago