benjaminselfridge / logixLinks
Logic Explorer - customizable proof construction tool for sequent calculi
☆21Updated 3 years ago
Alternatives and similar repositories for logix
Users that are interested in logix are comparing it to the libraries listed below
Sorting:
- Dependently typed elimination functions using singletons☆28Updated 11 months ago
- A formal verification of Linear Temporal Logic in Coq☆23Updated last month
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Proofs of the number of inhabitants of polymorphic functions☆23Updated 7 years ago
- An Agda library for reasoning about asynchronous iterative algorithms and network routing problems☆28Updated last year
- Syntactic evaluation of STLC (incl. proof of normalization a la Software Foundations)☆13Updated 8 years ago
- ☆17Updated 7 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22Updated 9 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 5 months ago
- Type Theory with Indexed Equality☆26Updated 8 years ago
- Bring fusion to everyone☆14Updated 5 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- Relative Monad Library for Agda☆24Updated 6 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Updated 5 years ago
- Compiler for IMP programming language implemented in Haskell☆16Updated 5 years ago
- A usable type system for call by push-value☆33Updated 6 years ago
- "Programs that explain their effects" talk material☆17Updated 7 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated last month
- System F implemented in Haskell☆24Updated 13 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 7 months ago
- Mtac in Agda☆28Updated 4 years ago
- using Data and Typeable to get a direct reflection system for free, when we're implementing a toy language in Haskell☆15Updated 5 years ago
- ☆23Updated 2 years ago
- Combinators for manipulating dependently-typed predicates.☆14Updated last year
- A general yet easy-to-use formalization of Big O, Big Theta, and more based on seminormed vector spaces.☆36Updated 8 years ago
- Austin's supercompiler work☆21Updated 6 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- An implementation of the Haskell ByteString library using the Fiat system from MIT☆34Updated 3 years ago
- Small implementation of OutsideIn(X) type checking algorithm☆31Updated 10 years ago
- A package re-exporting the verified subset of containers☆20Updated 7 years ago