yav / presburger
Decision procedures for Presburger arithmetic in Haskell
☆29Updated last month
Alternatives and similar repositories for presburger:
Users that are interested in presburger are comparing it to the libraries listed below
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22Updated 8 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 5 months ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- being the programs and code for a paper about general recursion☆25Updated 10 years ago
- System F in coq.☆19Updated 10 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- Haskell implementation of the Edinburgh Logical Framework☆27Updated 6 months ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- A package exposing a function for generating catamorphisms.☆28Updated 7 years ago
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Updated 5 years ago
- ☆17Updated 2 years ago
- Category theory and algebra☆28Updated 8 years ago
- Dependently typed elimination functions using singletons☆28Updated 4 months ago
- Linear map categories in Agda☆5Updated 2 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 2 years ago
- ☆23Updated 7 years ago
- An abstract machine using indexed containers and their zippers☆14Updated 8 years ago
- Interpreter for functional pure type systems.☆21Updated 7 years ago
- System F implemented in Haskell☆24Updated 13 years ago
- A universe of scope- and type-safe syntaxes (syntices?). Includes generic implementation of type-preserving renaming/substitution with al…☆16Updated 7 years ago
- IO using sized types and copatterns☆34Updated 4 years ago
- A partial binary associative operator (appendMaybe :: a → a → Maybe a)☆13Updated 6 months ago
- Type-Theory in Sequent Calculus☆13Updated 9 years ago
- [Talk] Framing the Discussion with EDSLs☆9Updated 10 years ago
- Library implementation of "Generic description of well-scoped, well-typed syntaxes"☆12Updated 7 years ago
- Demonstration for how to build "traverse" using GHC.Generics efficiently☆22Updated 6 years ago
- being an experiment with potato power☆23Updated 5 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago