Alternatives and similar repositories for ataca:

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

• DimaSamoz / agda-soas
  Agda formalisation of second-order abstract syntax
  ☆55Updated 2 years ago
• AndrasKovacs / setoidtt
  Prototype implementations of systems based on setoid type theory
  ☆65Updated 4 years ago
• jaycech3n / Isabelle-HoTT
  An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle
  ☆34Updated 2 years ago
• AndrasKovacs / system-f-omega
  System F-omega normalization by hereditary substitution in Agda
  ☆58Updated 5 years ago
• flupe / generics
  ☆23Updated 10 months ago
• wenkokke / AutoInAgda
  Proof automation – for Agda, in Agda.
  ☆44Updated 4 years ago
• effectfully / inference-in-agda
  A tutorial on how Agda infers things
  ☆41Updated 4 years ago
• sstucki / system-f-agda
  A formalization of the polymorphic lambda calculus extended with iso-recursive types
  ☆71Updated 5 years ago
• gallais / agda-nbe
  Formalizing nbe in agda
  ☆30Updated 12 years ago
• gallais / potpourri
  Where my everyday research happens
  ☆52Updated this week
• frex-project / idris-frex
  ☆47Updated 5 months ago
• HuStmpHrrr / mech-type-theories
  Mechanizations of Type Theories
  ☆28Updated 2 months ago
• adamgundry / type-inference
  Unification and type inference algorithms
  ☆125Updated 10 years ago
• anuyts / menkar
  The multimode presheaf proof-assistant
  ☆36Updated 2 years ago
• L-TChen / MtacAR
  Mtac in Agda
  ☆28Updated 4 years ago
• logsem / mitten_preorder
  ☆29Updated 2 years ago
• nachivpn / nbe-course
  NbE course @ Chalmers
  ☆28Updated 7 months ago
• pedagand / typechecker-evolution
  The Evolution of a Typechecker
  ☆54Updated 6 years ago
• mr-ohman / logrel-mltt
  A Logical Relation for Martin-Löf Type Theory in Agda
  ☆52Updated 7 months ago
• effectfully / Generic
  A library for doing generic programming in Agda
  ☆31Updated 4 years ago
• lambdageek / unbound-generics
  Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)
  ☆56Updated last year
• effectfully / OTT
  Observational Type Theory as an Agda library
  ☆52Updated 7 years ago
• WhatisRT / meta-cedille
  Minimalistic dependent type theory with syntactic metaprogramming
  ☆57Updated 10 months ago
• ayberkt / formal-topology-in-UF
  Formal Topology in Univalent Foundations (WIP).
  ☆36Updated 2 years ago
• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆112Updated 4 years ago
• gallais / agda-sizedIO
  IO using sized types and copatterns
  ☆34Updated 4 years ago
• jsiek / abstract-binding-trees
  Abstract binding trees (abstract syntax trees plus binders), as a library in Agda
  ☆75Updated 5 months ago
• gallais / generic-syntax
  A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs
  ☆72Updated 3 years ago
• gallais / typing-with-leftovers
  Self-contained repository for the eponymous paper
  ☆29Updated 6 years ago
• rocq-community / autosubst
  Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]
  ☆59Updated 7 months ago