Sandy Maguire
Sandy Maguire
Someone (I can't remember who, sorry!) suggested that QuickSpec support a more generalized test formatter, capable of writing tests for languages other than Haskell. This seems extremely valuable to me,...
I've been working with the following signature in my projects: ```haskell monoid :: Sig monoid = background [ con "mempty" $ liftC @(Monoid A) $ mempty @A , con ""...
I've been thinking that `defaultTo` is too blunt of a tool to be effectively wielded. What do you think about changing its type signature to: ```haskell defaultTo :: Signature ->...
Consider the following signature: ```haskell quickSpec $ signature [ con "zero" $ liftC @(Num A) $ zero @A , con "0" $ liftC @(Num A) $ (0 :: A) ,...
My sig: ```haskell == Functions == subst1 :: Subst1 -> LexemeVW' () () -> [LexemeVW' () ()] var :: Var -> LexemeVW' () () lex :: Lexeme -> LexemeVW' ()...
I'm looking for optimizations for a certain expensive term in my program. It'd be great if I could ask QuickSpec to generate terms as usual and tell me if any...
In the following, I am asking for only laws about `rewardThen`: ```text == Functions == win :: Game lose :: Game reward :: Reward -> Game subgame :: Game ->...
note to self: ```haskell == Laws == quickspec_laws :: [(String, Property)] quickspec_laws = [ ( "cat x failMatch = failMatch" , property $ \ (x :: Regex Bool3) -> cat...
Some functions have bad asymptotics on adversarial inputs that quickspec is quite good at finding. It'd be nice to be able to give a `Property`-based `Observe`, so that the observation...
When using quickspec to find laws useful for optimization, it's helpful to look for laws only of a particular shape. For example, my `both` function grows quickly in the size...