jwiegley / coq-cds4ltlLinks
A formal verification of Linear Temporal Logic in Coq
☆23Updated 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
- Dependently typed elimination functions using singletons☆28Updated 8 months ago
- Austin's supercompiler work☆21Updated 5 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
- A usable type system for call by push-value☆33Updated 5 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- An Agda library for reasoning about asynchronous iterative algorithms and network routing problems☆28Updated last year
- Hack idiom-brackets using GHC Source Plugin (8.6+)☆25Updated 7 years ago
- Syntactic evaluation of STLC (incl. proof of normalization a la Software Foundations)☆13Updated 7 years ago
- ☆12Updated 9 years ago
- Bidirectional programming in Haskell with monadic profunctors☆47Updated 3 years ago
- Small implementation of OutsideIn(X) type checking algorithm☆31Updated 10 years ago
- System F implemented in Haskell☆24Updated 13 years ago
- Compositional type checking for Haskell☆37Updated 14 years ago
- machine fusion☆16Updated 6 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated 9 months ago
- Bring fusion to everyone☆13Updated 5 years ago
- Zippers for cofree types☆13Updated 3 years ago
- An efficient graph library for Haskell☆38Updated 2 weeks ago
- Simple Haskell package for efficiently indexable finite and infinite enumerations.☆12Updated 4 months ago
- A terminal UI for inspecting steps taken by a rewriting process. Useful for the optimization phase of a compiler, or even evaluators of s…☆21Updated 5 years ago
- An implementation of the Haskell ByteString library using the Fiat system from MIT☆34Updated 3 years ago
- The Pico core language, and the Bake algorithm for elaborating Dependent Haskell into the former (WIP)☆15Updated 7 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 2 months ago
- Compiler for IMP programming language implemented in Haskell☆16Updated 5 years ago
- Agda-style equational reasoning in Haskell☆54Updated 5 months ago
- Compiler backend for generating Scheme code☆26Updated last year
- Deriving Storable instances using GHC.Generics☆16Updated 3 years ago
- Experiments in abstracting definitional interpreters☆16Updated 7 years ago