jwiegley / coq-cds4ltl
A formalization of finite, constructive log analysis using linear temporal logic
☆20Updated 2 weeks ago
Alternatives and similar repositories for coq-cds4ltl:
Users that are interested in coq-cds4ltl are comparing it to the libraries listed below
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 2 years ago
- Bring fusion to everyone☆13Updated 5 years ago
- Dependently typed elimination functions using singletons☆28Updated 3 months ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- Experiments in abstracting definitional interpreters☆16Updated 7 years ago
- being the programs and code for a paper about general recursion☆25Updated 10 years ago
- Proofs of the number of inhabitants of polymorphic functions☆23Updated 6 years ago
- machine fusion☆16Updated 6 years ago
- An experimental build system based on the Haxl library☆8Updated 6 years ago
- Austin's supercompiler work☆21Updated 5 years ago
- Folds for recursive types with GHC Generics☆26Updated 5 years ago
- Linear map categories in Agda☆5Updated last year
- Small implementation of OutsideIn(X) type checking algorithm☆31Updated 10 years ago
- System F implemented in Haskell☆24Updated 13 years ago
- A usable type system for call by push-value☆33Updated 5 years ago
- Regular expressions of types☆16Updated 6 years ago
- Physical dimensions and operations☆9Updated 6 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- Agda-style equational reasoning in Haskell☆53Updated 2 weeks ago
- Synthetic Differential Geometry in Agda☆12Updated 10 years ago
- Bidirectional programming in Haskell with monadic profunctors☆46Updated 2 years ago
- CLI tool for Hackage☆26Updated 3 months ago
- A language-generic implementation of equality saturation in Haskell☆21Updated 6 years ago
- Unpinned byte arrays in GHC haskell☆22Updated 6 years ago
- An efficient graph library for Haskell☆39Updated 8 months ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- Build Status A Haskell implementation of the ZKBoo protocol for non-interactive zero-knowledge arguments of boolean circuits.☆18Updated 6 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- ☆16Updated 3 years ago
- "An Altruistic Processor", implemented in CLaSH (WARNING: incomplete code)☆13Updated 8 years ago