[I work with Gordon on this] The problem domain is test frameworks, more specifically proposition-based testing. We are most of the way through unifying QuickCheck and SmallCheck (as well as untangling the various 'stages'), and are now generalizing. The generator is obvious. The 'reducer' would be a combination of "running" a test and producing a summary of the tests run. Right now, we are exploring having the generator return a (potentially infinite) 'stream' of test cases, which frequently come with various gradings (as in 'graded algebra') which induce what we referred to as 'chunks'. Whether metamorphisms or hylomorphisms are best for our situation, that remains to be explored. But these are certainly excellent leads, thank you. Jacques Edward Kmett wrote: There is also a (naive) metamorphism combinator in my category-extras library: |
_______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe