yav / presburgerLinks
Decision procedures for Presburger arithmetic in Haskell
☆30Updated 4 months ago
Alternatives and similar repositories for presburger
Users that are interested in presburger are comparing it to the libraries listed below
Sorting:
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22Updated 9 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated 8 months ago
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- System F implemented in Haskell☆24Updated 13 years ago
- Dependently typed Algorithm M and friends☆25Updated 7 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 3 months ago
- IO using sized types and copatterns☆35Updated 4 years ago
- A classical propositional theorem prover in Haskell, using Wang's Algorithm.☆36Updated 6 years ago
- Category theory and algebra☆28Updated 9 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- Dependently typed elimination functions using singletons☆28Updated 7 months ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 3 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- System F in coq.☆19Updated 10 years ago
- ☆12Updated 9 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- A general purpose programming language with linear types☆43Updated 8 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Updated 5 years ago
- Type Theory with Indexed Equality☆26Updated 8 years ago
- being bits and pieces I'm inclined to leave lying around☆53Updated last month
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 3 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 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
- Mtac in Agda☆28Updated 4 years ago
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 7 years ago
- Interpreter for functional pure type systems.☆21Updated 8 years ago