import type * as P from "@principia/prelude";
import type { IO, URI, V } from "./model";
/**
 * ```haskell
 * chain_ :: Monad m => (m a, (a -> m b)) -> m b
 * ```
 *
 * Composes computations in sequence, using the return value of one computation as input for the next
 *
 * @category Monad
 * @since 1.0.0
 */
export declare const chain_: <A, B>(ma: IO<A>, f: (a: A) => IO<B>) => IO<B>;
/**
 * ```haskell
 * chain :: Monad m => (a -> m b) -> m a -> m b
 * ```
 *
 * Composes computations in sequence, using the return value of one computation as input for the next
 *
 * @category Monad
 * @since 1.0.0
 */
export declare const chain: <A, B>(f: (a: A) => IO<B>) => (ma: IO<A>) => IO<B>;
/**
 * ```haskell
 * bind :: Monad m => m a -> (a -> m b) -> m b
 * ```
 *
 * A version of `chain` where the arguments are flipped
 * Composes computations in sequence, using the return value of one computation as input for the next
 *
 * @category Monad
 * @since 1.0.0
 */
export declare const bind: <A>(ma: IO<A>) => <B>(f: (a: A) => IO<B>) => IO<B>;
/**
 * ```haskell
 * tap_ :: Monad m => (ma, (a -> m b)) -> m a
 * ```
 *
 * Composes computations in sequence, using the return value of one computation as input for the next
 * and keeping only the result of the first
 *
 * @category Monad
 * @since 1.0.0
 */
export declare const tap_: <A, B>(ma: IO<A>, f: (a: A) => IO<B>) => IO<A>;
/**
 * ```haskell
 * tap :: Monad m => (a -> m b) -> ma -> m a
 * ```
 *
 * Composes computations in sequence, using the return value of one computation as input for the next
 * and keeping only the result of the first
 *
 * @category Monad
 * @since 1.0.0
 */
export declare const tap: <A, B>(f: (a: A) => IO<B>) => (ma: IO<A>) => IO<A>;
/**
 * ```haskell
 * flatten :: Monad m => m m a -> m a
 * ```
 *
 * Removes one level of nesting from a nested `IO`
 *
 * @category Monad
 * @since 1.0.0
 */
export declare const flatten: <A>(mma: IO<IO<A>>) => IO<A>;
export declare const Monad: P.Monad<[URI], V>;
//# sourceMappingURL=monad.d.ts.map