QuickCheck extension for higher-order properties
☆19Feb 14, 2022Updated 4 years ago
Alternatives and similar repositories for quickcheck-higherorder
Users that are interested in quickcheck-higherorder are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- Abstract, inspectable JSON representation of Haskell objects☆26Jul 4, 2022Updated 3 years ago
- GraphQL Schema generation in Haskell☆17Mar 27, 2020Updated 5 years ago
- Type safe JSON PostgreSQL queries using bidirectional serializers☆21Nov 27, 2020Updated 5 years ago
- A toy implementation of the dependently typed lambda calculus known as λΠ☆12Jan 29, 2020Updated 6 years ago
- Haskell implementation of Glumpy☆12Jun 21, 2021Updated 4 years ago
- GHC plugin for hlint☆11Oct 4, 2023Updated 2 years ago
- using Data and Typeable to get a direct reflection system for free, when we're implementing a toy language in Haskell☆15Feb 21, 2020Updated 6 years ago
- Union mount in Haskell, with fsnotify☆12Dec 23, 2025Updated 3 months ago
- Materials for OPLSS 2021☆11Jun 1, 2021Updated 4 years ago
- Recover run-time type information from the GHC heap. One example use case is a "show anything" function (with no Show constraint).☆35Mar 6, 2026Updated 2 weeks ago
- Read and write images as massiv arrays☆13Oct 23, 2021Updated 4 years ago
- Symbol manipulation☆37Apr 17, 2023Updated 2 years ago
- Shared Cheat Sheet for Coq☆10Sep 8, 2016Updated 9 years ago
- Manipulating numbers with inherent measurement/experimental uncertainty.☆25Sep 11, 2024Updated last year
- A simple combinator library☆30Nov 5, 2018Updated 7 years ago
- An implementation of first-class pattern matches in Haskell.☆13Feb 25, 2026Updated 3 weeks ago
- Implementations of various toy programming languages☆12Apr 19, 2018Updated 7 years ago
- A Gradual Dependently-typed Language☆14Jun 26, 2019Updated 6 years ago
- A Formalization of TeX in Coq☆11Feb 27, 2022Updated 4 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Jan 14, 2019Updated 7 years ago
- Overloaded plugin☆31Jun 15, 2024Updated last year
- An efficient, embeddable DPLL SAT solver in Haskell☆37Jul 2, 2015Updated 10 years ago
- Regular expressions of types☆16Sep 13, 2018Updated 7 years ago
- Experiments with modal types☆17Oct 20, 2020Updated 5 years ago
- Category theory concepts in type classes and instances.☆23Mar 13, 2026Updated last week
- Helpers which allow safe partial pattern matching in lambdas☆31Oct 21, 2020Updated 5 years ago
- Haskell time library focusing on performance☆59Nov 24, 2025Updated 4 months ago
- miniKanren with a first-order representation of the search space☆17Mar 11, 2026Updated last week
- Awesome Agda Programming☆19Sep 22, 2025Updated 6 months ago
- Haskell bindings to Rust's regex library☆19Mar 24, 2025Updated 11 months ago
- Make git commits with pretty hashes☆30Aug 4, 2020Updated 5 years ago
- F-omega with interval kinds mechanized in Agda☆14Aug 1, 2024Updated last year
- Funny little Haskell impl☆18Oct 28, 2020Updated 5 years ago
- the ever-shifting depths of the Underworld are not as once they were...☆17Mar 16, 2026Updated last week
- Benchmarking Haskell extensible-effect libraries.☆34Aug 2, 2020Updated 5 years ago
- A simple library for defining ADTs☆15Oct 10, 2023Updated 2 years ago
- Py.test style assertions in Haskell☆67Jun 16, 2018Updated 7 years ago
- Some info that supposed to help to understand PureScript from Haskell perspective☆32Aug 22, 2018Updated 7 years ago
- Subscribe URLs with custom UA, cookie and referer☆16May 18, 2017Updated 8 years ago