jwiegley / coq-cds4ltlLinks
A formalization of finite, constructive log analysis using linear temporal logic
☆22Updated last week
Alternatives and similar repositories for coq-cds4ltl
Users that are interested in coq-cds4ltl are comparing it to the libraries listed below
Sorting:
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 3 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☆27Updated last year
- Austin's supercompiler work☆21Updated 5 years ago
- A usable type system for call by push-value☆33Updated 5 years ago
- Compositional type checking for Haskell☆37Updated 14 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Small implementation of OutsideIn(X) type checking algorithm☆31Updated 10 years ago
- Dependently typed elimination functions using singletons☆28Updated 7 months ago
- An efficient graph library for Haskell☆38Updated 2 months ago
- An implementation of the Haskell ByteString library using the Fiat system from MIT☆34Updated 3 years ago
- Agda-style equational reasoning in Haskell☆54Updated 4 months ago
- nominal sets in haskell☆19Updated 6 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated 8 months ago
- machine fusion☆16Updated 6 years ago
- Bring fusion to everyone☆13Updated 5 years ago
- ☆23Updated last year
- A tiny implementation of dependent types.☆11Updated 7 years ago
- Unpinned byte arrays in GHC haskell☆22Updated 6 years ago
- Zippers for cofree types☆13Updated 3 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
- topos programming☆31Updated 6 years ago
- Bidirectional programming in Haskell with monadic profunctors☆46Updated 3 years ago
- Folds for recursive types with GHC Generics☆28Updated 5 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated last month
- Quantitative Type Theory implementation☆54Updated 4 years ago
- Linear map categories in Agda☆5Updated 2 years ago
- Constructs FAlgebras from typeclasses, making Haskell functions homoiconic☆18Updated 6 years ago
- Compiler for IMP programming language implemented in Haskell☆16Updated 5 years ago
- Fine-grained lattice primitives for Haskell☆37Updated last month