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
• guillaumebrunerie / initiality
  A formalized proof of a version of the initiality conjecture
  ☆41Updated 4 years ago
• gallais / potpourri
  Where my everyday research happens
  ☆53Updated last month
• wenkokke / AutoInAgda
  Proof automation – for Agda, in Agda.
  ☆44Updated 4 years ago
• jaycech3n / Isabelle-HoTT
  An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle
  ☆34Updated 2 years ago
• flupe / generics
  ☆23Updated last year
• AndrasKovacs / system-f-omega
  System F-omega normalization by hereditary substitution in Agda
  ☆59Updated 5 years ago
• anuyts / menkar
  The multimode presheaf proof-assistant
  ☆36Updated 2 years ago
• sstucki / system-f-agda
  A formalization of the polymorphic lambda calculus extended with iso-recursive types
  ☆71Updated 6 years ago
• mr-ohman / logrel-mltt
  A Logical Relation for Martin-Löf Type Theory in Agda
  ☆54Updated 9 months ago
• ayberkt / formal-topology-in-UF
  Formal Topology in Univalent Foundations (WIP).
  ☆36Updated 2 years ago
• frex-project / idris-frex
  ☆48Updated last month
• alhassy / gentle-intro-to-reflection
  A slow-paced introduction to reflection in Agda. ---Tactics!
  ☆101Updated 3 years ago
• andreasabel / agda2lagda
  Simple conversion from Agda text to literate Agda text.
  ☆14Updated 3 months ago
• CHTT-s18 / lecture-notes
  ☆27Updated 5 years ago
• gallais / generic-syntax
  A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs
  ☆73Updated 3 years ago
• HuStmpHrrr / mech-type-theories
  Mechanizations of Type Theories
  ☆30Updated this week
• logsem / mitten_preorder
  ☆29Updated 2 years ago
• wenkokke / schmitty
  Agda bindings to SMT-LIB2 compatible solvers.
  ☆100Updated 9 months ago
• gallais / agda-nbe
  Formalizing nbe in agda
  ☆31Updated 12 years ago
• lambdageek / unbound-generics
  Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)
  ☆56Updated last year
• adamgundry / type-inference
  Unification and type inference algorithms
  ☆125Updated 10 years ago
• FrozenWinters / stlc
  This aims to be the most pretentious implementation of stlc in existence
  ☆63Updated 3 years ago
• nachivpn / nbe-course
  NbE course @ Chalmers
  ☆28Updated 9 months ago
• L-TChen / MtacAR
  Mtac in Agda
  ☆28Updated 4 years ago
• gallais / typing-with-leftovers
  Self-contained repository for the eponymous paper
  ☆30Updated 6 years ago
• Lysxia / system-F
  Formalization of the polymorphic lambda calculus and its parametricity theorem
  ☆35Updated 3 months ago
• jespercockx / agda2scheme
  Compiler backend for generating Scheme code
  ☆26Updated last year
• sstucki / pts-agda
  A formalization of Pure Type Systems (PTS) in Agda
  ☆26Updated last week