|
1 |
| -# Module Documentation |
| 1 | +# Deprecation Notice |
2 | 2 |
|
3 |
| -## Module Control.Monad.Free |
| 3 | +Please note that this library has been merged into [purescript-transformers](https://github.com/purescript-contrib/purescript-transformers). |
4 | 4 |
|
5 |
| -### Types |
6 |
| - |
7 |
| - data Free f a where |
8 |
| - Return :: a -> Free f a |
9 |
| - Suspend :: f (Free f a) -> Free f a |
10 |
| - Gosub :: forall s. (forall r. ({} -> Free f r) -> (r -> Free f a) -> s) -> s -> Free f a |
11 |
| - |
12 |
| - |
13 |
| -### Type Classes |
14 |
| - |
15 |
| - class MonadFree f m where |
16 |
| - wrap :: forall a. f (m a) -> m a |
17 |
| - |
18 |
| - |
19 |
| -### Type Class Instances |
20 |
| - |
21 |
| - instance applicativeFree :: (Functor f) => Applicative (Free f) |
22 |
| - |
23 |
| - instance applyFree :: (Functor f) => Apply (Free f) |
24 |
| - |
25 |
| - instance bindFree :: (Functor f) => Bind (Free f) |
26 |
| - |
27 |
| - instance functorFree :: (Functor f) => Functor (Free f) |
28 |
| - |
29 |
| - instance monadFree :: (Functor f) => Monad (Free f) |
30 |
| - |
31 |
| - instance monadTransFree :: MonadTrans Free |
32 |
| - |
33 |
| - instance monadFreeFree :: (Functor f) => MonadFree f (Free f) |
34 |
| - |
35 |
| - |
36 |
| -### Values |
37 |
| - |
38 |
| - bindFree :: forall f a b. (a -> Free f b) -> Free f a -> Free f b |
39 |
| - |
40 |
| - go :: forall f a. (Functor f) => (f (Free f a) -> Free f a) -> Free f a -> a |
41 |
| - |
42 |
| - -- Note: can blow the stack! |
43 |
| - goM :: forall f m a. (Functor f, Monad m) => (f (Free f a) -> m (Free f a)) -> Free f a -> m a |
44 |
| - |
45 |
| - goEff :: forall e f a. (Functor f) => (f (Free f a) -> Eff e (Free f a)) -> Free f a -> Eff e a |
46 |
| - |
47 |
| - liftF :: forall f a. (Functor f) => f a -> Free f a |
48 |
| - |
49 |
| - pureF :: forall f a. (Applicative f) => a -> Free f a |
50 |
| - |
51 |
| - -- Note: can blow the stack! |
52 |
| - iterM :: forall f m a. (Functor f, Monad m) => (forall a. f (m a) -> m a) -> Free f a -> m a |
53 |
| - |
54 |
| - resume :: forall f a. (Functor f) => Free f a -> Either (f (Free f a)) a |
55 |
| - |
56 |
| - resumeGosub :: forall f a. (Functor f) => (forall s. (forall r. ({ } -> Free f r) -> (r -> Free f a) -> s) -> s) -> Either (f (Free f a)) (Free f a) |
57 |
| - |
58 |
| - |
59 |
| -## Module Control.Monad.Trampoline |
60 |
| - |
61 |
| -### Types |
62 |
| - |
63 |
| - data Delay a where |
64 |
| - Delay :: { } -> a -> Delay a |
65 |
| - |
66 |
| - type Trampoline a = Free Delay a |
67 |
| - |
68 |
| - |
69 |
| -### Type Class Instances |
70 |
| - |
71 |
| - instance delayApplicative :: Applicative Delay |
72 |
| - |
73 |
| - instance delayApply :: Apply Delay |
74 |
| - |
75 |
| - instance delayFunctor :: Functor Delay |
76 |
| - |
77 |
| - |
78 |
| -### Values |
79 |
| - |
80 |
| - delay :: forall a. ({ } -> a) -> Trampoline a |
81 |
| - |
82 |
| - done :: forall a. a -> Trampoline a |
83 |
| - |
84 |
| - runTrampoline :: forall a. Trampoline a -> a |
85 |
| - |
86 |
| - suspend :: forall a. Trampoline a -> Trampoline a |
| 5 | +Development will be continued there. |
0 commit comments