Copyright (c) Edward Kmett & Sjoerd Visscher 2011 BSD3 ekmett@gmail.com experimental None Haskell98

Description

This is a generalized Store Comonad, parameterized by a Representable Functor. The representation of that Functor serves as the index of the store.

This can be useful if the representable functor serves to memoize its contents and will be inspected often.

Synopsis

# Documentation

type Store g = StoreT g Identity #

A memoized store comonad parameterized by a representable functor g, where the representatation of g, Rep g is the index of the store.

Arguments

 :: Representable g => (Rep g -> a) computation -> Rep g index -> Store g a

Construct a store comonad computation from a function and a current index. (The inverse of runStore.)

Arguments

 :: Representable g => Store g a a store to access -> (Rep g -> a, Rep g) initial state

Unwrap a state monad computation as a function. (The inverse of state.)

data StoreT g w a #

A store transformer comonad parameterized by:

• g - A representable functor used to memoize results for an index Rep g
• w - The inner comonad.

Constructors

 StoreT (w (g a)) (Rep g)

Instances

storeT :: (Functor w, Representable g) => w (Rep g -> a) -> Rep g -> StoreT g w a #

runStoreT :: (Functor w, Representable g) => StoreT g w a -> (w (Rep g -> a), Rep g) #

class Comonad w => ComonadStore s w | w -> s where #

Minimal complete definition

Methods

pos :: w a -> s #

peek :: s -> w a -> a #

peeks :: (s -> s) -> w a -> a #

seek :: s -> w a -> w a #

seeks :: (s -> s) -> w a -> w a #

experiment :: Functor f => (s -> f s) -> w a -> f a #

Instances