Copyright	(c) Hanzhong Xu 2016,
License	MIT License
Maintainer	hanzh.xu@gmail.com
Stability	experimental
Portability	portable
Safe Haskell	Safe
Language	Haskell2010

Control.AFSM

Contents

The SM type
The SMState type
Constructors
High order functions
Evaluation

Description

Arrowized functional state machines.

This module is inspired by Yampa and the paper Functional Reactive Programming, Continued* written by Henrik Nilsson, Antony Courtney and John Peterson.

Synopsis

Documentation

module Control.Arrow

The `SM` type

data SM a b Source

SM is a type representing a state machine.

Instances

Arrow SM Source
ArrowChoice SM Source
ArrowLoop SM Source
Category * SM Source

The `SMState` type

type SMState r a b = r -> a -> (SM a b, b) Source

Constructors

newSM :: r -> SMState r a b -> SM a b Source

simpleSM :: r -> (r -> a -> (r, b)) -> SM a b Source

High order functions

execSM :: SM a b -> SM [a] [b] Source

Evaluation

exec :: SM a b -> [a] -> (SM a b, [b]) Source