Alternatives and similar repositories for agdARGS

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

• rowandavies / sml-cidre
  SML Checker for Intersection and Datasort Refinements (pronounced "cider")
  ☆20Updated 12 years ago
• ilya-klyuchnikov / henk
  Pure Type Systems for Functional Programming
  ☆31Updated 5 years ago
• bitonic / tog
  ☆26Updated 8 years ago
• rodrigogribeiro / unification
  Formalisation of a type unification algorithm in Coq proof assistant.
  ☆21Updated 7 years ago
• ISANobody / sill
  ☆29Updated 10 years ago
• Saizan / miller
  Miller/pattern unification in Agda
  ☆67Updated 3 weeks ago
• andreasabel / helf
  Haskell implementation of the Edinburgh Logical Framework
  ☆31Updated 6 months ago
• dboulytchev / miniKanren-coq
  A certified semantics for relational programming workout.
  ☆26Updated 5 years ago
• neel-krishnaswami / linearml
  A simple implementation of linear type theory
  ☆38Updated 8 years ago
• gbaz / mess
  Martin-Löf Extensible Specification and Simulator
  ☆29Updated 10 years ago
• MrChico / Reals-in-agda
  Constructive definition of real numbers implemented in agda.
  ☆10Updated 9 years ago
• gallais / agda-sizedIO
  IO using sized types and copatterns
  ☆36Updated 4 years ago
• pigworker / potato
  being an experiment with potato power
  ☆23Updated 5 years ago
• maximedenes / coq-amd64
  ☆21Updated 9 years ago
• jonsterling / agda-effectful-forcing
  Agda formalization of the paper, "Higher-Order Functions and Brouwer's Thesis". Deduces a Brouwer ordinal from a function ((nat -> nat) -…
  ☆12Updated 5 years ago
• effectfully / Cubes
  A dependently typed type checker for a TT with intervals
  ☆23Updated 5 years ago
• osa1 / MANTI
  A pure subset of Prolog, implemented in Haskell
  ☆31Updated 12 years ago
• cedille / cedille-developments
  A showcase of interesting code and proof developments in Cedille
  ☆36Updated 5 months ago
• taktoa / eqsat
  A language-generic implementation of equality saturation in Haskell
  ☆21Updated 6 years ago
• jonsterling / hs-abt
  Type safe abstract binding trees for Haskell, using Vinyl
  ☆16Updated 8 years ago
• LightAndLight / idris-but-its-c
  Idris, but it's C
  ☆24Updated 7 years ago
• andrejbauer / miniLCF
  A bare-bones LCF-style proof assistant
  ☆25Updated 6 years ago
• tov / alms
  The Alms Programming Language
  ☆44Updated 7 years ago
• hazelgrove / agda-popl17
  Mechanization of Hazelnut, as submitted to POPL 2017
  ☆16Updated 3 years ago
• UCSD-PL / nano-smt
  "Toy" SMT Solver for Educational Purposes
  ☆20Updated 12 years ago
• pigworker / Totality
  being the programs and code for a paper about general recursion
  ☆26Updated 10 years ago
• bobatkey / foveran
  A Dependently Typed Programming Language
  ☆27Updated 5 years ago
• jozefg / miniprl
  A small implementation of a proof refinement logic.
  ☆50Updated 8 years ago
• david-christiansen / epigram1
  A version of Epigram 1 that can run with newer GHCs
  ☆54Updated 8 years ago
• wilbowma / dissertation
  The source for "Compiling with Dependent Types" (my dissertation)
  ☆30Updated 3 years ago