# Netwire

### From HaskellWiki

(Sections restructured.) |
m (→Predefined wires) |
||

(38 intermediate revisions by 4 users not shown) | |||

Line 1: | Line 1: | ||

− | Netwire is a library for [[Functional Reactive Programming|functional reactive programming]], which uses the concept of [[Arrow|arrows]] for modelling an embedded domain-specific language. This language lets you express reactive systems, which means systems that change over time. It shares the basic concept with [[Yampa]] and its fork Animas, but it is itself not a fork. | + | Netwire is a library for [[Functional Reactive Programming|functional reactive programming]], which uses the concept of [[Arrow|arrows]] for modelling an embedded domain-specific language. This language lets you express reactive systems, which means systems that change over time. It shares the basic concept with [[Yampa]] and its fork Animas, but it is itself not a fork and has many additional features. |

− | + | * [http://hackage.haskell.org/package/netwire Download netwire] | |

+ | |||

+ | This wiki page corresponds to Netwire version 3 and is currently a work in progress. | ||

== Features == | == Features == | ||

− | Here is a list of some of the features of | + | Here is a list of some of the features of Netwire: |

− | * | + | * arrow interface (or optionally an applicative interface), |

− | + | * signal inhibition (ArrowZero / Alternative), | |

− | * signal inhibition ( | + | * signal selection (ArrowPlus / Alternative), |

− | * | + | * self-adjusting wires (ArrowChoice), |

− | * self-adjusting wires ( | + | |

* rich set of event wires, | * rich set of event wires, | ||

* signal analysis wires (average, peak, etc.), | * signal analysis wires (average, peak, etc.), | ||

− | * | + | * effectful wires. |

− | |||

− | + | == Basics == | |

− | + | The Netwire library is based around a data type called <hask>Wire</hask>. You need to import the <hask>Control.Wire</hask> module to work with wires: | |

− | + | <haskell> | |

+ | import Control.Wire | ||

+ | |||

+ | data Wire e (>~) a b | ||

+ | </haskell> | ||

− | + | For some arrows <hask>(>~)</hask> and all monoids <hask>e</hask> the type <hask>Wire e (>~)</hask> is an arrow. Only certain arrows are allowed for <hask>(>~)</hask>, because <hask>Wire</hask> is actually a data family. These arrows are called base arrows in Netwire. | |

<haskell> | <haskell> | ||

− | + | comp :: Wire e (>~) a b | |

</haskell> | </haskell> | ||

+ | Values of type <hask>Wire e (>~) a b</hask> are time-varying functions, which resemble the following type: | ||

− | + | <haskell> | |

+ | a >~ Either e b | ||

+ | </haskell> | ||

− | + | So it's a function that takes a value of type <hask>a</hask> and either produces a value of type <hask>b</hask> or produces no value, but instead ''inhibits'' with a value of type <hask>e</hask>. The act of running a wire is called ''stepping'' and the process is called an ''instant''. You can step a wire through one of the stepping functions, which we will cover later. When you step a wire, it will return a new version of itself along with its result. You are supposed to call the new version the next time you step. | |

− | The | + | === The inhibition monoid === |

− | + | The <hask>e</hask> argument to <hask>Wire</hask> is called the inhibition monoid. For simple applications you can just use <hask>()</hask> here, but you may want to actually assign exception values to inhibition. We will cover that later. For now just use <hask>()</hask>. | |

− | + | === Base arrows === | |

− | + | ||

− | + | ||

− | The | + | The <hask>(>~)</hask> argument to <hask>Wire</hask> is called the base arrow. In most cases you will use a <hask>Kleisli</hask> arrow here, and this is currently the only type of arrow supported, though more will be added in the future. For simple applications you can just use the <hask>IO</hask> monad, and it is useful to define a type alias for your custom wire type: |

− | + | <haskell> | |

+ | type MyWire = Wire () (Kleisli IO) | ||

+ | </haskell> | ||

− | |||

+ | == Running wires == | ||

− | + | For running a wire you can use the stepping functions available in the <hask>Control.Wire.Session</hask> module. There is no need to import that module. It is automatically imported with <hask>Control.Wire</hask>. For Kleisli-based wires you will want to use the <hask>stepWireM</hask> function: | |

− | + | ||

− | + | ||

<haskell> | <haskell> | ||

− | + | stepWireM :: | |

− | + | Monad m | |

+ | => Wire e (Kleisli m) a b | ||

+ | -> a | ||

+ | -> m (Either e b, Wire e (Kleisli m) a b) | ||

</haskell> | </haskell> | ||

− | + | In our case we have <hask>m = IO</hask>, so our type signature is simply: | |

<haskell> | <haskell> | ||

− | + | stepWireM :: MyWire a b -> a -> IO (Either () b, MyWire a b) | |

− | + | ||

</haskell> | </haskell> | ||

− | + | This function takes a wire and an input value. It passes the input value to the wire and returns its result value of type <hask>Either () b</hask>. Along with the result it also returns a new wire. Normally you would call <hask>stepWireM</hask> in a loop, which performs instant after instant. This is the basic structure: | |

− | + | ||

− | + | ||

<haskell> | <haskell> | ||

− | + | system :: MyWire Int String | |

− | + | system = {- ... -} | |

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

main :: IO () | main :: IO () | ||

− | main = | + | main = loop system |

where | where | ||

− | loop :: | + | loop :: MyWire Int String -> IO () |

− | loop | + | loop w' = do |

− | + | (mx, w) <- stepWireM w' 15 | |

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | {- ... do something with mx ... -} | |

− | + | loop w -- loop with the new wire. | |

+ | </haskell> | ||

− | + | Note: Even though the FRP idea suggests it, there is no reason to run wires continuously or even regularly. You can totally have an instant depending on user input, a GUI event or network traffic, so instants can be minutes apart. | |

− | + | === Testing wires === | |

− | + | There is a convenient function for testing wires, which does all the plumbing for you. It's called <hask>testWireM</hask>: | |

− | + | <haskell> | |

+ | testWireM :: | ||

+ | (Show e, MonadIO m) | ||

+ | => Int | ||

+ | -> m a | ||

+ | -> Wire e (Kleisli m) a String | ||

+ | -> m () | ||

+ | </haskell> | ||

− | + | For wires returning a string, you can easily test them using this function. The first argument is a FPS/accuracy tradeoff. If it's 100, it will only print the output of every 100th instant. The second argument is an input generator action. At each instant, this action is run and its result is passed as input to the wire. The wire's output is then printed. <hask>testWireM</hask> prints the output continuously on a single line: | |

+ | |||

+ | <haskell> | ||

+ | main :: IO () | ||

+ | main = testWireM 1000 (return 15) system | ||

+ | </haskell> | ||

− | |||

− | + | == Writing wires == | |

− | === | + | === Predefined wires === |

− | + | There are numerous predefined wires, which you can compose using the arrow interface. We will practice that with three very simple predefined wires (the type signatures are simplified for the sake of learning): | |

<haskell> | <haskell> | ||

− | + | constant :: b -> Wire e (>~) a b | |

+ | identity :: Wire e (>~) b b | ||

+ | countFrom :: Enum b => b -> Wire e (>~) a b | ||

</haskell> | </haskell> | ||

− | + | The ''constant'' function takes an output value and produces a wire which produces that value constantly. So the wire <hask>constant 15</hask> will output 15 constantly at every instant. In other words, <hask>stepWireM</hask> will return <hask>Right 15</hask> along with a new wire that outputs 15 again: | |

<haskell> | <haskell> | ||

− | constant | + | stepWireM (constant 15) inp |

+ | -> (Right 15, constant 15) | ||

</haskell> | </haskell> | ||

− | + | Note the fully polymorphic input type <hask>a</hask>. This basically means that the wire disregards its input, so whatever <hask>inp</hask> is, it is ignored. | |

− | + | The ''identity'' wire is slightly more interesting. It has input and output of type <hask>b</hask>. What it does is: It simply outputs its input value at every instant: | |

− | + | ||

− | + | ||

− | + | ||

− | + | ||

<haskell> | <haskell> | ||

− | + | stepWireM identity inp | |

+ | -> (Right inp, identity) | ||

</haskell> | </haskell> | ||

− | + | Both identity and constant wires are examples of ''stateless'' wires. They don't change over time. You can see this in the stepping examples above. They always return themselves for the next instant. | |

+ | |||

+ | The ''countFrom'' function takes a starting value and returns a wire that returns sequential values instant by instant. This is the first example of a ''stateful'' wire, because it changes over time: | ||

<haskell> | <haskell> | ||

− | + | stepWireM (countFrom 15) inp | |

+ | -> (Right 15, countFrom 16) | ||

+ | |||

+ | stepWireM (countFrom 16) inp | ||

+ | -> (Right 16, countFrom 17) | ||

</haskell> | </haskell> | ||

− | + | === Composing wires === | |

− | + | The main feature of wires is that you can compose them using the arrow interface. There is a rich set of ways for composing, and you will want to use arrow notation for your convenience: | |

− | + | ||

− | + | ||

<haskell> | <haskell> | ||

− | + | system :: MyWire a String | |

+ | system = | ||

+ | proc _ -> do | ||

+ | c1 <- countFrom 10 -< () | ||

+ | c2 <- countFrom 20 -< () | ||

+ | identity -< printf "%d %d" (c1 :: Int) (c2 :: Int) | ||

</haskell> | </haskell> | ||

− | + | In applications it is common to write wires that ignore their input. For those wires you should make the input type fully polymorphic to indicate this. Running this wire produces: | |

<haskell> | <haskell> | ||

− | + | stepWireM system () | |

− | + | ||

+ | 1st instant: Right "10 20" | ||

+ | 2nd instant: Right "11 21" | ||

+ | 3rd instant: Right "12 22" | ||

</haskell> | </haskell> | ||

− | + | Note: You can use the ''testWireM'' function with this wire. The following action will run the wire continuously printing its result at every 1000th instant: | |

<haskell> | <haskell> | ||

− | + | main :: IO () | |

− | + | main = testWireM 1000 (return ()) system | |

− | + | ||

− | + | ||

− | + | ||

</haskell> | </haskell> | ||

− | + | In the FRP context we often talk about ''signals''. Particularly in the context of ''arrowized'' FRP (AFRP) like Netwire we talk about ''signal networks'' and signals passing through them. The ''system'' wire is your first signal network. It ignores its input signal and passes the signal <hask>()</hask> to the two counters (which ignore their input signals, too). It takes the output signals <hask>c1</hask> and <hask>c2</hask> and makes a formatted string out of them. Finally this string is passed to the <hask>identity</hask> wire. This is the last wire in the signal network ''system'', so its output signal is the output signal of ''system''. As a side note the ''identity'' wire behaves like ''returnA''. | |

− | The | + | The main feature to note here is that all of the subwires in the composition evolve individually. So in the second instant, each of the two counters will have gone up by one. This alone gives you a powerful abstraction for stateful computations. The equivalent when using a state monad or mutable variables would be to have a global state value with two counter values. By having time-varying functions you can have something called ''local state''. Each of the two counters (or as many as you use) have their own individual local state, which is the current counter value. This is way more convenient and composable than a state monad or other imperative state abstractions. |

− | + | === Choice === | |

− | + | ||

− | + | ||

− | + | ||

− | + | ||

− | + | In traditional AFRP solutions like Yampa the path of a signal is fully determined by the structure of the signal network. In Netwire a signal can choose one of multiple paths by using the <hask>case</hask> and <hask>if</hask> constructs: | |

<haskell> | <haskell> | ||

− | + | system = | |

− | + | ||

proc _ -> do | proc _ -> do | ||

− | + | c1 <- countFrom 10 -< () | |

− | + | if even c1 | |

+ | then returnA -< "We don't want even c1" | ||

+ | else do | ||

+ | c2 <- countFrom 20 -< () | ||

+ | returnA -< printf "%d %d" (c1 :: Int) (c2 :: Int) | ||

</haskell> | </haskell> | ||

− | + | If the <hask>c1</hask> signal is even, then the wire outputs the string "We don't want even c1". Otherwise it takes the second path. Here it is important to know that the second counter will be suspended, when <hask>c1</hask> is even, because the <hask>else</hask> branch is not reached. A wire can only evolve, when it is actually reached. So in this example <hask>c2</hask> will run at half the speed of <hask>c1</hask> and the output will look like: | |

<haskell> | <haskell> | ||

− | + | 1st instant: "We don't want even c1" | |

− | + | 2nd instant: "11 20" | |

+ | 3rd instant: "We don't want even c1" | ||

+ | 4th instant: "13 21" | ||

+ | 5th instant: "We don't want even c1" | ||

+ | 6th instant: "15 22" | ||

+ | 7th instant: "We don't want even c1" | ||

</haskell> | </haskell> | ||

− | + | [[Category:FRP]] | |

− | + | ||

− | + |

## Revision as of 18:17, 1 December 2011

Netwire is a library for functional reactive programming, which uses the concept of arrows for modelling an embedded domain-specific language. This language lets you express reactive systems, which means systems that change over time. It shares the basic concept with Yampa and its fork Animas, but it is itself not a fork and has many additional features.

This wiki page corresponds to Netwire version 3 and is currently a work in progress.

## Contents |

## 1 Features

Here is a list of some of the features of Netwire:

- arrow interface (or optionally an applicative interface),
- signal inhibition (ArrowZero / Alternative),
- signal selection (ArrowPlus / Alternative),
- self-adjusting wires (ArrowChoice),
- rich set of event wires,
- signal analysis wires (average, peak, etc.),
- effectful wires.

## 2 Basics

The Netwire library is based around a data type calledimport Control.Wire data Wire e (>~) a b

comp :: Wire e (>~) a b

a >~ Either e b

*inhibits*with a value of type

*stepping*and the process is called an

*instant*. You can step a wire through one of the stepping functions, which we will cover later. When you step a wire, it will return a new version of itself along with its result. You are supposed to call the new version the next time you step.

### 2.1 The inhibition monoid

The### 2.2 Base arrows

Thetype MyWire = Wire () (Kleisli IO)

## 3 Running wires

For running a wire you can use the stepping functions available in thestepWireM :: Monad m => Wire e (Kleisli m) a b -> a -> m (Either e b, Wire e (Kleisli m) a b)

stepWireM :: MyWire a b -> a -> IO (Either () b, MyWire a b)

system :: MyWire Int String system = {- ... -} main :: IO () main = loop system where loop :: MyWire Int String -> IO () loop w' = do (mx, w) <- stepWireM w' 15 {- ... do something with mx ... -} loop w -- loop with the new wire.

Note: Even though the FRP idea suggests it, there is no reason to run wires continuously or even regularly. You can totally have an instant depending on user input, a GUI event or network traffic, so instants can be minutes apart.

### 3.1 Testing wires

There is a convenient function for testing wires, which does all the plumbing for you. It's calledtestWireM :: (Show e, MonadIO m) => Int -> m a -> Wire e (Kleisli m) a String -> m ()

main :: IO () main = testWireM 1000 (return 15) system

## 4 Writing wires

### 4.1 Predefined wires

There are numerous predefined wires, which you can compose using the arrow interface. We will practice that with three very simple predefined wires (the type signatures are simplified for the sake of learning):

constant :: b -> Wire e (>~) a b identity :: Wire e (>~) b b countFrom :: Enum b => b -> Wire e (>~) a b

*constant*function takes an output value and produces a wire which produces that value constantly. So the wire

stepWireM (constant 15) inp -> (Right 15, constant 15)

*identity*wire is slightly more interesting. It has input and output of type

stepWireM identity inp -> (Right inp, identity)

Both identity and constant wires are examples of *stateless* wires. They don't change over time. You can see this in the stepping examples above. They always return themselves for the next instant.

The *countFrom* function takes a starting value and returns a wire that returns sequential values instant by instant. This is the first example of a *stateful* wire, because it changes over time:

stepWireM (countFrom 15) inp -> (Right 15, countFrom 16) stepWireM (countFrom 16) inp -> (Right 16, countFrom 17)

### 4.2 Composing wires

The main feature of wires is that you can compose them using the arrow interface. There is a rich set of ways for composing, and you will want to use arrow notation for your convenience:

system :: MyWire a String system = proc _ -> do c1 <- countFrom 10 -< () c2 <- countFrom 20 -< () identity -< printf "%d %d" (c1 :: Int) (c2 :: Int)

In applications it is common to write wires that ignore their input. For those wires you should make the input type fully polymorphic to indicate this. Running this wire produces:

stepWireM system () 1st instant: Right "10 20" 2nd instant: Right "11 21" 3rd instant: Right "12 22"

Note: You can use the *testWireM* function with this wire. The following action will run the wire continuously printing its result at every 1000th instant:

main :: IO () main = testWireM 1000 (return ()) system

*signals*. Particularly in the context of

*arrowized*FRP (AFRP) like Netwire we talk about

*signal networks*and signals passing through them. The

*system*wire is your first signal network. It ignores its input signal and passes the signal

*system*, so its output signal is the output signal of

*system*. As a side note the

*identity*wire behaves like

*returnA*.

The main feature to note here is that all of the subwires in the composition evolve individually. So in the second instant, each of the two counters will have gone up by one. This alone gives you a powerful abstraction for stateful computations. The equivalent when using a state monad or mutable variables would be to have a global state value with two counter values. By having time-varying functions you can have something called *local state*. Each of the two counters (or as many as you use) have their own individual local state, which is the current counter value. This is way more convenient and composable than a state monad or other imperative state abstractions.

### 4.3 Choice

In traditional AFRP solutions like Yampa the path of a signal is fully determined by the structure of the signal network. In Netwire a signal can choose one of multiple paths by using thesystem = proc _ -> do c1 <- countFrom 10 -< () if even c1 then returnA -< "We don't want even c1" else do c2 <- countFrom 20 -< () returnA -< printf "%d %d" (c1 :: Int) (c2 :: Int)

1st instant: "We don't want even c1" 2nd instant: "11 20" 3rd instant: "We don't want even c1" 4th instant: "13 21" 5th instant: "We don't want even c1" 6th instant: "15 22" 7th instant: "We don't want even c1"