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
• gallais / potpourri
  Where my everyday research happens
  ☆53Updated last week
• effectfully / inference-in-agda
  A tutorial on how Agda infers things
  ☆42Updated 4 years ago
• flupe / generics
  ☆23Updated 11 months ago
• gallais / agda-nbe
  Formalizing nbe in agda
  ☆31Updated 12 years ago
• gallais / typing-with-leftovers
  Self-contained repository for the eponymous paper
  ☆30Updated 6 years ago
• AndrasKovacs / system-f-omega
  System F-omega normalization by hereditary substitution in Agda
  ☆59Updated 5 years ago
• L-TChen / MtacAR
  Mtac in Agda
  ☆28Updated 4 years ago
• pedagand / typechecker-evolution
  The Evolution of a Typechecker
  ☆54Updated 6 years ago
• HuStmpHrrr / mech-type-theories
  Mechanizations of Type Theories
  ☆30Updated 2 weeks ago
• AndrasKovacs / stlc-nbe
  Correctness of normalization-by-evaluation for STLC
  ☆22Updated 5 years ago
• effectfully / OTT
  Observational Type Theory as an Agda library
  ☆53Updated 8 years ago
• frex-project / idris-frex
  ☆47Updated 3 weeks ago
• wenkokke / AutoInAgda
  Proof automation – for Agda, in Agda.
  ☆44Updated 4 years ago
• guillaumebrunerie / initiality
  A formalized proof of a version of the initiality conjecture
  ☆41Updated 4 years ago
• logsem / mitten_preorder
  ☆29Updated 2 years ago
• andreasabel / helf
  Haskell implementation of the Edinburgh Logical Framework
  ☆30Updated last month
• jsiek / abstract-binding-trees
  Abstract binding trees (abstract syntax trees plus binders), as a library in Agda
  ☆75Updated 7 months ago
• lambdageek / unbound-generics
  Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)
  ☆56Updated last year
• alhassy / gentle-intro-to-reflection
  A slow-paced introduction to reflection in Agda. ---Tactics!
  ☆101Updated 3 years ago
• ayberkt / formal-topology-in-UF
  Formal Topology in Univalent Foundations (WIP).
  ☆36Updated 2 years ago
• effectfully / Generic
  A library for doing generic programming in Agda
  ☆31Updated 4 years ago
• andreasabel / agda2lagda
  Simple conversion from Agda text to literate Agda text.
  ☆14Updated 3 months ago
• UlfNorell / agda-bench
  Benchmarking tool for compile-time performance of Agda programs
  ☆19Updated 3 years ago
• rocq-community / autosubst
  Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]
  ☆59Updated 9 months ago
• Saizan / cubical-demo
  ☆45Updated 6 years ago
• wenkokke / msla2014
  wherein I implement several substructural logics in Agda
  ☆24Updated 6 years ago
• sstucki / pts-agda
  A formalization of Pure Type Systems (PTS) in Agda
  ☆24Updated 5 months ago