nomeata / ghc-proofs
Let GHC prove program equations for you
☆145Updated 6 years ago
Related projects ⓘ
Alternatives and complementary repositories for ghc-proofs
- Hopefully verifiable code generation in GHC☆95Updated 7 years ago
- Generic random generators☆81Updated last year
- Haskell tool to generate expressions from types☆101Updated 7 years ago
- Benchmarks for dictionary data structures: hash tables, maps, tries, etc.☆95Updated 2 years ago
- A magic typeclass that just does it☆124Updated 2 years ago
- Inspection Testing for Haskell☆173Updated last month
- constraint level if statements☆110Updated 6 years ago
- Monad Transformers and Classes☆78Updated 5 years ago
- A utility for displaying the module dependencies of Haskell programs.☆179Updated 4 months ago
- Efficient library for manipulating zip archives☆81Updated last week
- Hadrian: a new build system for the Glasgow Haskell Compiler. Now merged into the GHC tree!☆208Updated 5 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated 7 months ago
- Measuring CPU instructions in Haskell using Linux Performance Counters☆83Updated 6 years ago
- Measure allocations of a Haskell functions/values☆93Updated last week
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆122Updated 3 months ago
- A haskell numeric prelude, providing a clean structure for numbers and operations that combine them.☆68Updated 3 weeks ago
- An optimized general monad transformer for streaming applications, with a simple prelude of functions☆104Updated 6 years ago
- Drafts, notes and resources for adding linear typing to GHC.☆75Updated 4 years ago
- Safe, consistent, and easy exception handling☆134Updated last year
- Stream editing with Haskell Megaparsec parsers☆79Updated 5 months ago
- Test your Haskell code by exhaustively checking its properties☆134Updated last year
- Generic Programming using True Sums of Products☆157Updated 5 months ago
- An proof refinement logic for computational type theory. Inspired by Nuprl. [For up-to-date development, see JonPRL's successor, RedPRL: …☆110Updated 5 years ago
- Reifies arbitrary Haskell terms into types that can be reflected back into terms☆102Updated last week
- Haskell library for debugging☆122Updated 5 years ago
- Regex-based parsing with an applicative interface☆130Updated 2 years ago
- Benchmarks for sequence data structures: lists, vectors, etc.☆88Updated 2 years ago
- Various data structures for use in the Idris Language.☆95Updated 4 years ago
- ☆99Updated 6 years ago
- Lean Haskell Benchmarking☆90Updated 2 years ago