quickcheck-state-machine-0.2.0: Test monadic programs using state machine based models

Copyright(C) 2017 ATS Advanced Telematic Systems GmbH
LicenseBSD-style (see the file LICENSE)
MaintainerStevan Andjelkovic <stevan@advancedtelematic.com>
Stabilityprovisional
Portabilitynon-portable (GHC extensions)
Safe HaskellNone
LanguageHaskell2010

Test.StateMachine.Types

Contents

Description

This module contains the main types exposed to the user. The module is perhaps best read indirectly, on a per need basis, via the main module Test.StateMachine.

Synopsis

Untyped actions

data Untyped act where Source #

An untyped action is an action where the response type is hidden away using an existential type.

We need to hide the response type when generating actions, because in general the actions we want to generate will have different response types; and thus we can only type the generating function if we hide the response type.

Constructors

Untyped :: (Show resp, Typeable resp) => act Symbolic resp -> Untyped act 

Type aliases

type StateMachine model act m = StateMachine' model act Void m Source #

A (non-failing) state machine record bundles up all functionality needed to perform our tests.

stateMachine :: Functor m => Generator model act -> Shrinker act -> Precondition model act -> Transition model act -> Postcondition model act -> InitialModel model -> (forall resp. act Concrete resp -> m resp) -> Runner m -> StateMachine' model act Void m Source #

Helper for lifting non-failing semantics to a possibly failing state machine record.

data StateMachine' model act err m Source #

Same as above, but with possibly failing semantics.

Constructors

StateMachine 

Fields

type Generator model act = model Symbolic -> Gen (Untyped act) Source #

When generating actions we have access to a model containing symbolic references.

type Shrinker act = forall v resp. act v resp -> [act v resp] Source #

Shrinking should preserve the response type of the action.

type Precondition model act = forall resp. model Symbolic -> act Symbolic resp -> Bool Source #

Pre-conditions are checked while generating, at this stage we do not yet have access to concrete references.

type Transition model act = forall resp v. Ord1 v => model v -> act v resp -> v resp -> model v Source #

The transition function must be polymorphic in the type of variables used, as it is used both while generating and executing.

type Postcondition model act = forall resp. model Concrete -> act Concrete resp -> resp -> Property Source #

Post-conditions are checked after the actions have been executed and we got a response.

type InitialModel m = forall v. m v Source #

The initial model is polymorphic in the type of references it uses, so that it can be used both in the pre- and the post-condition check.

data Result resp err Source #

The result of executing an action.

Constructors

Ok resp 
Fail err 

type Semantics act err m = forall resp. act Concrete resp -> m (Result resp err) Source #

When we execute our actions we have access to concrete references.

type Runner m = m Property -> IO Property Source #

How to run the monad used by the semantics.

Data type generic operations

Higher-order functors, foldables and traversables

References