prompt-0.1.1.2: Monad (and transformer) for deferred-effect pure prompt-response queries

Description

Provides the PromptT type, which allows you to program computations that can "ask" or "prompt" with values to get values in return. The computation doesn't care about the process of prompting, or how it works, and has nothing to do with the effectful monad where the prompting will eventually take place.

For example, sometimes you might want a computation to be able to query or database, or talk with stdio, but you don't want your type to involve arbitrary IO or be over IO, opening the door to a mess of IO. Prompt lets you write programs that can query "something", and then at a later point in time, run it, providing the method of fulfilling each prompt. Write your program independent of IO, or databases, or stdio, etc.; only later "fill in" what it means. You can even run the same Prompt with different ways to fulfill the prompts --- pure, effectful, etc.

For usage examples and a more detailed explanation, see the README.

Synopsis

# Prompt

type Prompt a b = PromptT a b Identity Source #

Prompt type, providing the ability to "prompt" or "query" by presenting/asking with an a and receiving a b response.

prompt :: a -> (Prompt a b) b


"Ask with an a, get a b."

Has a Monad, Applicative, Functor, etc. instance so it can be sequenced monadically or applicatively, so you can sequence and bind from prompt.

Note that we defer the process of specifying how prompt delivers its b. It can take place in IO, or in any other effectful setting...but Prompt doesn't care, and it never involves IO or any arbitrary IO itself.

Can be "constructed directly" using mkPrompt, but typically using prompt and the Applicative, Monad instances etc. is better.

Arguments

 :: Monad m => Prompt a b r -> (a -> m b) "Prompt response function", effectfully responding to a given a with a b. -> m r

Run a Prompt a b r with a given effectful a -> m b "prompt response" function, to get the resulting r in m. Note that the Prompt itself in general has nothing to do with m, and cannot execute arbitrary m other than that given in the prompt response function.

Effectively treats a Prompt a b as a forall m. ReaderT (a -> m b) m

Arguments

 :: Prompt a b r -> (a -> b) "Prompt response function", purely responding to a given a with a b. -> r

Run a Prompt a b r with a pure a -> b prompt response function. More or less reduces Prompt a b to a Reader (a -> b).

Run a Prompt String String in IO by sending the request to stdout and reading the response from stdin.

# PromptT

data PromptT a b t r Source #

Like Prompt, but can perform its "pure" computations in the context of a Traversable t, to absorb short-circuiting behvaior with Maybe or Either, logging with Writer, etc., but this is in general completely unrelated to the effectful monad where the prompting will eventually take place. Specify short-circuiting and logging logic, without worrying about IO or anything relating to the prompting effect.

prompt :: a -> (PromptT a b t) b


Implements several useful typeclasses for working with the underlying Traversable and integrating effects, like Alternative, MonadError, MonadWriter, etc.

Constructor is hidden, but a direct constructing function is exported as mkPrompT in the rare case it is needed or wanted.

Instances

 Applicative t => MonadPrompt a b (PromptT a b t) Source # Methodsprompt :: a -> PromptT a b t b Source #prompts :: (b -> c) -> a -> PromptT a b t c Source # (MonadError e t, Traversable t) => MonadError e (PromptT a b t) Source # MethodsthrowError :: e -> PromptT a b t a #catchError :: PromptT a b t a -> (e -> PromptT a b t a) -> PromptT a b t a # (MonadReader r t, Traversable t) => MonadReader r (PromptT a b t) Source # Methodsask :: PromptT a b t r #local :: (r -> r) -> PromptT a b t a -> PromptT a b t a #reader :: (r -> a) -> PromptT a b t a # (MonadState s t, Traversable t) => MonadState s (PromptT a b t) Source # Methodsget :: PromptT a b t s #put :: s -> PromptT a b t () #state :: (s -> (a, s)) -> PromptT a b t a # (MonadWriter w t, Traversable t) => MonadWriter w (PromptT a b t) Source # Methodswriter :: (a, w) -> PromptT a b t a #tell :: w -> PromptT a b t () #listen :: PromptT a b t a -> PromptT a b t (a, w) #pass :: PromptT a b t (a, w -> w) -> PromptT a b t a # MonadTrans (PromptT a b) Source # Methodslift :: Monad m => m a -> PromptT a b m a # (Monad t, Traversable t) => Monad (PromptT a b t) Source # Methods(>>=) :: PromptT a b t a -> (a -> PromptT a b t b) -> PromptT a b t b #(>>) :: PromptT a b t a -> PromptT a b t b -> PromptT a b t b #return :: a -> PromptT a b t a #fail :: String -> PromptT a b t a # Functor t => Functor (PromptT a b t) Source # Methodsfmap :: (a -> b) -> PromptT a b t a -> PromptT a b t b #(<$) :: a -> PromptT a b t b -> PromptT a b t a # Applicative t => Applicative (PromptT a b t) Source # Methodspure :: a -> PromptT a b t a #(<*>) :: PromptT a b t (a -> b) -> PromptT a b t a -> PromptT a b t b #(*>) :: PromptT a b t a -> PromptT a b t b -> PromptT a b t b #(<*) :: PromptT a b t a -> PromptT a b t b -> PromptT a b t a # (Alternative t, Traversable t) => Alternative (PromptT a b t) Source # Methodsempty :: PromptT a b t a #(<|>) :: PromptT a b t a -> PromptT a b t a -> PromptT a b t a #some :: PromptT a b t a -> PromptT a b t [a] #many :: PromptT a b t a -> PromptT a b t [a] # (MonadPlus t, Traversable t) => MonadPlus (PromptT a b t) Source # Methodsmzero :: PromptT a b t a #mplus :: PromptT a b t a -> PromptT a b t a -> PromptT a b t a # Arguments  :: Monad m => PromptT a b t r -> (a -> m (t b)) "Prompt response function", effectfully responding to a given a with a b. -> m (t r) Run a PromptT a b t r with a given effectful a -> m (t b) "prompt response" function, to get the resulting r in m and t. The "prompt response" function is able to interact with the underlying Traversable t. Note that the PromptT in general has nothing to do with the m, and cannot execute arbitrary m other than that given in the prompt response function. Arguments  :: PromptT a b t r -> (a -> t b) "Prompt response function", "purely" responding to a given a with a b in context of Traversable t. -> t r Run a PromptT a b t r with a given a -> t b function, with Traversable t. The effects take place in the same context as the underlying context of the PromptT. interactPT :: Applicative t => PromptT String String t r -> IO (t r) Source # Run a PromptT String String in IO by sending the request to stdout and reading the response from stdin. # Prompting class Applicative m => MonadPrompt a b m | m -> a b where Source # An Applicative (and possibly Monad) where you can, at any time, "prompt" with an a and receive a b in response. Instances include PromptT and any transformers monad transformer over another MonadPrompt. Minimal complete definition Methods prompt :: a -> m b Source # Prompt with an a for a b in the context of the type. prompts :: (b -> c) -> a -> m c Source # Prompt with an a for a b in the context of the type, and apply the given function to receive a c. Instances  (Monad m, MonadPrompt a b m) => MonadPrompt a b (MaybeT m) Source # Methodsprompt :: a -> MaybeT m b Source #prompts :: (b -> c) -> a -> MaybeT m c Source # (Monad m, MonadPrompt a b m, Monoid w) => MonadPrompt a b (WriterT w m) Source # Methodsprompt :: a -> WriterT w m b Source #prompts :: (b -> c) -> a -> WriterT w m c Source # (Monad m, MonadPrompt a b m, Monoid w) => MonadPrompt a b (WriterT w m) Source # Methodsprompt :: a -> WriterT w m b Source #prompts :: (b -> c) -> a -> WriterT w m c Source # (Monad m, MonadPrompt a b m) => MonadPrompt a b (StateT s m) Source # Methodsprompt :: a -> StateT s m b Source #prompts :: (b -> c) -> a -> StateT s m c Source # (Monad m, MonadPrompt a b m) => MonadPrompt a b (StateT s m) Source # Methodsprompt :: a -> StateT s m b Source #prompts :: (b -> c) -> a -> StateT s m c Source # (Monad m, MonadPrompt a b m) => MonadPrompt a b (ErrorT e m) Source # Methodsprompt :: a -> ErrorT e m b Source #prompts :: (b -> c) -> a -> ErrorT e m c Source # (Monad m, MonadPrompt a b m) => MonadPrompt a b (ExceptT e m) Source # Methodsprompt :: a -> ExceptT e m b Source #prompts :: (b -> c) -> a -> ExceptT e m c Source # (Monad m, MonadPrompt a b m) => MonadPrompt a b (ReaderT * r m) Source # Methodsprompt :: a -> ReaderT * r m b Source #prompts :: (b -> c) -> a -> ReaderT * r m c Source # Applicative t => MonadPrompt a b (PromptT a b t) Source # Methodsprompt :: a -> PromptT a b t b Source #prompts :: (b -> c) -> a -> PromptT a b t c Source # (Monad m, MonadPrompt a b m, Monoid w) => MonadPrompt a b (RWST r w s m) Source # Methodsprompt :: a -> RWST r w s m b Source #prompts :: (b -> c) -> a -> RWST r w s m c Source # (Monad m, MonadPrompt a b m, Monoid w) => MonadPrompt a b (RWST r w s m) Source # Methodsprompt :: a -> RWST r w s m b Source #prompts :: (b -> c) -> a -> RWST r w s m c Source # prompt' :: MonadPrompt a b m => a -> m b Source # A version of prompt strict on its prompting value. prompts' :: MonadPrompt a b m => (b -> c) -> a -> m c Source # A version of prompts strict on its prompting value. ## Specialized Arguments  :: a prompting value -> PromptT a b t b Like prompt, but specialized to PromptT and without the Applicative constraint. Arguments  :: Functor t => (b -> c) to be applied to response value -> a prompting value -> PromptT a b t c Like prompts, but specialized to PromptT and downgrading the Applicative constraint to a Functor constraint. Arguments  :: a prompting value (strict) -> PromptT a b t b Like prompt', but specialized to PromptT and without the Applicative constraint. Is a promptP strict on its argument. Arguments  :: Functor t => (b -> c) to be applied to response value -> a prompting value (strict) -> PromptT a b t c Like prompts', but specialized to PromptT and downgrading the Applicative constraint to a Functor constraint. Is a promptsP strict on its argument. # Low level mapPromptT :: (t r -> t s) -> PromptT a b t r -> PromptT a b t s Source # Maps the underying t a returned by PromptT. Cannot change t. Arguments  :: (forall s. t s -> u s) forward natural transformation -> (forall s. u s -> t s) backwards natural transformation -> PromptT a b t r -> PromptT a b u r Swap out the Traversable t with a pair of natural transformations. The first maps the output t a, and the second maps the result of the prompting function. liftP :: t r -> PromptT a b t r Source # Like lift, but without the Monad constraint. mkPromptT :: (forall m. Monad m => (a -> m (t b)) -> m (t r)) -> PromptT a b t r Source # Directly construct a PromptT. Has to be able to take a (a - m (t b)) -> m (t r) that can work on any Monad. Typically this won't be used, but is provided for completion; using prompt and its Applicative, Monad instances, etc., is more clear. prompt r = mkPromptT$ g -> g r


mkPrompt :: (forall m. Monad m => (a -> m b) -> m r) -> Prompt a b r Source #

Directly construct a Prompt. Has to be able to take a (a -> m b) -> m r that can work on any Monad.

Typically this won't be used, but is provided for completion; using prompt and its Applicative, Monad instances, etc., is more clear.