Skip to search formSkip to main contentSkip to account menu

QuickCheck

Known as: Quick check 
QuickCheck is a combinator library originally written in Haskell, designed to assist in software testing by generating test cases for test suites. It… 
Wikipedia (opens in a new tab)

Related topics

Related topics

47 relations
C++ClojureCombinator libraryCommon Lisp

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Validating the Meta-Theory of Programming Languages (Short Paper)
We report on work in progress in building an environment for the validation of the meta-theory of programming languages artifacts… 
2014
2014
A compositional automata-based semantics and preserving transformation rules for testing property patterns
Dwyer et al. provide a language to specify dynamic properties based on a limited number of predefined patterns and scopes. The… 
2014
2014
Predicting Diabetes by cosequencing the various Data Mining Classification Techniques
Diabetes affects between 2% to 4% of the global population and its avoidance and effective treatment are undoubtedly crucial… 
2013
2013
Comparison a Performance of Data Mining Algorithms (CPDMA) in Prediction Of Diabetes Disease
Detection of knowledge patterns in clinicial data through data mining. Data mining algorithms can be trained from past examples… 
2013
2013
On Integrating Deductive Synthesis and Verification Systems
We describe techniques for synthesis and verification of recursive functional programs over unbounded domains. Our techniques… 
2009
2009
New method accurately predicts carbon dioxide equilibrium adsorption isotherms
2007
2007
Strategies of a potential cash crop halophyte ( Beta vulgaris ssp . maritima ) to avoid salt injury
Salt stress effects were studied on Beta vulgaris ssp. maritima plants cultivated in defined nutrient solution in a gravel… 
2007
2007
Xmonad
xmonad is a tiling window manager for the X Window system, implemented, configured and dynamically extensible in Haskell. This… 
Review
2001
Review
2001
Efficient Parsing with Large-Scale Unification Grammars
The efficiency problem in parsing with large-scale unification grammars, including implementations in the Head-driven Phrase… 
2001
2001
Cardan Polynomials and the Reduction of Radicals
A quick check with a calculator shows that this expression is really 1, but how can one algebraically manipulate it into that… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)