Ollie Charles
Ollie Charles
Sometimes you end up writing a test and it seems to be have been running for ages. You expect it to finish in a few seconds, but minutes later you're...
I was just playing around with interleaving some database calls in a `PropertyT` computation, and confused myself. I've now come to realise that `PropertyT` is like a non-deterministic monad (e.g.,...
I am doing a bit more playing with the state machine testing, in the context of testing work's REST API. For the purposes of this test, we have two end-points:...
We have the following: ```haskell databaseTests :: TestDatabase -> PropertyT IO () databaseTests testDatabase = do -- Setup factory
Is it possible to have a subterm generator that gives a list of subterms of arbitrary length? A use case might be: ```haskell data Expr = ... | List [Expr]...
The documentation for `parallel` states > Given the initial model state and set of commands, generates prefix actions to be run sequentially, followed by two branches to be run in...
The ability to unpack a record through a `let`-binding is tremendously powerful for building a lightweight module system. I could envision doing something like: ```dhall let { map, filter, span...
The [type inference rules for list literals](https://github.com/dhall-lang/dhall-lang/blob/master/standard/type-inference.md#list) states > Note that the above rules forbid List elements that are Types. More generally, if the element type is not a Type...
I find it quite confusing that the following is a parse error: ```dhall {=} with a = True : A ``` This happens because `with` and `:` are both top...
My understanding is normalisation is only defined in the context of well-typed expressions, but `Sort` doesn't have a type, so it's meaningless to ask for its normal form. Due to...