package monadlib

You can search for identifiers within the package.

in-package search v0.2.0

monadlib
- Applicative
  - Applicative
  - Base
  - Make
    
    A
  - Transform
    
    A
    
    Inner
- LazyList
- Monad
  - BaseCollectionM
  - BaseLazyPlus
  - BasePlus
  - CollectionOpt
    
    C
  - CollectionState
    
    C
    
    T
  - CollectionWriter
    
    C
    
    Mon
  - Continuation
    
    T
  - Error
    
    E
  - LazyListM
  - LazyM
  - LazyPlus
  - LazyT
    
    M
  - List
  - ListT
    
    M
  - Make
    
    M
  - MakeLazyPlus
    
    M
  - MakePlus
    
    M
  - MakeStream
    
    M
  - MakeStreamC
    
    M
  - Monad
  - MonadPlus
  - Monoid
  - Option
  - OptionT
    
    M
  - Reader
    
    T
  - State
    
    T
  - StateT
    
    M
    
    T
  - Stream
  - StreamC
  - Writer
    
    M
  - WriterT
    
    M
    
    Mon
- TagTree
  - Make
    
    Tag
  - Tree

Legend:
Library
Module
Module type
Parameter
Class
Class type

Tagged logic trees which are simplified when combined. When the contents are interpreted as a bag conditional values, should be a monad.

We provide a separate applicative interface which is less strict than the derived definition for the monad. When we evaluate lift2 f t1 t2, the function f will be applied across all possible arguments from t1 and t2, after which, results will be discarded by simplification.

These results do not need to be computed if the tree simplification does not depend on the individual computations, as is the case with the applicative interface.

author Phil Scott

type ('tag, 'a) node =

| Node of 'a * ('tag * ('tag, 'a) node) LazyList.t

module type Tree = sig ... end

module Make
  (Tag : sig ... end) : 
  Tree with type tag = Tag.t and type 'a m = (Tag.t, 'a LazyList.t) node