Alternatives and similar repositories for presburger

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

• thsutton / cha
  A port of miniprl to Haskell with co-/inductive types bolted on the side.
  ☆22Updated 9 years ago
• DanBurton / system-f
  System F implemented in Haskell
  ☆24Updated 13 years ago
• ziman / itt
  Tiny dependent calculus with inference of irrelevance and erasure
  ☆15Updated 5 years ago
• effectfully / STLC
  Dependently typed Algorithm M and friends
  ☆25Updated 7 years ago
• pigworker / Ming
  being the emperor of Mongo, but also a verb
  ☆15Updated 6 years ago
• RyanGlScott / eliminators
  Dependently typed elimination functions using singletons
  ☆28Updated 11 months ago
• pigworker / Totality
  being the programs and code for a paper about general recursion
  ☆26Updated 10 years ago
• ericfinster / opetopes-in-agda
  Formalization of Opetopes and Opetopic Sets in Agda
  ☆18Updated 8 years ago
• joom / WangsAlgorithm
  A classical propositional theorem prover in Haskell, using Wang's Algorithm.
  ☆36Updated 6 years ago
• m0ar / lollipop
  A general purpose programming language with linear types
  ☆43Updated 8 years ago
• twanvl / ttie
  Type Theory with Indexed Equality
  ☆26Updated 8 years ago
• dorchard / effects-as-sessions
  Formalised embedding of an imperative language with effect system into session-typed pi calculus.
  ☆29Updated last year
• Toxaris / pts
  Interpreter for functional pure type systems.
  ☆21Updated 8 years ago
• heades / System-F-Coq
  System F in coq.
  ☆19Updated 10 years ago
• effectfully / Cubes
  A dependently typed type checker for a TT with intervals
  ☆23Updated 5 years ago
• gallais / agda-sizedIO
  IO using sized types and copatterns
  ☆36Updated 4 years ago
• andreasabel / helf
  Haskell implementation of the Edinburgh Logical Framework
  ☆31Updated 7 months ago
• ayberkt / Mini-TT
  A tiny implementation of dependent types.
  ☆11Updated 8 years ago
• mrkgnao / pico
  The Pico core language, and the Bake algorithm for elaborating Dependent Haskell into the former (WIP)
  ☆15Updated 7 years ago
• pcapriotti / agda-categories
  Category theory and algebra
  ☆26Updated 9 years ago
• dalaing / type-systems
  ☆23Updated 8 years ago
• gergoerdi / syntactic-stlc
  Syntactic evaluation of STLC (incl. proof of normalization a la Software Foundations)
  ☆13Updated 8 years ago
• LightAndLight / parametricity-proofs
  Proofs of the number of inhabitants of polymorphic functions
  ☆23Updated 7 years ago
• emilaxelsson / imperative-edsl
  Deep embedding of imperative programs with code generation
  ☆23Updated 3 years ago
• L-TChen / MtacAR
  Mtac in Agda
  ☆28Updated 4 years ago
• yveszhang / ldtyping
  ☆12Updated 9 years ago
• hazelgrove / agda-popl17
  Mechanization of Hazelnut, as submitted to POPL 2017
  ☆16Updated 4 years ago
• neel-krishnaswami / linearml
  A simple implementation of linear type theory
  ☆38Updated 8 years ago
• gallais / agdarky
  Agda suffices: software written from A to Z in Agda
  ☆16Updated 6 years ago
• jozefg / miniprl
  A small implementation of a proof refinement logic.
  ☆50Updated 8 years ago