5 Commits

Author	SHA1	Message	Date
Michael Walker	9ca54fea17	Include one-step lookahead in traces	2015-07-08 18:55:30 +01:00
Michael Walker	8794276a3e	Add a Show instance for SCTTrees	2015-07-08 18:17:48 +01:00
Michael Walker	8944ea97a5	Use schedule bounding as the primary SCT approach. ... This allows results to be naturally reported as lazy trees, rather than as lists representing a tree traversal. This in turn means that the actual bound can be moved outwards to the testing code, and not used at all in the runner. Trees let us do nice things with shrinking and short-circuiting, if we make the (fairly reasonable) assumption that the children of a buggy result will exhibit the same bug. Storing results as trees does complicate the predicate helper functions somewhat, but I think the clarity gained in the actual SCT code is well worth it.	2015-06-19 16:50:51 +01:00
Michael Walker	00ad122b65	Refactor code and update docs to make more not-me friendly	2015-02-01 01:21:42 +00:00
Michael Walker	fbc262c361	Rename and remodularise	2015-01-31 15:50:54 +00:00