Alternatives and similar repositories for ant:

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

• liamoc / hilbert
  An intensely interactive, graphical theorem prover based on natural deduction
  ☆29Updated 10 years ago
• rowandavies / sml-cidre
  SML Checker for Intersection and Datasort Refinements (pronounced "cider")
  ☆20Updated 11 years ago
• annenkov / two-level
  Two-Level Type Theory
  ☆28Updated 5 years ago
• ioanluca / real-world-idris
  Malfunction backend for Idris with a FFI to OCaml
  ☆28Updated 5 years ago
• gfngfn / toy-macro-ml
  An implementation of MacroML [Ganz, Sabry & Taha 2001]
  ☆30Updated 6 years ago
• c-cube / choice
  Choice operator in OCaml, providing a backtracking monad
  ☆25Updated 3 years ago
• jonsterling / tt
  secret project
  ☆17Updated 6 years ago
• andrejbauer / miniLCF
  A bare-bones LCF-style proof assistant
  ☆22Updated 5 years ago
• mmcqd / higher-standard
  Higher kinded polymorphism in SML
  ☆15Updated 4 years ago
• adrieng / pulsar
  Experimental functional language
  ☆17Updated 2 years ago
• ecavallo / ptt
  Experimental type-checker for internally parametric type theory
  ☆32Updated 4 years ago
• ualib / ualib.github.io
  The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…
  ☆20Updated 3 years ago
• elpinal / types-1ml
  Type systems written in 1ML
  ☆9Updated 5 years ago
• jespercockx / reflection-tutorial
  ☆17Updated 6 years ago
• edwinb / idris2-clibs
  Idris 2 bindings to various C libraries
  ☆15Updated 3 years ago
• Chaaaos / formaltt
  Formalization of type theory
  ☆22Updated 3 years ago
• TOTBWF / agda-sgd
  Experiments in Synthetic Differential Geometry
  ☆16Updated 3 years ago
• standardml / parcom
  SML Parser Combinator Library
  ☆27Updated 8 years ago
• maximedenes / coq-amd64
  ☆22Updated 8 years ago
• ziman / itt-idris
  ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2
  ☆23Updated 2 months ago
• neel-krishnaswami / linearml
  A simple implementation of linear type theory
  ☆38Updated 7 years ago
• jespercockx / popl19-tutorial
  Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais
  ☆26Updated 6 years ago
• maxsnew / synthetic-domain-theory
  Experiment with synthetic domain theory in cubical agda
  ☆14Updated 2 years ago
• dhil / pthandlers
  an encoding of affine effect handlers using pthreads
  ☆14Updated 2 years ago
• lindig / lipsum
  A Literate Programming Tool inspired by NoWeb, implemented in OCaml
  ☆34Updated 6 years ago
• nikivazou / proof-combinators
  Proof combinators used in Liquid Haskell for theorem proving
  ☆12Updated 6 years ago
• Trebor-Huang / agda-linear
  An implementation of a Zeilberger-style linear type theory.
  ☆10Updated 3 years ago
• MLton / mltonlib
  The MLtonLibrary repository
  ☆35Updated last year
• andreasabel / helf
  Haskell implementation of the Edinburgh Logical Framework
  ☆27Updated 4 months ago