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
  ☆54Updated 2 years ago
• AndrasKovacs / setoidtt
  Prototype implementations of systems based on setoid type theory
  ☆65Updated 4 years ago
• gallais / potpourri
  Where my everyday research happens
  ☆52Updated this week
• effectfully / inference-in-agda
  A tutorial on how Agda infers things
  ☆41Updated 4 years ago
• jaycech3n / Isabelle-HoTT
  An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle
  ☆34Updated 2 years ago
• lambdageek / unbound-generics
  Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)
  ☆56Updated 11 months ago
• wenkokke / AutoInAgda
  Proof automation – for Agda, in Agda.
  ☆44Updated 4 years ago
• flupe / generics
  ☆23Updated 8 months ago
• AndrasKovacs / system-f-omega
  System F-omega normalization by hereditary substitution in Agda
  ☆57Updated 5 years ago
• anuyts / menkar
  The multimode presheaf proof-assistant
  ☆36Updated 2 years ago
• HuStmpHrrr / mech-type-theories
  Mechanizations of Type Theories
  ☆28Updated 2 weeks ago
• frex-project / idris-frex
  ☆47Updated 3 months ago
• gallais / agda-nbe
  Formalizing nbe in agda
  ☆30Updated 12 years ago
• alhassy / gentle-intro-to-reflection
  A slow-paced introduction to reflection in Agda. ---Tactics!
  ☆99Updated 2 years ago
• jsiek / abstract-binding-trees
  Abstract binding trees (abstract syntax trees plus binders), as a library in Agda
  ☆74Updated 4 months ago
• L-TChen / MtacAR
  Mtac in Agda
  ☆28Updated 3 years ago
• coq-community / autosubst
  Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]
  ☆55Updated 5 months ago
• logsem / mitten_preorder
  ☆29Updated last year
• sstucki / system-f-agda
  A formalization of the polymorphic lambda calculus extended with iso-recursive types
  ☆70Updated 5 years ago
• mr-ohman / logrel-mltt
  A Logical Relation for Martin-Löf Type Theory in Agda
  ☆49Updated 5 months ago
• effectfully / Generic
  A library for doing generic programming in Agda
  ☆31Updated 4 years ago
• gallais / typing-with-leftovers
  Self-contained repository for the eponymous paper
  ☆29Updated 6 years ago
• agda / agda-stdlib-meta
  Meta-programming utilities for Agda.
  ☆18Updated this week
• gallais / generic-syntax
  A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs
  ☆72Updated 3 years ago
• pedagand / typechecker-evolution
  The Evolution of a Typechecker
  ☆54Updated 6 years ago
• adamgundry / type-inference
  Unification and type inference algorithms
  ☆125Updated 10 years ago
• guillaumebrunerie / initiality
  A formalized proof of a version of the initiality conjecture
  ☆41Updated 4 years ago
• ekmett / bound
  Combinators for manipulating locally-nameless generalized de Bruijn terms
  ☆123Updated 7 months ago
• abella-prover / abella
  An interactive theorem prover based on lambda-tree syntax
  ☆92Updated last month
• ayberkt / formal-topology-in-UF
  Formal Topology in Univalent Foundations (WIP).
  ☆35Updated 2 years ago