ramda.d.ts

// Type definitions for ramda
// Project: [https://github.com/donnut/typescript-ramda]
// Definitions by: Erwin Poeze <https://github.com/donnut>
// Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped

declare var R: R.Static;

declare namespace R {
    // simple types
    type Ord = number | string | boolean;
    type Prop = string | number;
    type Path = Prop[];
    type Struct<T> = Dictionary<T> | Array<T>;
    type AccOpts<T,U> = Array<any>|string|Dictionary<any>|Transformer<T, U, U>;
    interface Type<T> extends Function { new (...args: any[]): T; }

    // Fantasyland interfaces

    interface Setoid<T> {
        equals(b: Setoid<T>): boolean;
    }

    interface Semigroup<T> {
        concat(b: Semigroup<T>): Semigroup<T>;
    }

    interface Monoid<T> extends Semigroup<T> {
        /* static */ empty<T>(): Monoid<T>;
    }

    interface Functor<T> {
        map<U>(fn: (t: T) => U): Functor<U>;
    }

    interface Apply<T> extends Functor<T> {
        apply<U>(fn: Apply<(t: T) => U>): Apply<U>;
    }

    interface Applicative<T> extends Apply<T> {
        /* static */ of<U>(a: U): Applicative<U>;
    }

    interface Alt<T> extends Functor<T> {
        alt(b: T): Alt<T>;
    }

    interface Plus<T> extends Alt<T> {
        /* static */ zero<T>(): Plus<T>;
    }

    interface Alternative<T> extends Plus<T>, Applicative<T> {
    }

    interface Foldable<T> {
        reduce<U>(fn: (u: U, t: T) => U, u: U): U;
    }

    interface Traversable<T> extends Functor<T>, Foldable<T> {
        traverse<U, V>(fn: (t: T) => Applicative<U>, of: (v: V) => Applicative<V>): Applicative<Traversable<U>>;
    }

    interface Chain<T> extends Apply<T> {
        chain<U>(fn: (t: T) => Chain<U>): Chain<U>;
    }

    interface ChainRec<T> extends Chain<T> {
        /* static */ chainRec<A,B,C>(f: (next: (a: A) => C, done: (b: B) => C, value: A) => ChainRec<C>, i: A): ChainRec<B>;
    }

    interface Monad<T> extends Applicative<T>, Chain<T> {
    }

    interface Extend<T> {
        extend<U>(f: (v: Extend<T>) => U): Extend<U>;
    }

    interface Comonad<T> extends Functor<T>, Extend<T> {
        extract<U>(): U; // 'same U as in extend's f -- how to bind?
    }

    interface Bifunctor<T,U> extends Functor<T> /*, Functor<U>*/ {
        bimap<B,D>(f: (v: T) => B, g: (v: U) => D): Bifunctor<B,D>;
    }

    interface Profunctor<T,U> extends Functor<T> /*, Functor<U>*/ {
        promap<B,D>(f: (v: T) => B, g: (v: U) => D): Profunctor<B,D>;
    }

    // Ramda interfaces

    interface KeyValuePair<K, V> extends Array<K | V> { 0 : K; 1 : V; }

    interface Transformer<T, Acc, Res> {
        step: (acc: Acc, v: T) => Acc;
        init: () => Acc;
        result: (acc: Acc) => Res; // = R.identity
    }

    type Pred<T> = (v: T) => boolean;
    type ObjPred<T> = (value: T, key: string) => boolean;

    interface Dictionary<T> {
        [index: string]: T;
    }

    interface CharList extends String {
        push(x: string): void;
    }

    interface Nested<U> {
        [index: string]: Nested<U>|{<U>(value: any): U};
    }

    interface Lens<T,U> {
        /*get*/(obj: T): U;
        set(str: string, obj: T): U;
        // map(fn: (v: U) => U, obj: T): T
    }
    interface UnknownLens {
        /*get*/<T,U>(obj: T): U;
        set<T,U>(str: string, obj: T): U;
        // map<T,U>(fn: (v: U) => U, obj: T): T
    }

    // @see https://gist.github.com/donnut/fd56232da58d25ceecf1, comment by @albrow

    // interface CurriedFn1<T1, R> {
    //     (t1: T1): R;
    // }
    type CurriedFn1<T1, R> = (t1: T1) => R;

    interface CurriedFn2<T1, T2, R> {
        (t1: T1): (t2: T2) => R;
        (t1: T1, t2: T2): R;
    }
    interface CurriedFn3<T1, T2, T3, R> {
        (t1: T1): CurriedFn2<T2, T3, R>;
        (t1: T1, t2: T2): (t3: T3) => R;
        (t1: T1, t2: T2, t3: T3): R;
    }
    interface CurriedFn4<T1, T2, T3, T4, R> {
        (t1: T1): CurriedFn3<T2, T3, T4, R>;
        (t1: T1, t2: T2): CurriedFn2<T3, T4, R>;
        (t1: T1, t2: T2, t3: T3): (t4: T4) => R;
        (t1: T1, t2: T2, t3: T3, t4: T4): R;
    }
    interface CurriedFn5<T1, T2, T3, T4, T5, R> {
        (t1: T1): CurriedFn4<T2, T3, T4, T5, R>;
        (t1: T1, t2: T2): CurriedFn3<T3, T4, T5, R>;
        (t1: T1, t2: T2, t3: T3): CurriedFn2<T4, T5, R>;
        (t1: T1, t2: T2, t3: T3, t4: T4): (t5: T5) => R;
        (t1: T1, t2: T2, t3: T3, t4: T4, t5: T5): R;
    }
    interface CurriedFn6<T1, T2, T3, T4, T5, T6, R> {
        (t1: T1): CurriedFn5<T2, T3, T4, T5, T6, R>;
        (t1: T1, t2: T2): CurriedFn4<T3, T4, T5, T6, R>;
        (t1: T1, t2: T2, t3: T3): CurriedFn3<T4, T5, T6, R>;
        (t1: T1, t2: T2, t3: T3, t4: T4): CurriedFn2<T5, T6, R>;
        (t1: T1, t2: T2, t3: T3, t4: T4, t5: T5): (t6: T6) => R;
        (t1: T1, t2: T2, t3: T3, t4: T4, t5: T5, t6: T6): R;
    }
    interface CurriedFn7<T1, T2, T3, T4, T5, T6, T7, R> {
        (t1: T1): CurriedFn6<T2, T3, T4, T5, T6, T7, R>;
        (t1: T1, t2: T2): CurriedFn5<T3, T4, T5, T6, T7, R>;
        (t1: T1, t2: T2, t3: T3): CurriedFn4<T4, T5, T6, T7, R>;
        (t1: T1, t2: T2, t3: T3, t4: T4): CurriedFn3<T5, T6, T7, R>;
        (t1: T1, t2: T2, t3: T3, t4: T4, t5: T5): CurriedFn2<T6, T7, R>;
        (t1: T1, t2: T2, t3: T3, t4: T4, t5: T5, t6: T6): (t7: T7) => R;
        (t1: T1, t2: T2, t3: T3, t4: T4, t5: T5, t6: T6, t7: T7): R;
    }
    interface CurriedFn8<T1, T2, T3, T4, T5, T6, T7, T8, R> {
        (t1: T1): CurriedFn7<T2, T3, T4, T5, T6, T7, T8, R>;
        (t1: T1, t2: T2): CurriedFn6<T3, T4, T5, T6, T7, T8, R>;
        (t1: T1, t2: T2, t3: T3): CurriedFn5<T4, T5, T6, T7, T8, R>;
        (t1: T1, t2: T2, t3: T3, t4: T4): CurriedFn4<T5, T6, T7, T8, R>;
        (t1: T1, t2: T2, t3: T3, t4: T4, t5: T5): CurriedFn3<T6, T7, T8, R>;
        (t1: T1, t2: T2, t3: T3, t4: T4, t5: T5, t6: T6): CurriedFn2<T7, T8, R>;
        (t1: T1, t2: T2, t3: T3, t4: T4, t5: T5, t6: T6, t7: T7): (t8: T8) => R;
        (t1: T1, t2: T2, t3: T3, t4: T4, t5: T5, t6: T6, t7: T7, t8: T8): R;
    }
    interface CurriedFn9<T1, T2, T3, T4, T5, T6, T7, T8, T9, R> {
        (t1: T1): CurriedFn8<T2, T3, T4, T5, T6, T7, T8, T9, R>;
        (t1: T1, t2: T2): CurriedFn7<T3, T4, T5, T6, T7, T8, T9, R>;
        (t1: T1, t2: T2, t3: T3): CurriedFn6<T4, T5, T6, T7, T8, T9, R>;
        (t1: T1, t2: T2, t3: T3, t4: T4): CurriedFn5<T5, T6, T7, T8, T9, R>;
        (t1: T1, t2: T2, t3: T3, t4: T4, t5: T5): CurriedFn4<T6, T7, T8, T9, R>;
        (t1: T1, t2: T2, t3: T3, t4: T4, t5: T5, t6: T6): CurriedFn3<T7, T8, T9, R>;
        (t1: T1, t2: T2, t3: T3, t4: T4, t5: T5, t6: T6, t7: T7): CurriedFn2<T8, T9, R>;
        (t1: T1, t2: T2, t3: T3, t4: T4, t5: T5, t6: T6, t7: T7, t8: T8): (t9: T9) => R;
        (t1: T1, t2: T2, t3: T3, t4: T4, t5: T5, t6: T6, t7: T7, t8: T8, t9: T9): R;
    }

    interface Reduced {}

    interface Static {

       /**
        * Adds two numbers. Equivalent to a + b but curried.
        */
       add(a: number, b: number): number;
       add(a: number): (b: number) => number;
       // add: CurriedFn2<number, number, number>;

       /**
        * Creates a new list iteration function from an existing one by adding two new parameters to its callback
        * function: the current index, and the entire list.
        */
       addIndex<T,U>(fn: (f: (item: T) => U, list: T[]) => U[] ): CurriedFn2<(item: T, idx: number, list?: T[]) => U, T[], U[]>;
       /* Special case for forEach */
       addIndex<T>(fn: (f: (item: T) => void, list: T[]) => T[]): CurriedFn2<(item: T, idx: number, list?: T[]) => void, T[], T[]>;
       /* Special case for reduce */
       addIndex<T,U>(fn: (f: (acc:U, item: T) => U, aci:U, list: T[]) => U): CurriedFn3<(acc:U, item: T, idx: number, list?: T[]) => U, U, T[], U>;
       // addIndex<T,U>: CurriedFn3<(f: (item: T) => U, list: T[]) => U[], (item: T, idx: number, list?: T[]) => U, T[], U[]>;

        /**
         * Applies a function to the value at the given index of an array, returning a new copy of the array with the
         * element at the given index replaced with the result of the function application.
         */
        adjust<T>(fn: (a: T) => T, index: number, list: T[]): T[];
        adjust<T>(fn: (a: T) => T, index: number): (list: T[]) => T[];
        adjust<T>(fn: (a: T) => T): CurriedFn2<number, T[], T[]>
        // adjust<T>: CurriedFn3<(a: T) => T, number, T[], T[]>

        /**
         * Returns true if all elements of the list match the predicate, false if there are any that don't.
         */
        all<T>(fn: (a: T) => boolean, list: T[]): boolean;
        all<T>(fn: (a: T) => boolean): (list: T[]) => boolean;
        // all<T>: CurriedFn2<(a: T) => boolean, T[], boolean>;

        /**
         * Given a list of predicates, returns a new predicate that will be true exactly when all of them are.
         */
        allPass<T>(preds: Pred<T>[]): Pred<T>;

       /**
        * Returns a function that always returns the given value.
        */
        always<T>(val: T): () => T;


        /**
         * A function that returns the first argument if it's falsy otherwise the second argument. Note that this is
         * NOT short-circuited, meaning that if expressions are passed they are both evaluated.
         */
        // dispatch to some `and` method:
        and<T extends {and?: Function;}>(fn1: T, val2: boolean|any): boolean;
        and<T extends {and?: Function;}>(fn1: T): (val2: boolean|any) => boolean;
        // and<T extends {and?: Function;}>: CurriedFn2<T, boolean|any, boolean>;
        // // functions, does this still exist?
        // and<T extends () => boolean>(fn1: T, fn2: T): T;
        // and<T extends () => boolean>(fn1: T): (fn2: T) => T;
        // no generics:
        and(v1: any, v2: any): boolean;
        and(v1: any): (v2: any) => boolean;
        // and: CurriedFn2<any, any, boolean>;

        /**
         * Returns true if at least one of elements of the list match the predicate, false otherwise.
         */
        any<T>(fn: (a: T) => boolean, list: T[]): boolean;
        any<T>(fn: (a: T) => boolean): (list: T[]) => boolean;
        // any<T>: CurriedFn2<(a: T) => boolean, T[], boolean>;

        /**
         * Given a list of predicates returns a new predicate that will be true exactly when any one of them is.
         */
        anyPass<T>(preds: Pred<T>[]): Pred<T>;

        /**
         * ap applies a list of functions to a list of values.
         */
        ap<T,U>(fns: ((a: T) => U)[], vs: T[]): U[];
        ap<T,U>(fns: ((a: T) => U)[]): (vs: T[]) => U[];
        // ap<T,U>: CurriedFn2<((a: T) => U)[], T[], U[]>;


        /**
         * Returns a new list, composed of n-tuples of consecutive elements If n is greater than the length of the list,
         * an empty list is returned.
         */
        aperture<T>(n: number, list: T): T[][];
        aperture(n: number): <T>(list: T) => T[][];
        // aperture<T>: CurriedFn2<number, T, T[][]>;

        /**
         * Returns a new list containing the contents of the given list, followed by the given element.
         */
        append<T, U>(el: U, list: T[]): (T & U)[];
        append<U>(el: U): <T>(list: T[]) => (T & U)[];
        // append<T, U>: CurriedFn2<U, T[], (T & U)[]>;

        /**
         * Applies function fn to the argument list args. This is useful for creating a fixed-arity function from
         * a variadic function. fn should be a bound function if context is significant.
         */
        apply<T, U, TResult>(fn: (arg0: T, ...args: T[]) => TResult, args: U[]): TResult;
        apply<T, TResult>(fn: (arg0: T, ...args: T[]) => TResult): <U>(args: U[]) => TResult;
        // apply<T, U, TResult>: CurriedFn2<(arg0: T, ...args: T[]) => TResult, U[], TResult>;

        /**
         * Given a spec object recursively mapping properties to functions, creates a function producing an object
         * of the same structure, by mapping each property to the result of calling its associated function with
         * the supplied arguments.
         */
        applySpec<T>(obj: any): (...args: any[]) => T;

        /**
         * Makes a shallow clone of an object, setting or overriding the specified property with the given value.
         */
        assoc<T,U>(prop: Prop, val: T, obj: U): {prop: T} & U;
        assoc<T>(prop: Prop, val: T): <U>(obj: U) => {prop: T} & U;
        assoc<T,U>(prop: Prop): CurriedFn2<T,U, {prop: T} & U>;
        // assoc<T,U>: CurriedFn3<Prop, T, U, {prop: T} & U>;


        /**
         * Makes a shallow clone of an object, setting or overriding the nodes required to create the given path, and
         * placing the specific value at the tail end of that path.
         */
        assocPath<T,U>(path: Path, val: T, obj: U): U;
        assocPath<T>(path: Path, val: T): <U>(obj: U) => U;
        assocPath<T,U>(path: Path): CurriedFn2<T, U, U>;
        // assocPath<T,U>: CurriedFn3<Path, T, U, U>;

        /**
         * Wraps a function of any arity (including nullary) in a function that accepts exactly 2
         * parameters. Any extraneous parameters will not be passed to the supplied function.
         */
        binary<T, A, B>(fn: (a: A, b: T, ...args: any[]) => T): (a: A, b: B) => T;
        binary<T>(fn: (...args: any[]) => T): (a: any, b: any) => T;

        /**
         * Creates a function that is bound to a context. Note: R.bind does not provide the additional argument-binding
         * capabilities of Function.prototype.bind.
         */
        bind<T>(fn: (...args: any[]) => any, thisObj: T): (...args: any[]) => any;
        bind<T>(fn: (...args: any[]) => any): (thisObj: T) => (...args: any[]) => any;
        // bind<T>: CurriedFn2<(...args: any[]) => any, T, (...args: any[]) => any>;


        /**
         * A function wrapping calls to the two functions in an && operation, returning the result of the first function
         * if it is false-y and the result of the second function otherwise. Note that this is short-circuited, meaning
         * that the second function will not be invoked if the first returns a false-y value.
         */
        both<T>(pred1: Pred<T>, pred2: Pred<T>): Pred<T>;
        both<T>(pred1: Pred<T>): (pred2: Pred<T>) => Pred<T>;
        // both<T>: CurriedFn2<Pred<T>, Pred<T>, Pred<T>>;

        /**
         * Returns the result of calling its first argument with the remaining arguments. This is occasionally useful
         * as a converging function for R.converge: the left branch can produce a function while the right branch
         * produces a value to be passed to that function as an argument.
         */
        call(fn: (...args: any[]) => (...args: any[]) => any, ...args: any[]): any;

        /**
         * `chain` maps a function over a list and concatenates the results.
         * This implementation is compatible with the Fantasy-land Chain spec
         */
        chain<T, U>(fn: (n: T) => U[], list: T[]): U[];
        chain<T, U>(fn: (n: T) => U[]): (list: T[]) => U[];
        // chain<T, U>: CurriedFn2<(n: T) => U[], T[], U[]>;

        /**
         * Restricts a number to be within a range.
         * Also works for other ordered types such as Strings and Date
         */
        clamp<T>(min: T, max: T, value: T): T;
        clamp<T>(min: T, max: T): (value: T) => T;
        clamp<T>(min: T): CurriedFn2<T,T,T>;
        // clamp<T>: CurriedFn3<T,T,T,T>;

        /**
         * Creates a deep copy of the value which may contain (nested) Arrays and Objects, Numbers, Strings, Booleans and Dates.
         */
        clone<T>(value: T): T;
        clone<T>(value: T[]): T[];

        /**
         * Makes a comparator function out of a function that reports whether the first element is less than the second.
         */
        comparator<T>(pred: (a: T, b: T) => boolean): (x: T, y: T) => number;

        /**
         * Takes a function f and returns a function g such that:
         * - applying g to zero or more arguments will give true if applying the same arguments to f gives
         *   a logical false value; and
         * - applying g to zero or more arguments will give false if applying the same arguments to f gives
         *   a logical true value.
         */
        complement<T>(pred: (...args: T[]) => boolean): (...args: T[]) => boolean

        /**
         * Performs right-to-left function composition. The rightmost function may have any arity; the remaining
         * functions must be unary.
        */
        compose<V0, T1>(fn0: (x0: V0) => T1): CurriedFn1<V0, T1>;
        compose<V0, V1, T1>(fn0: (x0: V0, x1: V1) => T1): CurriedFn2<V0, V1, T1>;
        compose<V0, V1, V2, T1>(fn0: (x0: V0, x1: V1, x2: V2) => T1): CurriedFn3<V0, V1, V2, T1>;
        compose<V0, V1, V2, V3, T1>(fn0: (x0: V0, x1: V1, x2: V2, x3: V3) => T1): CurriedFn4<V0, V1, V2, V3, T1>;
        compose<V0, T1, T2>(fn1: (x: T1) => T2, fn0: (x0: V0) => T1): CurriedFn1<V0, T2>;
        compose<V0, V1, T1, T2>(fn1: (x: T1) => T2, fn0: (x0: V0, x1: V1) => T1): CurriedFn2<V0, V1, T2>;
        compose<V0, V1, V2, T1, T2>(fn1: (x: T1) => T2, fn0: (x0: V0, x1: V1, x2: V2) => T1): CurriedFn3<V0, V1, V2, T2>;
        compose<V0, V1, V2, V3, T1, T2>(fn1: (x: T1) => T2, fn0: (x0: V0, x1: V1, x2: V2, x3: V3) => T1): CurriedFn4<V0, V1, V2, V3, T2>;
        compose<V0, T1, T2, T3>(fn2: (x: T2) => T3, fn1: (x: T1) => T2, fn0: (x0: V0) => T1): CurriedFn1<V0, T3>;
        compose<V0, V1, T1, T2, T3>(fn2: (x: T2) => T3, fn1: (x: T1) => T2, fn0: (x0: V0, x1: V1) => T1): CurriedFn2<V0, V1, T3>;
        compose<V0, V1, V2, T1, T2, T3>(fn2: (x: T2) => T3, fn1: (x: T1) => T2, fn0: (x0: V0, x1: V1, x2: V2) => T1): CurriedFn3<V0, V1, V2, T3>;
        compose<V0, V1, V2, V3, T1, T2, T3>(fn2: (x: T2) => T3, fn1: (x: T1) => T2, fn0: (x0: V0, x1: V1, x2: V2, x3: V3) => T1): CurriedFn4<V0, V1, V2, V3, T3>;
        compose<V0, T1, T2, T3, T4>(fn3: (x: T3) => T4, fn2: (x: T2) => T3, fn1: (x: T1) => T2, fn0: (x0: V0) => T1): CurriedFn1<V0, T4>;
        compose<V0, V1, T1, T2, T3, T4>(fn3: (x: T3) => T4, fn2: (x: T2) => T3, fn1: (x: T1) => T2, fn0: (x0: V0, x1: V1) => T1): CurriedFn2<V0, V1, T4>;
        compose<V0, V1, V2, T1, T2, T3, T4>(fn3: (x: T3) => T4, fn2: (x: T2) => T3, fn1: (x: T1) => T2, fn0: (x0: V0, x1: V1, x2: V2) => T1): CurriedFn3<V0, V1, V2, T4>;
        compose<V0, V1, V2, V3, T1, T2, T3, T4>(fn3: (x: T3) => T4, fn2: (x: T2) => T3, fn1: (x: T1) => T2, fn0: (x0: V0, x1: V1, x2: V2, x3: V3) => T1): CurriedFn4<V0, V1, V2, V3, T4>;
        compose<V0, T1, T2, T3, T4, T5>(fn4: (x: T4) => T5, fn3: (x: T3) => T4, fn2: (x: T2) => T3, fn1: (x: T1) => T2, fn0: (x0: V0) => T1): CurriedFn1<V0, T5>;
        compose<V0, V1, T1, T2, T3, T4, T5>(fn4: (x: T4) => T5, fn3: (x: T3) => T4, fn2: (x: T2) => T3, fn1: (x: T1) => T2, fn0: (x0: V0, x1: V1) => T1): CurriedFn2<V0, V1, T5>;
        compose<V0, V1, V2, T1, T2, T3, T4, T5>(fn4: (x: T4) => T5, fn3: (x: T3) => T4, fn2: (x: T2) => T3, fn1: (x: T1) => T2, fn0: (x0: V0, x1: V1, x2: V2) => T1): CurriedFn3<V0, V1, V2, T5>;
        compose<V0, V1, V2, V3, T1, T2, T3, T4, T5>(fn4: (x: T4) => T5, fn3: (x: T3) => T4, fn2: (x: T2) => T3, fn1: (x: T1) => T2, fn0: (x0: V0, x1: V1, x2: V2, x3: V3) => T1): CurriedFn4<V0, V1, V2, V3, T5>;
        compose<V0, T1, T2, T3, T4, T5, T6>(fn5: (x: T5) => T6, fn4: (x: T4) => T5, fn3: (x: T3) => T4, fn2: (x: T2) => T3, fn1: (x: T1) => T2, fn0: (x0: V0) => T1): CurriedFn1<V0, T6>;
        compose<V0, V1, T1, T2, T3, T4, T5, T6>(fn5: (x: T5) => T6, fn4: (x: T4) => T5, fn3: (x: T3) => T4, fn2: (x: T2) => T3, fn1: (x: T1) => T2, fn0: (x0: V0, x1: V1) => T1): CurriedFn2<V0, V1, T6>;
        compose<V0, V1, V2, T1, T2, T3, T4, T5, T6>(fn5: (x: T5) => T6, fn4: (x: T4) => T5, fn3: (x: T3) => T4, fn2: (x: T2) => T3, fn1: (x: T1) => T2, fn0: (x0: V0, x1: V1, x2: V2) => T1): CurriedFn3<V0, V1, V2, T6>;
        compose<V0, V1, V2, V3, T1, T2, T3, T4, T5, T6>(fn5: (x: T5) => T6, fn4: (x: T4) => T5, fn3: (x: T3) => T4, fn2: (x: T2) => T3, fn1: (x: T1) => T2, fn0: (x0: V0, x1: V1, x2: V2, x3: V3) => T1): CurriedFn4<V0, V1, V2, V3, T6>;
        compose<V0, T1, T2, T3, T4, T5, T6, T7>(fn6: (x: T6) => T7, fn5: (x: T5) => T6, fn4: (x: T4) => T5, fn3: (x: T3) => T4, fn2: (x: T2) => T3, fn1: (x: T1) => T2, fn0: (x0: V0) => T1): CurriedFn1<V0, T7>;
        compose<V0, V1, T1, T2, T3, T4, T5, T6, T7>(fn6: (x: T6) => T7, fn5: (x: T5) => T6, fn4: (x: T4) => T5, fn3: (x: T3) => T4, fn2: (x: T2) => T3, fn1: (x: T1) => T2, fn0: (x0: V0, x1: V1) => T1): CurriedFn2<V0, V1, T7>;
        compose<V0, V1, V2, T1, T2, T3, T4, T5, T6, T7>(fn6: (x: T6) => T7, fn5: (x: T5) => T6, fn4: (x: T4) => T5, fn3: (x: T3) => T4, fn2: (x: T2) => T3, fn1: (x: T1) => T2, fn0: (x0: V0, x1: V1, x2: V2) => T1): CurriedFn3<V0, V1, V2, T7>;
        compose<V0, V1, V2, V3, T1, T2, T3, T4, T5, T6, T7>(fn6: (x: T6) => T7, fn5: (x: T5) => T6, fn4: (x: T4) => T5, fn3: (x: T3) => T4, fn2: (x: T2) => T3, fn1: (x: T1) => T2, fn0: (x0: V0, x1: V1, x2: V2, x3: V3) => T1): CurriedFn4<V0, V1, V2, V3, T7>;
        compose<V0, T1, T2, T3, T4, T5, T6, T7, T8>(fn7: (x: T7) => T8, fn6: (x: T6) => T7, fn5: (x: T5) => T6, fn4: (x: T4) => T5, fn3: (x: T3) => T4, fn2: (x: T2) => T3, fn1: (x: T1) => T2, fn0: (x0: V0) => T1): CurriedFn1<V0, T8>;
        compose<V0, V1, T1, T2, T3, T4, T5, T6, T7, T8>(fn7: (x: T7) => T8, fn6: (x: T6) => T7, fn5: (x: T5) => T6, fn4: (x: T4) => T5, fn3: (x: T3) => T4, fn2: (x: T2) => T3, fn1: (x: T1) => T2, fn0: (x0: V0, x1: V1) => T1): CurriedFn2<V0, V1, T8>;
        compose<V0, V1, V2, T1, T2, T3, T4, T5, T6, T7, T8>(fn7: (x: T7) => T8, fn6: (x: T6) => T7, fn5: (x: T5) => T6, fn4: (x: T4) => T5, fn3: (x: T3) => T4, fn2: (x: T2) => T3, fn1: (x: T1) => T2, fn0: (x0: V0, x1: V1, x2: V2) => T1): CurriedFn3<V0, V1, V2, T8>;
        compose<V0, V1, V2, V3, T1, T2, T3, T4, T5, T6, T7, T8>(fn7: (x: T7) => T8, fn6: (x: T6) => T7, fn5: (x: T5) => T6, fn4: (x: T4) => T5, fn3: (x: T3) => T4, fn2: (x: T2) => T3, fn1: (x: T1) => T2, fn0: (x0: V0, x1: V1, x2: V2, x3: V3) => T1): CurriedFn4<V0, V1, V2, V3, T8>;
        compose<V0, T1, T2, T3, T4, T5, T6, T7, T8, T9>(fn8: (x: T8) => T9, fn7: (x: T7) => T8, fn6: (x: T6) => T7, fn5: (x: T5) => T6, fn4: (x: T4) => T5, fn3: (x: T3) => T4, fn2: (x: T2) => T3, fn1: (x: T1) => T2, fn0: (x0: V0) => T1): CurriedFn1<V0, T9>;
        compose<V0, V1, T1, T2, T3, T4, T5, T6, T7, T8, T9>(fn8: (x: T8) => T9, fn7: (x: T7) => T8, fn6: (x: T6) => T7, fn5: (x: T5) => T6, fn4: (x: T4) => T5, fn3: (x: T3) => T4, fn2: (x: T2) => T3, fn1: (x: T1) => T2, fn0: (x0: V0, x1: V1) => T1): CurriedFn2<V0, V1, T9>;
        compose<V0, V1, V2, T1, T2, T3, T4, T5, T6, T7, T8, T9>(fn8: (x: T8) => T9, fn7: (x: T7) => T8, fn6: (x: T6) => T7, fn5: (x: T5) => T6, fn4: (x: T4) => T5, fn3: (x: T3) => T4, fn2: (x: T2) => T3, fn1: (x: T1) => T2, fn0: (x0: V0, x1: V1, x2: V2) => T1): CurriedFn3<V0, V1, V2, T9>;
        compose<V0, V1, V2, V3, T1, T2, T3, T4, T5, T6, T7, T8, T9>(fn8: (x: T8) => T9, fn7: (x: T7) => T8, fn6: (x: T6) => T7, fn5: (x: T5) => T6, fn4: (x: T4) => T5, fn3: (x: T3) => T4, fn2: (x: T2) => T3, fn1: (x: T1) => T2, fn0: (x0: V0, x1: V1, x2: V2, x3: V3) => T1): CurriedFn4<V0, V1, V2, V3, T9>;

        /**
         * Returns the right-to-left Kleisli composition of the provided functions, each of which must return a value of a type supported by chain.
         */
        composeK<V, T1>(fn0: (v: Chain<V>) => Chain<T1>): (v: Chain<V>) => Chain<T1>;
        composeK<V, T1, T2>(fn1: (x: T1) => Chain<T2>, fn0: (v: Chain<V>) => Chain<T1>): (v: Chain<V>) => Chain<T2>;
        composeK<V, T1, T2, T3>(fn2: (x: T2) => Chain<T3>, fn1: (x: T1) => Chain<T2>, fn0: (v: Chain<V>) => Chain<T1>): (v: Chain<V>) => Chain<T3>;
        composeK<V, T1, T2, T3, T4>(fn3: (x: T3) => Chain<T4>, fn2: (x: T2) => Chain<T3>, fn1: (x: T1) => Chain<T2>, fn0: (v: Chain<V>) => Chain<T1>): (v: Chain<V>) => Chain<T4>;
        composeK<V, T1, T2, T3, T4, T5>(fn4: (x: T4) => Chain<T5>, fn3: (x: T3) => Chain<T4>, fn2: (x: T2) => Chain<T3>, fn1: (x: T1) => Chain<T2>, fn0: (v: Chain<V>) => Chain<T1>): (v: Chain<V>) => Chain<T5>;
        composeK<V, T1, T2, T3, T4, T5, T6>(fn5: (x: T5) => Chain<T6>, fn4: (x: T4) => Chain<T5>, fn3: (x: T3) => Chain<T4>, fn2: (x: T2) => Chain<T3>, fn1: (x: T1) => Chain<T2>, fn0: (v: Chain<V>) => Chain<T1>): (v: Chain<V>) => Chain<T6>;
        composeK<V, T1, T2, T3, T4, T5, T6, T7>(fn6: (x: T6) => Chain<T7>, fn5: (x: T5) => Chain<T6>, fn4: (x: T4) => Chain<T5>, fn3: (x: T3) => Chain<T4>, fn2: (x: T2) => Chain<T3>, fn1: (x: T1) => Chain<T2>, fn0: (v: Chain<V>) => Chain<T1>): (v: Chain<V>) => Chain<T7>;
        composeK<V, T1, T2, T3, T4, T5, T6, T7, T8>(fn7: (x: T7) => Chain<T8>, fn6: (x: T6) => Chain<T7>, fn5: (x: T5) => Chain<T6>, fn4: (x: T4) => Chain<T5>, fn3: (x: T3) => Chain<T4>, fn2: (x: T2) => Chain<T3>, fn1: (x: T1) => Chain<T2>, fn0: (v: Chain<V>) => Chain<T1>): (v: Chain<V>) => Chain<T8>;
        composeK<V, T1, T2, T3, T4, T5, T6, T7, T8, T9>(fn8: (x: T8) => Chain<T9>, fn7: (x: T7) => Chain<T8>, fn6: (x: T6) => Chain<T7>, fn5: (x: T5) => Chain<T6>, fn4: (x: T4) => Chain<T5>, fn3: (x: T3) => Chain<T4>, fn2: (x: T2) => Chain<T3>, fn1: (x: T1) => Chain<T2>, fn0: (v: Chain<V>) => Chain<T1>): (v: Chain<V>) => Chain<T9>;

        /**
         * Performs right-to-left composition of one or more Promise-returning functions. The rightmost function may have any arity; the remaining functions must be unary.
         */
        composeP<V0, T1>(fn0: (x0: V0) => Promise<T1>): CurriedFn1<V0, Promise<T1>>;
        composeP<V0, V1, T1>(fn0: (x0: V0, x1: V1) => Promise<T1>): CurriedFn2<V0, V1, Promise<T1>>;
        composeP<V0, V1, V2, T1>(fn0: (x0: V0, x1: V1, x2: V2) => Promise<T1>): CurriedFn3<V0, V1, V2, Promise<T1>>;
        composeP<V0, V1, V2, V3, T1>(fn0: (x0: V0, x1: V1, x2: V2, x3: V3) => Promise<T1>): CurriedFn4<V0, V1, V2, V3, Promise<T1>>;
        composeP<V0, T1, T2>(fn1: (x: T1) => Promise<T2>|T2, fn0: (x0: V0) => Promise<T1>): CurriedFn1<V0, Promise<T2>>;
        composeP<V0, V1, T1, T2>(fn1: (x: T1) => Promise<T2>|T2, fn0: (x0: V0, x1: V1) => Promise<T1>): CurriedFn2<V0, V1, Promise<T2>>;
        composeP<V0, V1, V2, T1, T2>(fn1: (x: T1) => Promise<T2>|T2, fn0: (x0: V0, x1: V1, x2: V2) => Promise<T1>): CurriedFn3<V0, V1, V2, Promise<T2>>;
        composeP<V0, V1, V2, V3, T1, T2>(fn1: (x: T1) => Promise<T2>|T2, fn0: (x0: V0, x1: V1, x2: V2, x3: V3) => Promise<T1>): CurriedFn4<V0, V1, V2, V3, Promise<T2>>;
        composeP<V0, T1, T2, T3>(fn2: (x: T2) => Promise<T3>|T3, fn1: (x: T1) => Promise<T2>|T2, fn0: (x0: V0) => Promise<T1>): CurriedFn1<V0, Promise<T3>>;
        composeP<V0, V1, T1, T2, T3>(fn2: (x: T2) => Promise<T3>|T3, fn1: (x: T1) => Promise<T2>|T2, fn0: (x0: V0, x1: V1) => Promise<T1>): CurriedFn2<V0, V1, Promise<T3>>;
        composeP<V0, V1, V2, T1, T2, T3>(fn2: (x: T2) => Promise<T3>|T3, fn1: (x: T1) => Promise<T2>|T2, fn0: (x0: V0, x1: V1, x2: V2) => Promise<T1>): CurriedFn3<V0, V1, V2, Promise<T3>>;
        composeP<V0, V1, V2, V3, T1, T2, T3>(fn2: (x: T2) => Promise<T3>|T3, fn1: (x: T1) => Promise<T2>|T2, fn0: (x0: V0, x1: V1, x2: V2, x3: V3) => Promise<T1>): CurriedFn4<V0, V1, V2, V3, Promise<T3>>;
        composeP<V0, T1, T2, T3, T4>(fn3: (x: T3) => Promise<T4>|T4, fn2: (x: T2) => Promise<T3>|T3, fn1: (x: T1) => Promise<T2>|T2, fn0: (x0: V0) => Promise<T1>): CurriedFn1<V0, Promise<T4>>;
        composeP<V0, V1, T1, T2, T3, T4>(fn3: (x: T3) => Promise<T4>|T4, fn2: (x: T2) => Promise<T3>|T3, fn1: (x: T1) => Promise<T2>|T2, fn0: (x0: V0, x1: V1) => Promise<T1>): CurriedFn2<V0, V1, Promise<T4>>;
        composeP<V0, V1, V2, T1, T2, T3, T4>(fn3: (x: T3) => Promise<T4>|T4, fn2: (x: T2) => Promise<T3>|T3, fn1: (x: T1) => Promise<T2>|T2, fn0: (x0: V0, x1: V1, x2: V2) => Promise<T1>): CurriedFn3<V0, V1, V2, Promise<T4>>;
        composeP<V0, V1, V2, V3, T1, T2, T3, T4>(fn3: (x: T3) => Promise<T4>|T4, fn2: (x: T2) => Promise<T3>|T3, fn1: (x: T1) => Promise<T2>|T2, fn0: (x0: V0, x1: V1, x2: V2, x3: V3) => Promise<T1>): CurriedFn4<V0, V1, V2, V3, Promise<T4>>;
        composeP<V0, T1, T2, T3, T4, T5>(fn4: (x: T4) => Promise<T5>|T5, fn3: (x: T3) => Promise<T4>|T4, fn2: (x: T2) => Promise<T3>|T3, fn1: (x: T1) => Promise<T2>|T2, fn0: (x0: V0) => Promise<T1>): CurriedFn1<V0, Promise<T5>>;
        composeP<V0, V1, T1, T2, T3, T4, T5>(fn4: (x: T4) => Promise<T5>|T5, fn3: (x: T3) => Promise<T4>|T4, fn2: (x: T2) => Promise<T3>|T3, fn1: (x: T1) => Promise<T2>|T2, fn0: (x0: V0, x1: V1) => Promise<T1>): CurriedFn2<V0, V1, Promise<T5>>;
        composeP<V0, V1, V2, T1, T2, T3, T4, T5>(fn4: (x: T4) => Promise<T5>|T5, fn3: (x: T3) => Promise<T4>|T4, fn2: (x: T2) => Promise<T3>|T3, fn1: (x: T1) => Promise<T2>|T2, fn0: (x0: V0, x1: V1, x2: V2) => Promise<T1>): CurriedFn3<V0, V1, V2, Promise<T5>>;
        composeP<V0, V1, V2, V3, T1, T2, T3, T4, T5>(fn4: (x: T4) => Promise<T5>|T5, fn3: (x: T3) => Promise<T4>|T4, fn2: (x: T2) => Promise<T3>|T3, fn1: (x: T1) => Promise<T2>|T2, fn0: (x0: V0, x1: V1, x2: V2, x3: V3) => Promise<T1>): CurriedFn4<V0, V1, V2, V3, Promise<T5>>;
        composeP<V0, T1, T2, T3, T4, T5, T6>(fn5: (x: T5) => Promise<T6>|T6, fn4: (x: T4) => Promise<T5>|T5, fn3: (x: T3) => Promise<T4>|T4, fn2: (x: T2) => Promise<T3>|T3, fn1: (x: T1) => Promise<T2>|T2, fn0: (x0: V0) => Promise<T1>): CurriedFn1<V0, Promise<T6>>;
        composeP<V0, V1, T1, T2, T3, T4, T5, T6>(fn5: (x: T5) => Promise<T6>|T6, fn4: (x: T4) => Promise<T5>|T5, fn3: (x: T3) => Promise<T4>|T4, fn2: (x: T2) => Promise<T3>|T3, fn1: (x: T1) => Promise<T2>|T2, fn0: (x0: V0, x1: V1) => Promise<T1>): CurriedFn2<V0, V1, Promise<T6>>;
        composeP<V0, V1, V2, T1, T2, T3, T4, T5, T6>(fn5: (x: T5) => Promise<T6>|T6, fn4: (x: T4) => Promise<T5>|T5, fn3: (x: T3) => Promise<T4>|T4, fn2: (x: T2) => Promise<T3>|T3, fn1: (x: T1) => Promise<T2>|T2, fn0: (x0: V0, x1: V1, x2: V2) => Promise<T1>): CurriedFn3<V0, V1, V2, Promise<T6>>;
        composeP<V0, V1, V2, V3, T1, T2, T3, T4, T5, T6>(fn5: (x: T5) => Promise<T6>|T6, fn4: (x: T4) => Promise<T5>|T5, fn3: (x: T3) => Promise<T4>|T4, fn2: (x: T2) => Promise<T3>|T3, fn1: (x: T1) => Promise<T2>|T2, fn0: (x0: V0, x1: V1, x2: V2, x3: V3) => Promise<T1>): CurriedFn4<V0, V1, V2, V3, Promise<T6>>;
        composeP<V0, T1, T2, T3, T4, T5, T6, T7>(fn6: (x: T6) => Promise<T7>|T7, fn5: (x: T5) => Promise<T6>|T6, fn4: (x: T4) => Promise<T5>|T5, fn3: (x: T3) => Promise<T4>|T4, fn2: (x: T2) => Promise<T3>|T3, fn1: (x: T1) => Promise<T2>|T2, fn0: (x0: V0) => Promise<T1>): CurriedFn1<V0, Promise<T7>>;
        composeP<V0, V1, T1, T2, T3, T4, T5, T6, T7>(fn6: (x: T6) => Promise<T7>|T7, fn5: (x: T5) => Promise<T6>|T6, fn4: (x: T4) => Promise<T5>|T5, fn3: (x: T3) => Promise<T4>|T4, fn2: (x: T2) => Promise<T3>|T3, fn1: (x: T1) => Promise<T2>|T2, fn0: (x0: V0, x1: V1) => Promise<T1>): CurriedFn2<V0, V1, Promise<T7>>;
        composeP<V0, V1, V2, T1, T2, T3, T4, T5, T6, T7>(fn6: (x: T6) => Promise<T7>|T7, fn5: (x: T5) => Promise<T6>|T6, fn4: (x: T4) => Promise<T5>|T5, fn3: (x: T3) => Promise<T4>|T4, fn2: (x: T2) => Promise<T3>|T3, fn1: (x: T1) => Promise<T2>|T2, fn0: (x0: V0, x1: V1, x2: V2) => Promise<T1>): CurriedFn3<V0, V1, V2, Promise<T7>>;
        composeP<V0, V1, V2, V3, T1, T2, T3, T4, T5, T6, T7>(fn6: (x: T6) => Promise<T7>|T7, fn5: (x: T5) => Promise<T6>|T6, fn4: (x: T4) => Promise<T5>|T5, fn3: (x: T3) => Promise<T4>|T4, fn2: (x: T2) => Promise<T3>|T3, fn1: (x: T1) => Promise<T2>|T2, fn0: (x0: V0, x1: V1, x2: V2, x3: V3) => Promise<T1>): CurriedFn4<V0, V1, V2, V3, Promise<T7>>;
        composeP<V0, T1, T2, T3, T4, T5, T6, T7, T8>(fn7: (x: T7) => Promise<T8>|T8, fn6: (x: T6) => Promise<T7>|T7, fn5: (x: T5) => Promise<T6>|T6, fn4: (x: T4) => Promise<T5>|T5, fn3: (x: T3) => Promise<T4>|T4, fn2: (x: T2) => Promise<T3>|T3, fn1: (x: T1) => Promise<T2>|T2, fn0: (x0: V0) => Promise<T1>): CurriedFn1<V0, Promise<T8>>;
        composeP<V0, V1, T1, T2, T3, T4, T5, T6, T7, T8>(fn7: (x: T7) => Promise<T8>|T8, fn6: (x: T6) => Promise<T7>|T7, fn5: (x: T5) => Promise<T6>|T6, fn4: (x: T4) => Promise<T5>|T5, fn3: (x: T3) => Promise<T4>|T4, fn2: (x: T2) => Promise<T3>|T3, fn1: (x: T1) => Promise<T2>|T2, fn0: (x0: V0, x1: V1) => Promise<T1>): CurriedFn2<V0, V1, Promise<T8>>;
        composeP<V0, V1, V2, T1, T2, T3, T4, T5, T6, T7, T8>(fn7: (x: T7) => Promise<T8>|T8, fn6: (x: T6) => Promise<T7>|T7, fn5: (x: T5) => Promise<T6>|T6, fn4: (x: T4) => Promise<T5>|T5, fn3: (x: T3) => Promise<T4>|T4, fn2: (x: T2) => Promise<T3>|T3, fn1: (x: T1) => Promise<T2>|T2, fn0: (x0: V0, x1: V1, x2: V2) => Promise<T1>): CurriedFn3<V0, V1, V2, Promise<T8>>;
        composeP<V0, V1, V2, V3, T1, T2, T3, T4, T5, T6, T7, T8>(fn7: (x: T7) => Promise<T8>|T8, fn6: (x: T6) => Promise<T7>|T7, fn5: (x: T5) => Promise<T6>|T6, fn4: (x: T4) => Promise<T5>|T5, fn3: (x: T3) => Promise<T4>|T4, fn2: (x: T2) => Promise<T3>|T3, fn1: (x: T1) => Promise<T2>|T2, fn0: (x0: V0, x1: V1, x2: V2, x3: V3) => Promise<T1>): CurriedFn4<V0, V1, V2, V3, Promise<T8>>;
        composeP<V0, T1, T2, T3, T4, T5, T6, T7, T8, T9>(fn8: (x: T8) => Promise<T9>|T9, fn7: (x: T7) => Promise<T8>|T8, fn6: (x: T6) => Promise<T7>|T7, fn5: (x: T5) => Promise<T6>|T6, fn4: (x: T4) => Promise<T5>|T5, fn3: (x: T3) => Promise<T4>|T4, fn2: (x: T2) => Promise<T3>|T3, fn1: (x: T1) => Promise<T2>|T2, fn0: (x0: V0) => Promise<T1>): CurriedFn1<V0, Promise<T9>>;
        composeP<V0, V1, T1, T2, T3, T4, T5, T6, T7, T8, T9>(fn8: (x: T8) => Promise<T9>|T9, fn7: (x: T7) => Promise<T8>|T8, fn6: (x: T6) => Promise<T7>|T7, fn5: (x: T5) => Promise<T6>|T6, fn4: (x: T4) => Promise<T5>|T5, fn3: (x: T3) => Promise<T4>|T4, fn2: (x: T2) => Promise<T3>|T3, fn1: (x: T1) => Promise<T2>|T2, fn0: (x0: V0, x1: V1) => Promise<T1>): CurriedFn2<V0, V1, Promise<T9>>;
        composeP<V0, V1, V2, T1, T2, T3, T4, T5, T6, T7, T8, T9>(fn8: (x: T8) => Promise<T9>|T9, fn7: (x: T7) => Promise<T8>|T8, fn6: (x: T6) => Promise<T7>|T7, fn5: (x: T5) => Promise<T6>|T6, fn4: (x: T4) => Promise<T5>|T5, fn3: (x: T3) => Promise<T4>|T4, fn2: (x: T2) => Promise<T3>|T3, fn1: (x: T1) => Promise<T2>|T2, fn0: (x0: V0, x1: V1, x2: V2) => Promise<T1>): CurriedFn3<V0, V1, V2, Promise<T9>>;
        composeP<V0, V1, V2, V3, T1, T2, T3, T4, T5, T6, T7, T8, T9>(fn8: (x: T8) => Promise<T9>|T9, fn7: (x: T7) => Promise<T8>|T8, fn6: (x: T6) => Promise<T7>|T7, fn5: (x: T5) => Promise<T6>|T6, fn4: (x: T4) => Promise<T5>|T5, fn3: (x: T3) => Promise<T4>|T4, fn2: (x: T2) => Promise<T3>|T3, fn1: (x: T1) => Promise<T2>|T2, fn0: (x0: V0, x1: V1, x2: V2, x3: V3) => Promise<T1>): CurriedFn4<V0, V1, V2, V3, Promise<T9>>;

        /**
         * Returns a new list consisting of the elements of the first list followed by the elements
         * of the second.
         */
        concat<T>(list1: T[], list2: T[]): T[];
        concat<T>(list1: T[]): (list2: T[]) => T[];
        // concat<T>: CurriedFn2<T[], T[], T[]>;
        concat(list1: string, list2: string): string;
        concat(list1: string): (list2: string) => string;
        // concat: CurriedFn2<string, string, string>;

        /**
         * Returns a function, fn, which encapsulates if/else-if/else logic. R.cond takes a list of [predicate, transform] pairs.
         * All of the arguments to fn are applied to each of the predicates in turn until one returns a "truthy" value, at which
         * point fn returns the result of applying its arguments to the corresponding transformer. If none of the predicates
         * matches, fn returns undefined.
         */
        cond<T, U>(fns: [Pred<T>, (v: T) => U][]): (v: T) => U;

        /**
         * Wraps a constructor function inside a curried function that can be called with the same arguments and returns the same type.
         */
        construct(fn: Function): Function;

        /**
         * Wraps a constructor function inside a curried function that can be called with the same arguments and returns the same type.
         * The arity of the function returned is specified to allow using variadic constructor functions.
         */
        constructN(n: number, fn: Function): Function;
        // constructN: CurriedFn2<number, Function, Function>;


        /**
         * Returns `true` if the specified item is somewhere in the list, `false` otherwise.
         * Equivalent to `indexOf(a)(list) > -1`. Uses strict (`===`) equality checking.
         */
        contains(a: string, list: string): boolean;
        contains(a: string): (list: string) => boolean;
        // contains: CurriedFn2<string, string, boolean>;
        contains<T>(a: T, list: T[]): boolean;
        contains<T>(a: T): (list: T[]) => boolean;
        // contains<T>: CurriedFn2<T, T[], boolean>;

        /**
         * Accepts a converging function and a list of branching functions and returns a new
         * function. When invoked, this new function is applied to some arguments, each branching
         * function is applied to those same arguments. The results of each branching function
         * are passed as arguments to the converging function to produce the return value.
         */
        converge<T>(after: (...fn_results: any[]) => T, fns: Array<(...args: any[]) => any>): (...args: any[]) => T;
        // converge<T>: CurriedFn2<(...fn_results: any[]) => T, Array<(...args: any[]) => any>, (...args: any[]) => T>;

        /**
         * Counts the elements of a list according to how many match each value
         * of a key generated by the supplied function. Returns an object
         * mapping the keys produced by `fn` to the number of occurrences in
         * the list. Note that all keys are coerced to strings because of how
         * JavaScript objects work.
         */
        countBy<T>(fn: (a: T) => string|number, list: T[]): { [index: string]: number };
        countBy<T>(fn: (a: T) => string|number): (list: T[]) => { [index: string]: number };
        // countBy<T>: CurriedFn2<(a: T) => string|number, T[], { [index: string]: number }>;

        /**
         * Returns a curried equivalent of the provided function.
         */
        curry<T1, T2, TResult>(fn: (a: T1, b: T2) => TResult): CurriedFn2<T1, T2, TResult>;
        curry<T1, T2, T3, TResult>(fn: (a: T1, b: T2, c: T3) => TResult): CurriedFn3<T1, T2, T3, TResult>;
        curry<T1, T2, T3, T4, TResult>(fn: (a: T1, b: T2, c: T3, d: T4) => TResult): CurriedFn4<T1, T2, T3, T4, TResult>;
        curry<T1, T2, T3, T4, T5, TResult>(fn: (a: T1, b: T2, c: T3, d: T4, e: T5) => TResult): CurriedFn5<T1, T2, T3, T4, T5, TResult>;
        curry<T1, T2, T3, T4, T5, T6, TResult>(fn: (a: T1, b: T2, c: T3, d: T4, e: T5, f: T6) => TResult): CurriedFn6<T1, T2, T3, T4, T5, T6, TResult>;
        curry<T1, T2, T3, T4, T5, T6, T7, TResult>(fn: (a: T1, b: T2, c: T3, d: T4, e: T5, f: T6, g: T7) => TResult): CurriedFn7<T1, T2, T3, T4, T5, T6, T7, TResult>;
        curry<T1, T2, T3, T4, T5, T6, T7, T8, TResult>(fn: (a: T1, b: T2, c: T3, d: T4, e: T5, f: T6, g: T7, h: T8) => TResult): CurriedFn8<T1, T2, T3, T4, T5, T6, T7, T8, TResult>;
        curry<T1, T2, T3, T4, T5, T6, T7, T8, T9, TResult>(fn: (a: T1, b: T2, c: T3, d: T4, e: T5, f: T6, g: T7, h: T8, i: T9) => TResult): CurriedFn9<T1, T2, T3, T4, T5, T6, T7, T8, T9, TResult>;
        // curry(fn: Function): Function


        /**
         * Returns a curried equivalent of the provided function, with the specified arity.
         */
        curryN<T>(length: number, fn: (...args: any[]) => T): (...args: any[]) => T;
        // curryN<T>: CurriedFn2<number, (...args: any[]) => T, (...args: any[]) => T>;


        /**
         * Decrements its argument.
         */
        dec(n: number): number;

        /**
         * Returns the second argument if it is not null or undefined. If it is null or undefined, the
         * first (default) argument is returned.
         */
        defaultTo<T,U>(a: T, b: U): T|U;
        defaultTo<T>(a: T): <U>(b: U) => T|U;
        // defaultTo<T,U>: CurriedFn2<T, U, T|U>;

        /**
         * Finds the set (i.e. no duplicates) of all elements in the first list not contained in the second list.
         */
        difference<T>(list1: T[], list2: T[]): T[];
        difference<T>(list1: T[]): (list2: T[]) => T[];
        // difference<T>: CurriedFn2<T[], T[], T[]>;

        /**
         * Finds the set (i.e. no duplicates) of all elements in the first list not contained in the second list.
         * Duplication is determined according to the value returned by applying the supplied predicate to two list
         * elements.
         */
        differenceWith<T>(pred: (a: T, b: T) => boolean, list1: T[], list2: T[]): T[];
        differenceWith<T>(pred: (a: T, b: T) => boolean, list1: T[]): (list2: T[]) => T[];
        differenceWith<T>(pred: (a: T, b: T) => boolean): CurriedFn2<T,T,T>;
        // differenceWith<T>: CurriedFn3<(a: T, b: T) => boolean, T[], T[], T[]>;

        /*
         * Returns a new object that does not contain a prop property.
         */
        // TODO: fix, can't yet calculate type of object minus this key
        // dissoc<T,U>(prop: Prop, obj: T & { [prop: Prop]: any }): T; // wanna say the original object is the same with the extra key, but can't bind it to prop
        // dissoc<T,U extends Struct<any>>(prop: keyof U, obj: U): T;
        // It seems impossible to infer the return type, so this may have to be specified explicitly
        dissoc<T>(prop: Prop, obj: Struct<any>): T;
        dissoc(prop: Prop): <T>(obj: Struct<any>) => T;
        // dissoc<T>: CurriedFn2<Prop, Struct<any>, T>;
        // dissoc<U extends Struct<any>>(prop: keyof U): <T>(obj: U) => T; // can't do this, don't know U in time
        // simplified but inferrable: leave the key in
        dissoc<T>(prop: keyof T, obj: T): T;
        dissoc(prop: Prop): <T>(obj: T) => T;
        // dissoc<T>: CurriedFn2<keyof T, T, T>;
        // dissoc<T>: CurriedFn2<Prop, T, T>;

        /**
         * Makes a shallow clone of an object, omitting the property at the given path.
         */
        dissocPath<T>(path: Path, obj: Struct<any>): T;
        dissocPath(path: Path): <T>(obj: Struct<any>) => T;
        // dissocPath<T>: CurriedFn2<Path, Struct<any>, T>;

        /**
         * Divides two numbers. Equivalent to a / b.
         */
        divide(a: number, b: number): number;
        divide(a: number): (b: number) => number;
        // divide: CurriedFn2<number, number, number>;

        /**
         * Returns a new list containing all but the first n elements of the given list.
         */
        drop<T>(n: number, xs: T[]): T[];
        drop(n: number, xs: string): string;
        drop<T>(n: number): {
            (xs: string): string;
            (xs: T[]): T[];
        }
        // drop<T>: CurriedFn2<number, T[], T[]>;
        // drop: CurriedFn2<number, string, string>;

        /**
         * Returns a list containing all but the last n elements of the given list.
         */
        dropLast<T>(n: number, xs: T[]): T[];
        dropLast(n: number, xs: string): string;
        dropLast<T>(n: number): {
            (xs: T[]): T[];
            (xs: string): string;
        }
        // dropLast<T>: CurriedFn2<number, T[], T[]>;
        // dropLast: CurriedFn2<number, string, string>;

        /**
         * Returns a new list containing all but last then elements of a given list, passing each value from the
         * right to the supplied predicate function, skipping elements while the predicate function returns true.
         */
        dropLastWhile<T>(fn: (a: T) => boolean, list: T[]): T[];
        dropLastWhile<T>(fn: (a: T) => boolean): (list: T[]) => T[];
        // dropLastWhile<T>: CurriedFn2<(a: T) => boolean, T[], T[]>;

        /**
         * Returns a new list containing the last n elements of a given list, passing each value to the supplied
         * predicate function, skipping elements while the predicate function returns true.
         */
        dropWhile<T>(fn: (a: T) => boolean, list: T[]): T[];
        dropWhile<T>(fn: (a: T) => boolean): (list: T[]) => T[];
        // dropWhile<T>: CurriedFn2<(a: T) => boolean, T[], T[]>;

        /**
         * A function wrapping calls to the two functions in an || operation, returning the result of the first
         * function if it is truth-y and the result of the second function otherwise. Note that this is
         * short-circuited, meaning that the second function will not be invoked if the first returns a truth-y value.
         */
        either<T>(pred1: Pred<T>, pred2: Pred<T>): Pred<T>;
        either<T>(pred1: Pred<T>): (pred2: Pred<T>) => Pred<T>;
        // either<T>: CurriedFn2<Pred<T>, Pred<T>, Pred<T>>;

        /**
         * Returns the empty value of its argument's type. Ramda defines the empty value of Array ([]), Object ({}),
         * String (''), and Arguments. Other types are supported if they define <Type>.empty and/or <Type>.prototype.empty.
         * Dispatches to the empty method of the first argument, if present.
         */
        empty<T>(x: T): T;

        /**
         * Takes a function and two values in its domain and returns true if the values map to the same value in the
         * codomain; false otherwise.
         */
        eqBy<T>(fn: (a: T) => T, a: T, b: T): boolean;
        eqBy<T>(fn: (a: T) => T, a: T): (b: T) => boolean;
        eqBy<T>(fn: (a: T) => T): CurriedFn2<T,T,boolean>;
        // eqBy<T>: CurriedFn3<(a: T) => T, T, T, boolean>;

        /**
         * Reports whether two functions have the same value for the specified property.
         */
        // more generics
        eqProps<T,U>(prop: Prop, obj1: T, obj2: U): boolean;
        eqProps<T,U>(prop: Prop): CurriedFn2<T,U,boolean>;
        eqProps(prop: Prop): <T,U>(obj1: T, obj2: U) => boolean;
        eqProps<T>(prop: Prop, obj1: T): <U>(obj2: U) => boolean;
        // eqProps<T,U>: CurriedFn3<Prop, T, U, boolean>;
        // less generics
        eqProps(prop: Prop, obj1: any, obj2: any): boolean;
        eqProps(prop: Prop): (obj1: any, obj2: any) => boolean;
        eqProps(prop: Prop): (obj1: any) => (obj2: any) => boolean;
        // eqProps: CurriedFn3<Prop, any, any, boolean>;

        /**
         * Returns true if its arguments are equivalent, false otherwise. Dispatches to an equals method if present.
         * Handles cyclical data structures.
         */
        equals<T>(a: T, b: T): boolean;
        equals<T>(a: T): (b: T) => boolean;
        // equals<T>: CurriedFn2<T, T, boolean>;

        /**
         * Creates a new object by evolving a shallow copy of object, according to the transformation functions.
         */
        evolve(transformations: Dictionary<Function>, obj: any): any;
        evolve(transformations: Dictionary<Function>): (obj: any) => any;
        // evolve<V>: CurriedFn2<Dictionary<Function>, any, any>;
        evolve<V>(transformations: Nested<V>, obj: V): Nested<V>;
        evolve<V>(transformations: Nested<V>): <V>(obj: V) => Nested<V>;
        // evolve<V>: CurriedFn2<Nested<V>, V, Nested<V>>;

        /*
         * A function that always returns false. Any passed in parameters are ignored.
         */
        F(): false;

        /**
         * Returns a new list containing only those items that match a given predicate function. The predicate function is passed one argument: (value).
         */
        // array
        filter<T>(fn: (value: T) => boolean, list: T[]): T[];
        filter<T>(fn: (value: T) => boolean): <T>(list: T[]) => T[];
        // filter<T>: CurriedFn2<(value: T) => boolean, T[], T[]>;
        // functor
        filter<T>(fn: (value: T) => boolean, list: Functor<T>): T[];
        filter<T>(fn: (value: T) => boolean): <T>(list: Functor<T>) => T[];
        // filter<T>: CurriedFn2<(value: T) => boolean, Functor<T>, T[]>;
        // object
        filter<T,U extends Dictionary<T>>(fn: (value: T) => boolean, obj: U) : Partial<U>;
        filter<T>(fn: (value: T) => boolean): <U extends Dictionary<T>>(obj: U) => Partial<U>;
        // filter<T,U extends Dictionary<T>>: CurriedFn2<(value: T) => boolean, U, Partial<U>>;

        /**
         * Returns the first element of the list which matches the predicate, or `undefined` if no
         * element matches.
         */
        find<T>(fn: (a: T) => boolean, list: T[]): T;
        find<T>(fn: (a: T) => boolean): <T>(list: T[]) => T;
        // find<T>: CurriedFn2<(a: T) => boolean, T[], T>;


        /**
         * Returns the index of the first element of the list which matches the predicate, or `-1`
         * if no element matches.
         */
        findIndex<T>(fn: (a: T) => boolean, list: T[]): number;
        findIndex<T>(fn: (a: T) => boolean): <T>(list: T[]) => number;
        // findIndex<T>: CurriedFn2<(a: T) => boolean, T[], number>;

        /**
         * Returns the last element of the list which matches the predicate, or `undefined` if no
         * element matches.
         */
        findLast<T>(fn: (a: T) => boolean, list: T[]): T;
        findLast<T>(fn: (a: T) => boolean): <T>(list: T[]) => T;
        // findLast<T>: CurriedFn2<(a: T) => boolean, T[], T>;

        /**
         * Returns the index of the last element of the list which matches the predicate, or
         * `-1` if no element matches.
         */
        findLastIndex<T>(fn: (a: T) => boolean, list: T[]): number;
        findLastIndex<T>(fn: (a: T) => boolean): <T>(list: T[]) => number;
        // findLastIndex<T>: CurriedFn2<(a: T) => boolean, T[], number>;

        /**
         * Returns a new list by pulling every item out of it (and all its sub-arrays) and putting
         * them in a new array, depth-first.
         */
        flatten<T>(x: T[][]): T[];
        flatten<T>(x: T[]): T[];

        /**
         * Returns a new function much like the supplied one, except that the first two arguments'
         * order is reversed.
         */
        flip<T,U,TResult>(fn: (arg0: T, arg1: U) => TResult): (arg1: U, arg0?: T) => TResult;
        flip<T,U,Rest,TResult>(fn: (arg0: T, arg1: U, ...args: Rest[]) => TResult): (arg1: U, arg0?: T, ...args: Rest[]) => TResult;


        /**
         * Iterate over an input list, calling a provided function fn for each element in the list.
         */
        forEach<T>(fn: (x: T) => void, list: T[]): T[];
        forEach<T>(fn: (x: T) => void): (list: T[]) => T[];
        // forEach<T>: CurriedFn2<(x: T) => void, T[], T[]>;

        /**
         * Creates a new object out of a list key-value pairs.
         */
        fromPairs<V>(pairs: KeyValuePair<Prop, V>[]): {[index: string]: V};

        /**
         * Splits a list into sublists stored in an object, based on the result of
         * calling a String-returning function
         * on each element, and grouping the results according to values returned.
         */
        groupBy<T>(fn: (a: T) => string, list: T[]): {[index: string]: T[]};
        groupBy<T>(fn: (a: T) => string): <T>(list: T[]) => {[index: string]: T[]};
        // groupBy<T>: CurriedFn2<(a: T) => string, T[], {[index: string]: T[]}>;

        /**
         * Takes a list and returns a list of lists where each sublist's elements are all "equal" according to the provided equality function
         */
        groupWith<T>(fn: (x: T, y: T) => boolean, list: T[]): T[][];
        groupWith<T>(fn: (x: T, y: T) => boolean): (list: T[]) => T[][];
        groupWith<T>(fn: (x: T, y: T) => boolean, list: string): string[];
        groupWith<T>(fn: (x: T, y: T) => boolean): (list: string) => string[];
        // groupWith<T>: CurriedFn2<(x: T, y: T) => boolean, T[], T[][]>;
        // groupWith<T>: CurriedFn2<(x: T, y: T) => boolean, string, string[]>;

        /**
         * Returns true if the first parameter is greater than the second.
         */
        gt(a: number, b: number): boolean;
        gt(a: number): (b: number) => boolean;
        // gt: CurriedFn2<number, number, boolean>;

        /**
         * Returns true if the first parameter is greater than or equal to the second.
         */
        gte(a: number, b: number): boolean;
        gte(a: number): (b: number) => boolean;
        // gte: CurriedFn2<number, number, boolean>;

        /**
         * Returns whether or not an object has an own property with the specified name.
         */
        has<T>(s: string, obj: T): boolean;
        has(s: string): <T>(obj: T) => boolean;
        // has<T>: CurriedFn2<string, T, boolean>;

        /**
         * Returns whether or not an object or its prototype chain has a property with the specified name
         */
        hasIn<T>(s: string, obj: T): boolean;
        hasIn(s: string): <T>(obj: T) => boolean;
        // hasIn<T>: CurriedFn2<string, T, boolean>;

        /**
         * Returns the first element in a list.
         * In some libraries this function is named `first`.
         */
        head<T extends Array<any>>(list: T): T[0];
        head(list: string): string;

        /**
         * Returns true if its arguments are identical, false otherwise. Values are identical if they reference the
         * same memory. NaN is identical to NaN; 0 and -0 are not identical.
         */
        identical<T>(a: T, b: T): boolean;
        identical<T>(a: T): (b: T) => boolean;
        // identical<T>: CurriedFn2<T, T, boolean>;

        /**
         * A function that does nothing but return the parameter supplied to it. Good as a default
         * or placeholder function.
         */
        identity<T>(a: T): T;

        /**
         * Creates a function that will process either the onTrue or the onFalse function depending upon the result
         * of the condition predicate.
         */
        ifElse<T,U,V>(fn: Pred<T>, onTrue: (v: T) => U, onFalse: (v: T) => V): (v: T) => U|V;
        // ifElse<T,U,V>: CurriedFn3<Pred<T>, (v: T) => U, (v: T) => V, (v: T) => U|V>;


        /**
         * Increments its argument.
         */
        inc(n: number): number;

        /**
         * Given a function that generates a key, turns a list of objects into an object indexing the objects
         * by the given key.
         */
        indexBy<T,U>(fn: (a: T) => string, list: T[]): U;
        indexBy<T>(fn: (a: T) => string): <U>(list: T[]) => U;
        // indexBy<T,U>: CurriedFn2<(a: T) => string, T[], U>;

        /**
         * Returns the position of the first occurrence of an item in an array
         * (by strict equality),
         * or -1 if the item is not included in the array.
         */
        indexOf<T>(target: T, list: T[]): number;
        indexOf<T>(target: T): (list: T[]) => number;
        // indexOf<T>: CurriedFn2<T, T[], number>;

        /**
         * Returns all but the last element of a list.
         */
        init<T>(list: T[]): T[];

        /**
         * Inserts the supplied element into the list, at index index. Note that
         * this is not destructive: it returns a copy of the list with the changes.
         */
        insert<T>(index: number, elt: T, list: T[]): T[];
        insert<T>(index: number, elt: T): (list: T[]) => T[];
        insert<T>(index: number): CurriedFn2<T, T[], T[]>;
        insert(index: number): <T>(elt: T, list: T[]) => T[];
        insert(index: number): <T>(elt: T) => (list: T[]) => T[];
        // insert<T>: CurriedFn3<number, T, T[], T[]>;

        /**
         * Inserts the sub-list into the list, at index `index`.  _Note  that this
         * is not destructive_: it returns a copy of the list with the changes.
         */
        insertAll<T>(index: number, elts: T[], list: T[]): T[];
        insertAll<T>(index: number, elts: T[]): (list: T[]) => T[];
        insertAll<T>(index: number): CurriedFn2<T[], T[], T[]>;
        insertAll(index: number): <T>(elts: T[], list: T[]) => T[];
        insertAll(index: number): <T>(elts: T[]) => (list: T[]) => T[];
        // insertAll<T>: CurriedFn3<number, T[], T[], T[]>;
        // alternative version?
        insertAll<T>(index: number): CurriedFn2<T, T, T>;


        /**
         * Combines two lists into a set (i.e. no duplicates) composed of those elements common to both lists.
         */
        intersection<T>(list1: T[], list2: T[]): T[];
        intersection<T>(list1: T[]): (list2: T[]) => T[];
        // intersection<T>: CurriedFn2<T[], T[], T[]>;


        /**
         * Combines two lists into a set (i.e. no duplicates) composed of those
         * elements common to both lists.  Duplication is determined according
         * to the value returned by applying the supplied predicate to two list
         * elements.
         */
        intersectionWith<T>(pred: (a: T, b: T) => boolean, list1: T[], list2: T[]): T[];
        intersectionWith<T>(pred: (a: T, b: T) => boolean): CurriedFn2<T[], T[], T[]>;
        // intersectionWith<T>: CurriedFn3<(a: T, b: T) => boolean, T[], T[], T[]>;

        /**
         * Creates a new list with the separator interposed between elements.
         */
        intersperse<T>(separator: T, list: T[]): T[];
        intersperse<T>(separator: T): (list: T[]) => T[];
        // intersperse<T>: CurriedFn2<T, T[], T[]>;

        /**
         * Transforms the items of the list with the transducer and appends the transformed items to the accumulator
         * using an appropriate iterator function based on the accumulator type.
         */
        into<T,U,V extends AccOpts<T,U>>(acc: V, xf: (list: T[]) => U, list: T[]): U;
        into<T,U,V extends AccOpts<T,U>>(acc: V): CurriedFn2<(list: T[]) => U, T[], U>;
        into<T,U,V extends AccOpts<T,U>>(acc: V, xf: (list: T[]) => U): <T>(list: T[]) => U;
        into<T,U,V extends AccOpts<T,U>>(acc: V): CurriedFn2<(list: T[]) => U, T[], U>;
        into<T,U,V extends AccOpts<T,U>>(acc: V): <T>(xf: (list: T[]) => U, list: T[]) => U;
        into<T,U,V extends AccOpts<T,U>>(acc: V): <T>(xf: (list: T[]) => U) => (list: T[]) => U;
        // into<T,U,V extends AccOpts<T,U>>: CurriedFn3<V, (list: T[]) => U, T[], U>;

        /**
        * Same as R.invertObj, however this accounts for objects with duplicate values by putting the values into an array.
        */
        invert(obj: Object): {[index: string]: string[]};
        invert(obj: Object): {[index: number]: string[]};

        /**
        * Returns a new object with the keys of the given object as values, and the values of the given object as keys.
        */
        invertObj(obj: Object): {[index: string]: string};
        invertObj(obj: Object): {[index: number]: string};

        /**
         * Turns a named method of an object (or object prototype) into a function that can be
         * called directly. Passing the optional `len` parameter restricts the returned function to
         * the initial `len` parameters of the method.
         *
         * The returned function is curried and accepts `len + 1` parameters (or `method.length + 1`
         * when `len` is not specified), and the final parameter is the target object.
         */
        // with keyof -- currently can't seem do to function application like this yet
        // invoker<T, K extends keyof T, R> (len: number /* = 0 */, name: K, obj: T): obj[K]();
        // // invoker<T, K extends keyof T, R>: CurriedFn3<number /* = 0 */, K, T, obj[K]()>;
        // invoker<T, K extends keyof T, P1, R>(len: number /* = 1 */, name: K, x1: P1, obj: T): obj[K](x1);
        // // invoker<T, K extends keyof T, P1, R>: CurriedFn4<number /* = 0 */, K, P1, T, obj[K](P1)>;
        // invoker<T, K extends keyof T, P1, P2, R>(len: number /* = 2 */, name: K, x1: P1, x2: P2, obj: T): obj[K](x1, x2);
        // // invoker<T, K extends keyof T, P1, P2, R>: CurriedFn5<number /* = 0 */, K, P1, P2, T, obj[K](P1, P2)>;
        // invoker<T, K extends keyof T, P1, P2, P3, R>(len: number /* = 3 */, name: K, x1: P1, x2: P2, x3: P3, obj: T): obj[K](x1, x2, x3);
        // // invoker<T, K extends keyof T, P1, P2, P3, R>: CurriedFn6<number /* = 0 */, K, P1, P2, P3, T, obj[K](P1, P2, P3)>;
        // invoker<T, K extends keyof T, P1, P2, P3, P4, R>(len: number /* = 4 */, name: K, x1: P1, x2: P2, x3: P3, x4: P4, obj: T): obj[K](x1, x2, x3, x4);
        // // invoker<T, K extends keyof T, P1, P2, P3, P4, R>: CurriedFn7<number /* = 0 */, K, P1, P2, P3, P4, T, obj[K](P1, P2, P3, P4)>;
        // invoker<T, K extends keyof T, P1, P2, P3, P4, P5, R>(len: number /* = 5 */, name: K, x1: P1, x2: P2, x3: P3, x4: P4, x5: P5, obj: T): obj[K](x1, x2, x3, x4, x5);
        // // invoker<T, K extends keyof T, P1, P2, P3, P4, P5, R>: CurriedFn8<number /* = 0 */, K, P1, P2, P3, P4, P5, T, obj[K](P1, P2, P3, P4, P5)>;

        // manually type results
        invoker<T, R> (len: number /* = 0 */, name: string, obj: T): R
        invoker<T, R> (len: number/* = 0 */, name: string): (obj: T) => R

        invoker<T, P1, R>(len: number /* = 1 */, name: string, x1: P1, obj: T): R
        invoker<T, P1, R>(len: number /* = 1 */, name: string): CurriedFn2<P1, T, R>

        invoker<T, P1, P2, R>(len: number /* = 2 */, name: string, x1: P1, x2: P2, obj: T): R
        invoker<T, P1, P2, R>(len: number /* = 2 */, name: string): CurriedFn3<P1, P2, T, R>

        invoker<T, P1, P2, P3, R>(len: number /* = 3 */, name: string, x1: P1, x2: P2, x3: P3, obj: T): R
        invoker<T, P1, P2, P3, R>(len: number /* = 3 */, name: string): CurriedFn4<P1, P2, P3, T, R>

        invoker<T, P1, P2, P3, P4, R>(len: number /* = 4 */, name: string, x1: P1, x2: P2, x3: P3, x4: P4, obj: T): R
        invoker<T, P1, P2, P3, P4, R>(len: number /* = 4 */, name: string): CurriedFn5<P1, P2, P3, P4, T, R>

        invoker<T, P1, P2, P3, P4, P5, R>(len: number /* = 5 */, name: string, x1: P1, x2: P2, x3: P3, x4: P4, x5: P5, obj: T): R
        invoker<T, P1, P2, P3, P4, P5, R>(len: number /* = 5 */, name: string): CurriedFn6<P1, P2, P3, P4, P5, T, R>

        /**
         * See if an object (`val`) is an instance of the supplied constructor.
         * This function will check up the inheritance chain, if any.
         */
        is<T>(ctor: Type<T>, val: any): val is T;
        is<T>(ctor: Type<T>): (val: any) => val is T;
        // is<T>: CurriedFn2<T, any, val is T>; // um, val undefined

        /**
         * Tests whether or not an object is similar to an array.
         */
        isArrayLike(val: any): boolean;

        /**
         * Reports whether the list has zero elements.
         */
        isEmpty(value: any): boolean;


        /**
         * Returns true if the input value is NaN.
         */
        isNaN(x: any): boolean;

        /**
         * Checks if the input value is null or undefined.
         */
        isNil(value: any): boolean;

        /**
         * Returns a string made by inserting the `separator` between each
         * element and concatenating all the elements into a single string.
         */
        join(x: string, xs: any[]): string;
        join(x: string): (xs: any[]) => string;
        // join: CurriedFn2<string, any[], string>;

        /**
         * Applies a list of functions to a list of values.
         */
        juxt<T,U>(fns: {(...args: T[]): U}[]): (...args: T[]) => U[];


        /**
         * Returns a list containing the names of all the enumerable own
         * properties of the supplied object.
         */
        keys<T>(x: T): string[];

        /**
         * Returns a list containing the names of all the
         * properties of the supplied object, including prototype properties.
         */
        keysIn<T>(obj: T): string[];

        /**
         * Returns the last element from a list.
         */
        last<T>(list: T[]): T;
        last(list: string): string;

        /**
         * Returns the position of the last occurrence of an item (by strict equality) in
         * an array, or -1 if the item is not included in the array.
         */
        lastIndexOf<T>(target: T, list: T[]): number;
        lastIndexOf<T>(target: T): (list: T[]) => number;
        // lastIndexOf<T>: CurriedFn2<T, T[], number>;

        /**
         * Returns the number of elements in the array by returning list.length.
         */
        length(list: any[]): number;

        /**
         * Returns a lens for the given getter and setter functions. The getter
         * "gets" the value of the focus; the setter "sets" the value of the focus.
         * The setter should not mutate the data structure.
         */
        lens<T,U,V>(getter: (s: T) => U, setter: (a: U, s: T) => V): Lens<T,U>;
        // lens<T,U,V>: CurriedFn2<(s: T) => U, (a: U, s: T) => V, Lens<T,U>>;

        /**
         * Creates a lens that will focus on index n of the source array.
         */
        lensIndex(n: number): UnknownLens;

        /**
         * Returns a lens whose focus is the specified path.
         * See also view, set, over.
         */
        lensPath(path: string[]): UnknownLens;

        /**
         * lensProp creates a lens that will focus on property k of the source object.
         */
        lensProp(str: string): UnknownLens;

        /**
         * "lifts" a function of arity > 1 so that it may "map over" a list, Function or other object that satisfies
         * the FantasyLand Apply spec.
         */
        lift<T>(fn: (...args: any[]) => T, ...argLists: any[][]): T[];
        lift<T>(fn: (...args: any[]) => T): (...argLists: any[][]) => T[];
        // lift<T>: CurriedFn2<(...args: any[]) => T, ...any[][], T[]>; // uh-oh, spread

        /**
         * "lifts" a function to be the specified arity, so that it may "map over" that many lists, Functions or other
         * objects that satisfy the FantasyLand Apply spec.
         */
        liftN<T>(n: number, fn: (...args: any[]) => T, ...argLists: any[][]): T[];
        liftN<T>(n: number, fn: (...args: any[]) => T): (...argLists: any[][]) => T[];
        liftN<T>(n: number): (fn: (...args: any[]) => T, ...argLists: any[][]) => T[];
        liftN<T>(n: number): (fn: (...args: any[]) => T) => (...argLists: any[][]) => T[];
        // liftN<T>: CurriedFn3<number, (...args: any[]) => T, ...any[][], T[]>; // uh-oh, spread


        /**
         * Returns true if the first parameter is less than the second.
         */
        lt(a: number, b: number): boolean;
        lt(a: number): (b: number) => boolean;
        // lt: CurriedFn2<number, number, boolean>;

        /**
         * Returns true if the first parameter is less than or equal to the second.
         */
        lte(a: number, b: number): boolean;
        lte(a: number): (b: number) => boolean;
        // lte: CurriedFn2<number, number, boolean>;

        /**
         * Returns a new list, constructed by applying the supplied function to every element of the supplied list.
         */
        map<T, U>(fn: (x: T) => U, list: T[]): U[];
        map<T, U>(fn: (x: T) => U): (list: T[]) => U[];
        // map<T, U>: CurriedFn2<(x: T) => U, T[], U[]>;
        map<T, V, M extends {[k: string]: T}>(fn: (value: T) => V, obj: M): {[K in keyof M]: V};
        map<T, V, M extends {[k: string]: T}>(fn: (value: T) => V): (obj: M) => {[K in keyof M]: V};
        // map<T, V, M extends {[k: string]: T}>: CurriedFn2<(value: T) => V, M, {[K in keyof M]: V}>;
        map<T, U>(fn: (x: T) => U, obj: Functor<T>): Functor<U>; // used in functors
        // map<T, U>: CurriedFn2<(x: T) => U, Functor<T>, Functor<U>>; // used in functors
        // separating values: https://github.com/Microsoft/TypeScript/issues/12342
        // map<A,B,T,U>(fn: (a: A) => B, tpl: [T,U]): [ typeof fn(T), typeof fn(U) ];
        // obj. version?

        /**
         * The mapAccum function behaves like a combination of map and reduce.
         */
        mapAccum<T, U, TResult>(fn: (acc: U, value: T) => [U, TResult], acc: U, list: T[]): [U, TResult[]];
        mapAccum<T, U, TResult>(fn: (acc: U, value: T) => [U, TResult], acc: U): (list: T[]) => [U, TResult[]];
        mapAccum<T, U, TResult>(fn: (acc: U, value: T) => [U, TResult]): CurriedFn2<U,T[],TResult[]>;
        // mapAccum<T, U, TResult>: CurriedFn3<(acc: U, value: T) => [U, TResult], U, T[], [U, TResult[]]>;

        /**
         * The mapAccumRight function behaves like a combination of map and reduce.
         */
        mapAccumRight<T, U, TResult>(fn: (acc: U, value: T) => [U, TResult], acc: U, list: T[]): [U, TResult[]];
        mapAccumRight<T, U, TResult>(fn: (acc: U, value: T) => [U, TResult], acc: U): (list: T[]) => [U, TResult[]];
        mapAccumRight<T, U, TResult>(fn: (acc: U, value: T) => [U, TResult]): CurriedFn2<U,T[],TResult[]>;
        // mapAccumRight<T, U, TResult>: CurriedFn3<(acc: U, value: T) => [U, TResult], U, T[], [U, TResult[]]>;

        /**
         * Like map, but but passes additional parameters to the mapping function.
         */
        mapIndexed<T, U>(fn: (val: T, key: number, list: T[]) => U, list: T[]): U[];
        mapIndexed<T, U>(fn: (val: T, key: number, list: T[]) => U): (list: T[]) => U[];
        // mapIndexed<T, U>: CurriedFn2<(val: T, key: number, list: T[]) => U, T[], U[]>;


        /**
         * Like mapObj, but but passes additional arguments to the predicate function.
         */
        mapObjIndexed<T, V, M extends {[k: string]: T}>(fn: (value: T, key: string, obj?: M) => V, obj: M): {[K in keyof M]: V};
        mapObjIndexed<T, V, M extends {[k: string]: T}>(fn: (value: T, key: string, obj?: M) => V): (obj: M) => {[K in keyof M]: V};
        // mapObjIndexed<T, V, M extends {[k: string]: T}>: CurriedFn2<(value: T, key: string, obj?: M) => V, M, {[K in keyof M]: V}>;

        /**
         * Tests a regular expression agains a String
         */
        match(regexp: RegExp, str: string): string[];
        match(regexp: RegExp): (str: string) => string[];
        // match: CurriedFn2<RegExp, string, string[]>;


        /**
         * mathMod behaves like the modulo operator should mathematically, unlike the `%`
         * operator (and by extension, R.modulo). So while "-17 % 5" is -2,
         * mathMod(-17, 5) is 3. mathMod requires Integer arguments, and returns NaN
         * when the modulus is zero or negative.
         */
        // |NaN? what's its type?
        mathMod(a: number, b: number): number;
        mathMod(a: number): (b: number) => number;
        // mathMod: CurriedFn2<number, number, number>;


        /**
         * Returns the larger of its two arguments.
         */
        max(a: Ord, b: Ord): Ord;
        max(a: Ord): (b: Ord) => Ord;
        // max: CurriedFn2<Ord, Ord, Ord>;

        /**
         * Takes a function and two values, and returns whichever value produces
         * the larger result when passed to the provided function.
         */
        maxBy<T>(keyFn: (a: T) => Ord, a: T, b: T): T;
        maxBy<T>(keyFn: (a: T) => Ord): CurriedFn2<T, T, T>
        // maxBy<T>: CurriedFn3<(a: T) => Ord, T, T, T>;

        /**
         * Returns the mean of the given list of numbers.
         */
        mean(list: number[]): number;

        /**
         * Returns the median of the given list of numbers.
         */
        median(list: number[]): number;

        /**
         * Creates a new function that, when invoked, caches the result of calling fn for a given argument set and
         * returns the result. Subsequent calls to the memoized fn with the same argument set will not result in an
         * additional call to fn; instead, the cached result for that set of arguments will be returned.
         */
        memoize<T>(fn: (...args: any[]) => T): (...args: any[]) => T;

        /**
         * Create a new object with the own properties of a
         * merged with the own properties of object b.
         * This function will *not* mutate passed-in objects.
         */
        merge<T1, T2>(a: T1, b: T2): T1 & T2;
        merge<T1>(a: T1): <T2>(b: T2) => T1 & T2;
        // merge<T1, T2>: CurriedFn2<T1, T2, T1 & T2>;


        /**
         * Merges a list of objects together into one object.
         */
        mergeAll<T>(list: any[]): T;

        /**
         * Creates a new object with the own properties of the two provided objects. If a key exists in both objects,
         * the provided function is applied to the values associated with the key in each object, with the result being used as
         * the value associated with the key in the returned object. The key will be excluded from the returned object if the
         * resulting value is undefined.
         */
        mergeWith<U,V>(fn: (x: any, z: any) => any, a: U, b: V): U & V;
        mergeWith<U>(fn: (x: any, z: any) => any, a: U): <V>(b: V) => U & V;
        mergeWith(fn: (x: any, z: any) => any): <U,V>(a: U, b: V) => U & V;
        mergeWith<U,V>(fn: (x: any, z: any) => any): CurriedFn2<U,V,U&V>;
        // mergeWith<U,V>: CurriedFn3<(x: any, z: any) => any, U, V, U & V>;

        /**
         * Creates a new object with the own properties of the two provided objects. If a key exists in both objects,
         * the provided function is applied to the key and the values associated with the key in each object, with the
         * result being used as the value associated with the key in the returned object. The key will be excluded from
         * the returned object if the resulting value is undefined.
         */
        mergeWithKey<U,V>(fn: (str: string, x: any, z: any) => any, a: U, b: V): U & V;
        mergeWithKey<U>(fn: (str: string, x: any, z: any) => any, a: U): <V>(b: V) => U & V;
        mergeWithKey(fn: (str: string, x: any, z: any) => any): <U,V>(a: U, b: V) => U & V;
        mergeWithKey<U,V>(fn: (str: string, x: any, z: any) => any): CurriedFn2<U,V,U&V>;
        // mergeWithKey<U,V>: CurriedFn3<(str: string, x: any, z: any) => any, U, V, U & V>;

        /**
         * Returns the smaller of its two arguments.
         */
        min(a: Ord, b: Ord): Ord;
        min(a: Ord): (b: Ord) => Ord;
        // min: CurriedFn2<Ord, Ord, Ord>;

        /**
         * Takes a function and two values, and returns whichever value produces
         * the smaller result when passed to the provided function.
         */
        minBy<T>(keyFn: (a: T) => Ord, a: T, b: T): T;
        minBy<T>(keyFn: (a: T) => Ord): CurriedFn2<T, T, T>
        // minBy<T>: CurriedFn3<(a: T) => Ord, T, T, T>;

        /**
         * Divides the second parameter by the first and returns the remainder.
         * The flipped version (`moduloBy`) may be more useful curried.
         * Note that this functions preserves the JavaScript-style behavior for
         * modulo. For mathematical modulo see `mathMod`
         */
        modulo(a: number, b: number): number;
        modulo(a: number): (b: number) => number;
        // modulo: CurriedFn2<number, number, number>;

        /**
         * Multiplies two numbers. Equivalent to a * b but curried.
         */
        multiply(a: number, b: number): number;
        multiply(a: number): (b: number) => number;
        // multiply: CurriedFn2<number, number, number>;


        /**
         * Wraps a function of any arity (including nullary) in a function that accepts exactly n parameters.
         * Any extraneous parameters will not be passed to the supplied function.
         */
        nAry<T>(n: number, fn: (...arg: any[]) => T): (...arg: any[]) => T;
        nAry<T>(n: number): (fn: (...arg: any[]) => T) => (...arg: any[]) => T;
        // nAry<T>: CurriedFn2<number, (...arg: any[]) => T, (...arg: any[]) => T>;

        /**
         * Negates its argument.
         */
        negate(n: number): number;


        /**
         * Returns true if no elements of the list match the predicate, false otherwise.
         */
        none<T>(fn: (a: T) => boolean, list: T[]): boolean;
        none<T>(fn: (a: T) => boolean): (list: T[]) => boolean;
        // none<T>: CurriedFn2<(a: T) => boolean, T[], boolean>;


        /**
         * A function wrapping a call to the given function in a `!` operation.  It will return `true` when the
         * underlying function would return a false-y value, and `false` when it would return a truth-y one.
         */
        not(value: any): boolean;

        /**
         * Returns the nth element in a list.
         */
        nth<T>(n: number, list: T[]): T;
        nth(n: number): <T>(list: T[]) => T;
        // nth<T>: CurriedFn2<number, T[], T>;

        /**
         * Returns a function which returns its nth argument.
         */
        nthArg(n: number): <T>(...a: T[]) => T;

        /**
         * Creates an object containing a single key:value pair.
         */
        // how to type this such as to keep the key intact?
        objOf<T>(key: string, value: T): Dictionary<T>;
        objOf(key: string): <T>(value: T) => Dictionary<T>;
        // objOf<T>: CurriedFn2<string, T, Dictionary<T>>;

        /**
         * Returns a singleton array containing the value provided.
         */
        of<T>(x: T): T[];

        /**
         * Returns a partial copy of an object omitting the keys specified.
         */
        omit<T>(names: string[], obj: T): T;
        omit(names: string[]): <T>(obj: T) => T;
        // omit<T>: CurriedFn2<string[], T, T>;

        /**
         * Accepts a function fn and returns a function that guards invocation of fn such that fn can only ever be
         * called once, no matter how many times the returned function is invoked. The first value calculated is
         * returned in subsequent invocations.
         */
        once<T>(fn: (...args: any[]) => T): (...args: any[]) => T;

        /**
         * A function that returns the first truthy of two arguments otherwise the last argument. Note that this is
         * NOT short-circuited, meaning that if expressions are passed they are both evaluated.
         * Dispatches to the or method of the first argument if applicable.
         */
        or<T, U>(a: T, b: U): T|U;
        or<T>(a: T): <U>(b: U) => T|U;
        // or<T, U>: CurriedFn2<T, U, T|U>;
        // dispatch to some `or` method:
        or<T extends {or?: (alt: U) => T|U;}, U>(fn1: T, val2: U): T|U;
        or<T extends {or?: (alt: U) => T|U;},U>(fn1: T): (val2: U) => T|U;
        // or<T extends {or?: (alt: U) => T|U;}, U>: CurriedFn2<T, U, T|U>;

        /**
         * Returns the result of "setting" the portion of the given data structure
         * focused by the given lens to the given value.
         */
        over<T,V>(lens: Lens<T,V>, fn: (v: V) => V, value: T): T;
        over<T,V>(lens: UnknownLens, fn: (v: V) => V, value: T): T;
        over<V>(lens: UnknownLens, fn: (v: V) => V): <T>(value: T) => T;
        over(lens: UnknownLens): <T,V>(fn: (v: V) => V, value: T) => T;
        over<T,V>(lens: UnknownLens): CurriedFn2<(v: V) => V, T, T>;
        // over<T,V>: CurriedFn3<Lens<T,V>, (v: V) => V, T, T>;
        // Functor version:
        over<T,V>(lens: Lens<T,V>, fn: (v: V) => V, value: Functor<T>): Functor<T>;
        over<V>(lens: UnknownLens, fn: (v: V) => V): <T>(value: Functor<T>) => Functor<T>;
        over<T,V>(lens: UnknownLens): CurriedFn2<(v: V) => V, Functor<T>, Functor<T>>;
        over(lens: UnknownLens): <T,V>(fn: (v: V) => V, value: Functor<T>) => Functor<T>;
        // over<T,V>: CurriedFn3<Lens<T,V>, (v: V) => V, Functor<T>, Functor<T>>;
        // Functor version applied to array:
        over<T,V>(lens: Lens<T,V>, fn: (v: V) => V, value: T[]): T[];
        over<V>(lens: UnknownLens, fn: (v: V) => V): <T>(value: T[]) => T[];
        over<T,V>(lens: UnknownLens): CurriedFn2<(v: V) => V, T[], T[]>;
        over(lens: UnknownLens): <T,V>(fn: (v: V) => V, value: T[]) => T[];
        // over<T,V>: CurriedFn3<Lens<T,V>, (v: V) => V, T[], T[]>;


        /**
         * Takes two arguments, fst and snd, and returns [fst, snd].
         */
        pair<F,S>(fst: F, snd: S): [F, S];
        pair<F>(fst: F): <S>(snd: S) => [F, S];
        // pair<F,S>: CurriedFn2<F, S, [F, S]>;

        /**
         * Accepts as its arguments a function and any number of values and returns a function that,
         * when invoked, calls the original function with all of the values prepended to the
         * original function's arguments list. In some libraries this function is named `applyLeft`.
         */
        partial<T>(fn: (...args: any[]) => T, ...args: any[]): (...args: any[]) => T;
        partial<T>(fn: (...args: any[]) => T): (...args: any[]) => (...args: any[]) => T;
        // partial<T>: CurriedFn2<(...args: any[]) => T, ...args: any[], (...args: any[]) => T>; // uh-oh, spread

        /**
         * Accepts as its arguments a function and any number of values and returns a function that,
         * when invoked, calls the original function with all of the values appended to the original
         * function's arguments list.
         */
        partialRight<T>(fn: (...args: any[]) => T, ...args: any[]): (...args: any[]) => T;
        partialRight<T>(fn: (...args: any[]) => T): (...args: any[]) => (...args: any[]) => T;
        // partialRight<T>: CurriedFn2<(...args: any[]) => T, ...args: any[], (...args: any[]) => T>; // uh-oh, spread

        /**
         * Takes a predicate and a list and returns the pair of lists of elements
         * which do and do not satisfy the predicate, respectively.
         */
        // arrays
        partition<T>(fn: (a: T) => boolean, list: T[]): [T[], T[]];
        partition<T>(fn: (a: T) => boolean): (list: T[]) => [T[], T[]];
        // partition<T>: CurriedFn2<(a: T) => boolean, T[], [T[], T[]]>;
        // objects
        partition<T extends Dictionary<V>,U extends Dictionary<V>,V>(fn: (a: V) => boolean, obj: T & U) : [T,U];
        // partition<T extends Dictionary<V>,U extends Dictionary<V>,V>: CurriedFn2<(a: T) => boolean, obj: T & U, [T,U]>;
        // objects, alternative notation
        partition<T, U extends Dictionary<T>>(fn: (a: T) => boolean, obj: U) : [Partial<U>,Partial<U>];
        // partition<T, U extends Dictionary<T>>: CurriedFn2<(a: T) => boolean, U, [Partial<U>,Partial<U>]>;

        /**
         * Retrieve the value at a given path.
         */
        path<T>(path: Path, obj: Struct<any>): T;
        path(path: Path): <T>(obj: Struct<any>) => T;
        // path<T>: CurriedFn2<Path, Struct<any>, T>;
        // failed attempt at proper typing, see https://github.com/Microsoft/TypeScript/issues/12393 :
        // path<U, K1 extends keyof T, K2 extends keyof T[K1], T extends { [K1]: { [K2]: U } }>(keys: [K1, K2], obj: T): U;

        /**
        * Determines whether a nested path on an object has a specific value,
        * in `R.equals` terms. Most likely used to filter a list.
        */
        pathEq(path: Path, val: any, obj: Struct<any>): boolean;
        pathEq(path: Path, val: any): (obj: Struct<any>) => boolean;
        pathEq(path: Path): CurriedFn2<any, Struct<any>, boolean>;
        // pathEq: CurriedFn3<Path, any, Struct<any>, boolean>;

        /**
         * If the given, non-null object has a value at the given path, returns the value at that path.
         * Otherwise returns the provided default value.
         */
        pathOr<T>(d: T, p: Path, obj: Struct<any>): T|any;
        pathOr<T>(d: T, p: Path): (obj: Struct<any>) => T|any;
        pathOr<T>(d: T): CurriedFn2<Path, Struct<any>, T|any>;
        // pathOr<T>(d: T, p: Path): (obj: Struct<any>) => T|any;
        // pathOr<T>(d: T): (p: Path, obj: Struct<any>) => T|any;
        // pathOr<T>: CurriedFn3<T, Path, Struct<any>, T|any>;

        /**
         * Returns `true` if the specified object property at given path satisfies the given predicate; `false`
         * otherwise.
         */
        pathSatisfies<T>(fn: Pred<T>, p: Path, obj: any): boolean;
        pathSatisfies<T>(fn: Pred<T>, p: Path): (obj: any) => boolean;
        pathSatisfies<T>(fn: Pred<T>): CurriedFn2<Path, any, boolean>;
        // pathSatisfies<T>: CurriedFn3<Pred<T>, Path, any, boolean>;

        /**
         * Returns a partial copy of an object containing only the keys specified.  If the key does not exist, the
         * property is ignored.
         */
        pick<T, K extends keyof T>(names: K[], obj: T): Pick<T, K>;
        pick<T, K extends keyof T>(names: K[]): (obj: T) => Pick<T, K>;
        // pick<T, K extends keyof T>: CurriedFn2<K[], T, Pick<T, K>>;


        /**
         * Similar to `pick` except that this one includes a `key: undefined` pair for properties that don't exist.
         */
        pickAll<T, K /*extends keyof T*/>(names: K[], obj: T): Partial<T>;
        pickAll<T, K /*extends keyof T*/>(names: K[]): (obj: T) => Partial<T>;
        // pickAll<T, K /*extends keyof T*/>: CurriedFn2<K[], T, Partial<T>>;


        /**
         * Returns a partial copy of an object containing only the keys that satisfy the supplied predicate.
         */
        pickBy<T>(pred: ObjPred<any>, obj: T): Partial<T>;
        pickBy(pred: ObjPred<any>): <T>(obj: T) => Partial<T>;
        // pickBy<T>: CurriedFn2<ObjPred<any>, T, Partial<T>>;


        /**
         * Performs left-to-right function composition.
         * The leftmost function may have any arity; the remaining functions must be unary.
         * In some libraries this function is named sequence.
         * Note: The result of pipe is not automatically curried.
         */
        pipe<V0, T1>(fn0: (x0: V0) => T1): CurriedFn1<V0, T1>;
        pipe<V0, V1, T1>(fn0: (x0: V0, x1: V1) => T1): CurriedFn2<V0, V1, T1>;
        pipe<V0, V1, V2, T1>(fn0: (x0: V0, x1: V1, x2: V2) => T1): CurriedFn3<V0, V1, V2, T1>;
        pipe<V0, V1, V2, V3, T1>(fn0: (x0: V0, x1: V1, x2: V2, x3: V3) => T1): CurriedFn4<V0, V1, V2, V3, T1>;
        pipe<V0, T1, T2>(fn0: (x0: V0) => T1, fn1: (x: T1) => T2): CurriedFn1<V0, T2>;
        pipe<V0, V1, T1, T2>(fn0: (x0: V0, x1: V1) => T1, fn1: (x: T1) => T2): CurriedFn2<V0, V1, T2>;
        pipe<V0, V1, V2, T1, T2>(fn0: (x0: V0, x1: V1, x2: V2) => T1, fn1: (x: T1) => T2): CurriedFn3<V0, V1, V2, T2>;
        pipe<V0, V1, V2, V3, T1, T2>(fn0: (x0: V0, x1: V1, x2: V2, x3: V3) => T1, fn1: (x: T1) => T2): CurriedFn4<V0, V1, V2, V3, T2>;
        pipe<V0, T1, T2, T3>(fn0: (x0: V0) => T1, fn1: (x: T1) => T2, fn2: (x: T2) => T3): CurriedFn1<V0, T3>;
        pipe<V0, V1, T1, T2, T3>(fn0: (x0: V0, x1: V1) => T1, fn1: (x: T1) => T2, fn2: (x: T2) => T3): CurriedFn2<V0, V1, T3>;
        pipe<V0, V1, V2, T1, T2, T3>(fn0: (x0: V0, x1: V1, x2: V2) => T1, fn1: (x: T1) => T2, fn2: (x: T2) => T3): CurriedFn3<V0, V1, V2, T3>;
        pipe<V0, V1, V2, V3, T1, T2, T3>(fn0: (x0: V0, x1: V1, x2: V2, x3: V3) => T1, fn1: (x: T1) => T2, fn2: (x: T2) => T3): CurriedFn4<V0, V1, V2, V3, T3>;
        pipe<V0, T1, T2, T3, T4>(fn0: (x0: V0) => T1, fn1: (x: T1) => T2, fn2: (x: T2) => T3, fn3: (x: T3) => T4): CurriedFn1<V0, T4>;
        pipe<V0, V1, T1, T2, T3, T4>(fn0: (x0: V0, x1: V1) => T1, fn1: (x: T1) => T2, fn2: (x: T2) => T3, fn3: (x: T3) => T4): CurriedFn2<V0, V1, T4>;
        pipe<V0, V1, V2, T1, T2, T3, T4>(fn0: (x0: V0, x1: V1, x2: V2) => T1, fn1: (x: T1) => T2, fn2: (x: T2) => T3, fn3: (x: T3) => T4): CurriedFn3<V0, V1, V2, T4>;
        pipe<V0, V1, V2, V3, T1, T2, T3, T4>(fn0: (x0: V0, x1: V1, x2: V2, x3: V3) => T1, fn1: (x: T1) => T2, fn2: (x: T2) => T3, fn3: (x: T3) => T4): CurriedFn4<V0, V1, V2, V3, T4>;
        pipe<V0, T1, T2, T3, T4, T5>(fn0: (x0: V0) => T1, fn1: (x: T1) => T2, fn2: (x: T2) => T3, fn3: (x: T3) => T4, fn4: (x: T4) => T5): CurriedFn1<V0, T5>;
        pipe<V0, V1, T1, T2, T3, T4, T5>(fn0: (x0: V0, x1: V1) => T1, fn1: (x: T1) => T2, fn2: (x: T2) => T3, fn3: (x: T3) => T4, fn4: (x: T4) => T5): CurriedFn2<V0, V1, T5>;
        pipe<V0, V1, V2, T1, T2, T3, T4, T5>(fn0: (x0: V0, x1: V1, x2: V2) => T1, fn1: (x: T1) => T2, fn2: (x: T2) => T3, fn3: (x: T3) => T4, fn4: (x: T4) => T5): CurriedFn3<V0, V1, V2, T5>;
        pipe<V0, V1, V2, V3, T1, T2, T3, T4, T5>(fn0: (x0: V0, x1: V1, x2: V2, x3: V3) => T1, fn1: (x: T1) => T2, fn2: (x: T2) => T3, fn3: (x: T3) => T4, fn4: (x: T4) => T5): CurriedFn4<V0, V1, V2, V3, T5>;
        pipe<V0, T1, T2, T3, T4, T5, T6>(fn0: (x0: V0) => T1, fn1: (x: T1) => T2, fn2: (x: T2) => T3, fn3: (x: T3) => T4, fn4: (x: T4) => T5, fn5: (x: T5) => T6): CurriedFn1<V0, T6>;
        pipe<V0, V1, T1, T2, T3, T4, T5, T6>(fn0: (x0: V0, x1: V1) => T1, fn1: (x: T1) => T2, fn2: (x: T2) => T3, fn3: (x: T3) => T4, fn4: (x: T4) => T5, fn5: (x: T5) => T6): CurriedFn2<V0, V1, T6>;
        pipe<V0, V1, V2, T1, T2, T3, T4, T5, T6>(fn0: (x0: V0, x1: V1, x2: V2) => T1, fn1: (x: T1) => T2, fn2: (x: T2) => T3, fn3: (x: T3) => T4, fn4: (x: T4) => T5, fn5: (x: T5) => T6): CurriedFn3<V0, V1, V2, T6>;
        pipe<V0, V1, V2, V3, T1, T2, T3, T4, T5, T6>(fn0: (x0: V0, x1: V1, x2: V2, x3: V3) => T1, fn1: (x: T1) => T2, fn2: (x: T2) => T3, fn3: (x: T3) => T4, fn4: (x: T4) => T5, fn5: (x: T5) => T6): CurriedFn4<V0, V1, V2, V3, T6>;
        pipe<V0, T1, T2, T3, T4, T5, T6, T7>(fn0: (x0: V0) => T1, fn1: (x: T1) => T2, fn2: (x: T2) => T3, fn3: (x: T3) => T4, fn4: (x: T4) => T5, fn5: (x: T5) => T6, fn6: (x: T6) => T7): CurriedFn1<V0, T7>;
        pipe<V0, V1, T1, T2, T3, T4, T5, T6, T7>(fn0: (x0: V0, x1: V1) => T1, fn1: (x: T1) => T2, fn2: (x: T2) => T3, fn3: (x: T3) => T4, fn4: (x: T4) => T5, fn5: (x: T5) => T6, fn6: (x: T6) => T7): CurriedFn2<V0, V1, T7>;
        pipe<V0, V1, V2, T1, T2, T3, T4, T5, T6, T7>(fn0: (x0: V0, x1: V1, x2: V2) => T1, fn1: (x: T1) => T2, fn2: (x: T2) => T3, fn3: (x: T3) => T4, fn4: (x: T4) => T5, fn5: (x: T5) => T6, fn6: (x: T6) => T7): CurriedFn3<V0, V1, V2, T7>;
        pipe<V0, V1, V2, V3, T1, T2, T3, T4, T5, T6, T7>(fn0: (x0: V0, x1: V1, x2: V2, x3: V3) => T1, fn1: (x: T1) => T2, fn2: (x: T2) => T3, fn3: (x: T3) => T4, fn4: (x: T4) => T5, fn5: (x: T5) => T6, fn6: (x: T6) => T7): CurriedFn4<V0, V1, V2, V3, T7>;
        pipe<V0, T1, T2, T3, T4, T5, T6, T7, T8>(fn0: (x0: V0) => T1, fn1: (x: T1) => T2, fn2: (x: T2) => T3, fn3: (x: T3) => T4, fn4: (x: T4) => T5, fn5: (x: T5) => T6, fn6: (x: T6) => T7, fn7: (x: T7) => T8): CurriedFn1<V0, T8>;
        pipe<V0, V1, T1, T2, T3, T4, T5, T6, T7, T8>(fn0: (x0: V0, x1: V1) => T1, fn1: (x: T1) => T2, fn2: (x: T2) => T3, fn3: (x: T3) => T4, fn4: (x: T4) => T5, fn5: (x: T5) => T6, fn6: (x: T6) => T7, fn7: (x: T7) => T8): CurriedFn2<V0, V1, T8>;
        pipe<V0, V1, V2, T1, T2, T3, T4, T5, T6, T7, T8>(fn0: (x0: V0, x1: V1, x2: V2) => T1, fn1: (x: T1) => T2, fn2: (x: T2) => T3, fn3: (x: T3) => T4, fn4: (x: T4) => T5, fn5: (x: T5) => T6, fn6: (x: T6) => T7, fn7: (x: T7) => T8): CurriedFn3<V0, V1, V2, T8>;
        pipe<V0, V1, V2, V3, T1, T2, T3, T4, T5, T6, T7, T8>(fn0: (x0: V0, x1: V1, x2: V2, x3: V3) => T1, fn1: (x: T1) => T2, fn2: (x: T2) => T3, fn3: (x: T3) => T4, fn4: (x: T4) => T5, fn5: (x: T5) => T6, fn6: (x: T6) => T7, fn7: (x: T7) => T8): CurriedFn4<V0, V1, V2, V3, T8>;
        pipe<V0, T1, T2, T3, T4, T5, T6, T7, T8, T9>(fn0: (x0: V0) => T1, fn1: (x: T1) => T2, fn2: (x: T2) => T3, fn3: (x: T3) => T4, fn4: (x: T4) => T5, fn5: (x: T5) => T6, fn6: (x: T6) => T7, fn7: (x: T7) => T8, fn8: (x: T8) => T9): CurriedFn1<V0, T9>;
        pipe<V0, V1, T1, T2, T3, T4, T5, T6, T7, T8, T9>(fn0: (x0: V0, x1: V1) => T1, fn1: (x: T1) => T2, fn2: (x: T2) => T3, fn3: (x: T3) => T4, fn4: (x: T4) => T5, fn5: (x: T5) => T6, fn6: (x: T6) => T7, fn7: (x: T7) => T8, fn8: (x: T8) => T9): CurriedFn2<V0, V1, T9>;
        pipe<V0, V1, V2, T1, T2, T3, T4, T5, T6, T7, T8, T9>(fn0: (x0: V0, x1: V1, x2: V2) => T1, fn1: (x: T1) => T2, fn2: (x: T2) => T3, fn3: (x: T3) => T4, fn4: (x: T4) => T5, fn5: (x: T5) => T6, fn6: (x: T6) => T7, fn7: (x: T7) => T8, fn8: (x: T8) => T9): CurriedFn3<V0, V1, V2, T9>;
        pipe<V0, V1, V2, V3, T1, T2, T3, T4, T5, T6, T7, T8, T9>(fn0: (x0: V0, x1: V1, x2: V2, x3: V3) => T1, fn1: (x: T1) => T2, fn2: (x: T2) => T3, fn3: (x: T3) => T4, fn4: (x: T4) => T5, fn5: (x: T5) => T6, fn6: (x: T6) => T7, fn7: (x: T7) => T8, fn8: (x: T8) => T9): CurriedFn4<V0, V1, V2, V3, T9>;

        /**
         * Performs left-to-right composition of one or more Promise-returning functions. The leftmost function may have any arity; the remaining functions must be unary.
         */
        pipeP<V0, T1>(fn0: (x0: V0) => Promise<T1>): CurriedFn1<V0, Promise<T1>>;
        pipeP<V0, V1, T1>(fn0: (x0: V0, x1: V1) => Promise<T1>): CurriedFn2<V0, V1, Promise<T1>>;
        pipeP<V0, V1, V2, T1>(fn0: (x0: V0, x1: V1, x2: V2) => Promise<T1>): CurriedFn3<V0, V1, V2, Promise<T1>>;
        pipeP<V0, V1, V2, V3, T1>(fn0: (x0: V0, x1: V1, x2: V2, x3: V3) => Promise<T1>): CurriedFn4<V0, V1, V2, V3, Promise<T1>>;
        pipeP<V0, T1, T2>(fn0: (x0: V0) => Promise<T1>, fn1: (x: T1) => Promise<T2>|T2): CurriedFn1<V0, Promise<T2>>;
        pipeP<V0, V1, T1, T2>(fn0: (x0: V0, x1: V1) => Promise<T1>, fn1: (x: T1) => Promise<T2>|T2): CurriedFn2<V0, V1, Promise<T2>>;
        pipeP<V0, V1, V2, T1, T2>(fn0: (x0: V0, x1: V1, x2: V2) => Promise<T1>, fn1: (x: T1) => Promise<T2>|T2): CurriedFn3<V0, V1, V2, Promise<T2>>;
        pipeP<V0, V1, V2, V3, T1, T2>(fn0: (x0: V0, x1: V1, x2: V2, x3: V3) => Promise<T1>, fn1: (x: T1) => Promise<T2>|T2): CurriedFn4<V0, V1, V2, V3, Promise<T2>>;
        pipeP<V0, T1, T2, T3>(fn0: (x0: V0) => Promise<T1>, fn1: (x: T1) => Promise<T2>|T2, fn2: (x: T2) => Promise<T3>|T3): CurriedFn1<V0, Promise<T3>>;
        pipeP<V0, V1, T1, T2, T3>(fn0: (x0: V0, x1: V1) => Promise<T1>, fn1: (x: T1) => Promise<T2>|T2, fn2: (x: T2) => Promise<T3>|T3): CurriedFn2<V0, V1, Promise<T3>>;
        pipeP<V0, V1, V2, T1, T2, T3>(fn0: (x0: V0, x1: V1, x2: V2) => Promise<T1>, fn1: (x: T1) => Promise<T2>|T2, fn2: (x: T2) => Promise<T3>|T3): CurriedFn3<V0, V1, V2, Promise<T3>>;
        pipeP<V0, V1, V2, V3, T1, T2, T3>(fn0: (x0: V0, x1: V1, x2: V2, x3: V3) => Promise<T1>, fn1: (x: T1) => Promise<T2>|T2, fn2: (x: T2) => Promise<T3>|T3): CurriedFn4<V0, V1, V2, V3, Promise<T3>>;
        pipeP<V0, T1, T2, T3, T4>(fn0: (x0: V0) => Promise<T1>, fn1: (x: T1) => Promise<T2>|T2, fn2: (x: T2) => Promise<T3>|T3, fn3: (x: T3) => Promise<T4>|T4): CurriedFn1<V0, Promise<T4>>;
        pipeP<V0, V1, T1, T2, T3, T4>(fn0: (x0: V0, x1: V1) => Promise<T1>, fn1: (x: T1) => Promise<T2>|T2, fn2: (x: T2) => Promise<T3>|T3, fn3: (x: T3) => Promise<T4>|T4): CurriedFn2<V0, V1, Promise<T4>>;
        pipeP<V0, V1, V2, T1, T2, T3, T4>(fn0: (x0: V0, x1: V1, x2: V2) => Promise<T1>, fn1: (x: T1) => Promise<T2>|T2, fn2: (x: T2) => Promise<T3>|T3, fn3: (x: T3) => Promise<T4>|T4): CurriedFn3<V0, V1, V2, Promise<T4>>;
        pipeP<V0, V1, V2, V3, T1, T2, T3, T4>(fn0: (x0: V0, x1: V1, x2: V2, x3: V3) => Promise<T1>, fn1: (x: T1) => Promise<T2>|T2, fn2: (x: T2) => Promise<T3>|T3, fn3: (x: T3) => Promise<T4>|T4): CurriedFn4<V0, V1, V2, V3, Promise<T4>>;
        pipeP<V0, T1, T2, T3, T4, T5>(fn0: (x0: V0) => Promise<T1>, fn1: (x: T1) => Promise<T2>|T2, fn2: (x: T2) => Promise<T3>|T3, fn3: (x: T3) => Promise<T4>|T4, fn4: (x: T4) => Promise<T5>|T5): CurriedFn1<V0, Promise<T5>>;
        pipeP<V0, V1, T1, T2, T3, T4, T5>(fn0: (x0: V0, x1: V1) => Promise<T1>, fn1: (x: T1) => Promise<T2>|T2, fn2: (x: T2) => Promise<T3>|T3, fn3: (x: T3) => Promise<T4>|T4, fn4: (x: T4) => Promise<T5>|T5): CurriedFn2<V0, V1, Promise<T5>>;
        pipeP<V0, V1, V2, T1, T2, T3, T4, T5>(fn0: (x0: V0, x1: V1, x2: V2) => Promise<T1>, fn1: (x: T1) => Promise<T2>|T2, fn2: (x: T2) => Promise<T3>|T3, fn3: (x: T3) => Promise<T4>|T4, fn4: (x: T4) => Promise<T5>|T5): CurriedFn3<V0, V1, V2, Promise<T5>>;
        pipeP<V0, V1, V2, V3, T1, T2, T3, T4, T5>(fn0: (x0: V0, x1: V1, x2: V2, x3: V3) => Promise<T1>, fn1: (x: T1) => Promise<T2>|T2, fn2: (x: T2) => Promise<T3>|T3, fn3: (x: T3) => Promise<T4>|T4, fn4: (x: T4) => Promise<T5>|T5): CurriedFn4<V0, V1, V2, V3, Promise<T5>>;
        pipeP<V0, T1, T2, T3, T4, T5, T6>(fn0: (x0: V0) => Promise<T1>, fn1: (x: T1) => Promise<T2>|T2, fn2: (x: T2) => Promise<T3>|T3, fn3: (x: T3) => Promise<T4>|T4, fn4: (x: T4) => Promise<T5>|T5, fn5: (x: T5) => Promise<T6>|T6): CurriedFn1<V0, Promise<T6>>;
        pipeP<V0, V1, T1, T2, T3, T4, T5, T6>(fn0: (x0: V0, x1: V1) => Promise<T1>, fn1: (x: T1) => Promise<T2>|T2, fn2: (x: T2) => Promise<T3>|T3, fn3: (x: T3) => Promise<T4>|T4, fn4: (x: T4) => Promise<T5>|T5, fn5: (x: T5) => Promise<T6>|T6): CurriedFn2<V0, V1, Promise<T6>>;
        pipeP<V0, V1, V2, T1, T2, T3, T4, T5, T6>(fn0: (x0: V0, x1: V1, x2: V2) => Promise<T1>, fn1: (x: T1) => Promise<T2>|T2, fn2: (x: T2) => Promise<T3>|T3, fn3: (x: T3) => Promise<T4>|T4, fn4: (x: T4) => Promise<T5>|T5, fn5: (x: T5) => Promise<T6>|T6): CurriedFn3<V0, V1, V2, Promise<T6>>;
        pipeP<V0, V1, V2, V3, T1, T2, T3, T4, T5, T6>(fn0: (x0: V0, x1: V1, x2: V2, x3: V3) => Promise<T1>, fn1: (x: T1) => Promise<T2>|T2, fn2: (x: T2) => Promise<T3>|T3, fn3: (x: T3) => Promise<T4>|T4, fn4: (x: T4) => Promise<T5>|T5, fn5: (x: T5) => Promise<T6>|T6): CurriedFn4<V0, V1, V2, V3, Promise<T6>>;
        pipeP<V0, T1, T2, T3, T4, T5, T6, T7>(fn0: (x0: V0) => Promise<T1>, fn1: (x: T1) => Promise<T2>|T2, fn2: (x: T2) => Promise<T3>|T3, fn3: (x: T3) => Promise<T4>|T4, fn4: (x: T4) => Promise<T5>|T5, fn5: (x: T5) => Promise<T6>|T6, fn6: (x: T6) => Promise<T7>|T7): CurriedFn1<V0, Promise<T7>>;
        pipeP<V0, V1, T1, T2, T3, T4, T5, T6, T7>(fn0: (x0: V0, x1: V1) => Promise<T1>, fn1: (x: T1) => Promise<T2>|T2, fn2: (x: T2) => Promise<T3>|T3, fn3: (x: T3) => Promise<T4>|T4, fn4: (x: T4) => Promise<T5>|T5, fn5: (x: T5) => Promise<T6>|T6, fn6: (x: T6) => Promise<T7>|T7): CurriedFn2<V0, V1, Promise<T7>>;
        pipeP<V0, V1, V2, T1, T2, T3, T4, T5, T6, T7>(fn0: (x0: V0, x1: V1, x2: V2) => Promise<T1>, fn1: (x: T1) => Promise<T2>|T2, fn2: (x: T2) => Promise<T3>|T3, fn3: (x: T3) => Promise<T4>|T4, fn4: (x: T4) => Promise<T5>|T5, fn5: (x: T5) => Promise<T6>|T6, fn6: (x: T6) => Promise<T7>|T7): CurriedFn3<V0, V1, V2, Promise<T7>>;
        pipeP<V0, V1, V2, V3, T1, T2, T3, T4, T5, T6, T7>(fn0: (x0: V0, x1: V1, x2: V2, x3: V3) => Promise<T1>, fn1: (x: T1) => Promise<T2>|T2, fn2: (x: T2) => Promise<T3>|T3, fn3: (x: T3) => Promise<T4>|T4, fn4: (x: T4) => Promise<T5>|T5, fn5: (x: T5) => Promise<T6>|T6, fn6: (x: T6) => Promise<T7>|T7): CurriedFn4<V0, V1, V2, V3, Promise<T7>>;
        pipeP<V0, T1, T2, T3, T4, T5, T6, T7, T8>(fn0: (x0: V0) => Promise<T1>, fn1: (x: T1) => Promise<T2>|T2, fn2: (x: T2) => Promise<T3>|T3, fn3: (x: T3) => Promise<T4>|T4, fn4: (x: T4) => Promise<T5>|T5, fn5: (x: T5) => Promise<T6>|T6, fn6: (x: T6) => Promise<T7>|T7, fn7: (x: T7) => Promise<T8>|T8): CurriedFn1<V0, Promise<T8>>;
        pipeP<V0, V1, T1, T2, T3, T4, T5, T6, T7, T8>(fn0: (x0: V0, x1: V1) => Promise<T1>, fn1: (x: T1) => Promise<T2>|T2, fn2: (x: T2) => Promise<T3>|T3, fn3: (x: T3) => Promise<T4>|T4, fn4: (x: T4) => Promise<T5>|T5, fn5: (x: T5) => Promise<T6>|T6, fn6: (x: T6) => Promise<T7>|T7, fn7: (x: T7) => Promise<T8>|T8): CurriedFn2<V0, V1, Promise<T8>>;
        pipeP<V0, V1, V2, T1, T2, T3, T4, T5, T6, T7, T8>(fn0: (x0: V0, x1: V1, x2: V2) => Promise<T1>, fn1: (x: T1) => Promise<T2>|T2, fn2: (x: T2) => Promise<T3>|T3, fn3: (x: T3) => Promise<T4>|T4, fn4: (x: T4) => Promise<T5>|T5, fn5: (x: T5) => Promise<T6>|T6, fn6: (x: T6) => Promise<T7>|T7, fn7: (x: T7) => Promise<T8>|T8): CurriedFn3<V0, V1, V2, Promise<T8>>;
        pipeP<V0, V1, V2, V3, T1, T2, T3, T4, T5, T6, T7, T8>(fn0: (x0: V0, x1: V1, x2: V2, x3: V3) => Promise<T1>, fn1: (x: T1) => Promise<T2>|T2, fn2: (x: T2) => Promise<T3>|T3, fn3: (x: T3) => Promise<T4>|T4, fn4: (x: T4) => Promise<T5>|T5, fn5: (x: T5) => Promise<T6>|T6, fn6: (x: T6) => Promise<T7>|T7, fn7: (x: T7) => Promise<T8>|T8): CurriedFn4<V0, V1, V2, V3, Promise<T8>>;
        pipeP<V0, T1, T2, T3, T4, T5, T6, T7, T8, T9>(fn0: (x0: V0) => Promise<T1>, fn1: (x: T1) => Promise<T2>|T2, fn2: (x: T2) => Promise<T3>|T3, fn3: (x: T3) => Promise<T4>|T4, fn4: (x: T4) => Promise<T5>|T5, fn5: (x: T5) => Promise<T6>|T6, fn6: (x: T6) => Promise<T7>|T7, fn7: (x: T7) => Promise<T8>|T8, fn8: (x: T8) => Promise<T9>|T9): CurriedFn1<V0, Promise<T9>>;
        pipeP<V0, V1, T1, T2, T3, T4, T5, T6, T7, T8, T9>(fn0: (x0: V0, x1: V1) => Promise<T1>, fn1: (x: T1) => Promise<T2>|T2, fn2: (x: T2) => Promise<T3>|T3, fn3: (x: T3) => Promise<T4>|T4, fn4: (x: T4) => Promise<T5>|T5, fn5: (x: T5) => Promise<T6>|T6, fn6: (x: T6) => Promise<T7>|T7, fn7: (x: T7) => Promise<T8>|T8, fn8: (x: T8) => Promise<T9>|T9): CurriedFn2<V0, V1, Promise<T9>>;
        pipeP<V0, V1, V2, T1, T2, T3, T4, T5, T6, T7, T8, T9>(fn0: (x0: V0, x1: V1, x2: V2) => Promise<T1>, fn1: (x: T1) => Promise<T2>|T2, fn2: (x: T2) => Promise<T3>|T3, fn3: (x: T3) => Promise<T4>|T4, fn4: (x: T4) => Promise<T5>|T5, fn5: (x: T5) => Promise<T6>|T6, fn6: (x: T6) => Promise<T7>|T7, fn7: (x: T7) => Promise<T8>|T8, fn8: (x: T8) => Promise<T9>|T9): CurriedFn3<V0, V1, V2, Promise<T9>>;
        pipeP<V0, V1, V2, V3, T1, T2, T3, T4, T5, T6, T7, T8, T9>(fn0: (x0: V0, x1: V1, x2: V2, x3: V3) => Promise<T1>, fn1: (x: T1) => Promise<T2>|T2, fn2: (x: T2) => Promise<T3>|T3, fn3: (x: T3) => Promise<T4>|T4, fn4: (x: T4) => Promise<T5>|T5, fn5: (x: T5) => Promise<T6>|T6, fn6: (x: T6) => Promise<T7>|T7, fn7: (x: T7) => Promise<T8>|T8, fn8: (x: T8) => Promise<T9>|T9): CurriedFn4<V0, V1, V2, V3, Promise<T9>>;

        /**
         * Returns the left-to-right Kleisli composition of the provided functions, each of which must return a value of a type supported by chain.
         */
        // skipped extra params on fn0 -- not mentioned in the docs!
        pipeK<V, T1>(fn0: (v: Chain<V>) => Chain<T1>): (v: Chain<V>) => Chain<T1>;
        pipeK<V, T1, T2>(fn0: (v: Chain<V>) => Chain<T1>, fn1: (x: T1) => Chain<T2>): (v: Chain<V>) => Chain<T2>;
        pipeK<V, T1, T2, T3>(fn0: (v: Chain<V>) => Chain<T1>, fn1: (x: T1) => Chain<T2>, fn2: (x: T2) => Chain<T3>): (v: Chain<V>) => Chain<T3>;
        pipeK<V, T1, T2, T3, T4>(fn0: (v: Chain<V>) => Chain<T1>, fn1: (x: T1) => Chain<T2>, fn2: (x: T2) => Chain<T3>, fn3: (x: T3) => Chain<T4>): (v: Chain<V>) => Chain<T4>;
        pipeK<V, T1, T2, T3, T4, T5>(fn0: (v: Chain<V>) => Chain<T1>, fn1: (x: T1) => Chain<T2>, fn2: (x: T2) => Chain<T3>, fn3: (x: T3) => Chain<T4>, fn4: (x: T4) => Chain<T5>): (v: Chain<V>) => Chain<T5>;
        pipeK<V, T1, T2, T3, T4, T5, T6>(fn0: (v: Chain<V>) => Chain<T1>, fn1: (x: T1) => Chain<T2>, fn2: (x: T2) => Chain<T3>, fn3: (x: T3) => Chain<T4>, fn4: (x: T4) => Chain<T5>, fn5: (x: T5) => Chain<T6>): (v: Chain<V>) => Chain<T6>;
        pipeK<V, T1, T2, T3, T4, T5, T6, T7>(fn0: (v: Chain<V>) => Chain<T1>, fn1: (x: T1) => Chain<T2>, fn2: (x: T2) => Chain<T3>, fn3: (x: T3) => Chain<T4>, fn4: (x: T4) => Chain<T5>, fn5: (x: T5) => Chain<T6>, fn6: (x: T6) => Chain<T7>): (v: Chain<V>) => Chain<T7>;
        pipeK<V, T1, T2, T3, T4, T5, T6, T7, T8>(fn0: (v: Chain<V>) => Chain<T1>, fn1: (x: T1) => Chain<T2>, fn2: (x: T2) => Chain<T3>, fn3: (x: T3) => Chain<T4>, fn4: (x: T4) => Chain<T5>, fn5: (x: T5) => Chain<T6>, fn6: (x: T6) => Chain<T7>, fn7: (x: T7) => Chain<T8>): (v: Chain<V>) => Chain<T8>;
        pipeK<V, T1, T2, T3, T4, T5, T6, T7, T8, T9>(fn0: (v: Chain<V>) => Chain<T1>, fn1: (x: T1) => Chain<T2>, fn2: (x: T2) => Chain<T3>, fn3: (x: T3) => Chain<T4>, fn4: (x: T4) => Chain<T5>, fn5: (x: T5) => Chain<T6>, fn6: (x: T6) => Chain<T7>, fn7: (x: T7) => Chain<T8>, fn8: (x: T8) => Chain<T9>): (v: Chain<V>) => Chain<T9>;

        /**
         * Returns a new list by plucking the same named property off all objects in the list supplied.
         */
        pluck<T extends Struct<any>, K extends keyof T>(p: K, list: T[]): T[K][]; // fails on number keys
        pluck<T extends Struct<any>, K extends keyof T>(p: K): (list: T[]) => T[K][]; // doesn't work, T info late
        // pluck<T extends Struct<any>, K extends keyof T>: CurriedFn2<K, T[], T[K][]>;
        // supply return object type manually when unable to infer it...
        pluck<T>(p: Prop, list: Struct<any>[]): T[];
        pluck(p: Prop): <T>(list: Struct<any>[]) => T[];
        // pluck<T>: CurriedFn2<Prop, Struct<any>[], T[]>;

        /**
         * Returns a new list with the given element at the front, followed by the contents of the
         * list.
         */
        prepend<T>(el: T, list: T[]): T[];
        prepend<T>(el: T): (list: T[]) => T[];
        // prepend<T>: CurriedFn2<T, T[], T[]>;

        /**
         * Multiplies together all the elements of a list.
         */
        product(list: number[]): number;


        /**
         * Reasonable analog to SQL `select` statement.
         */
        project<T, K extends keyof T>(props: K[], objs: T[]): Pick<T, K>[];
        project<T, K extends keyof T>(props: K[]): (objs: T[]) => Pick<T, K>[]; // T info probably too late
        // project<T, K extends keyof T>: CurriedFn2<K[], T[], Pick<T, K>[]>;
        // supply return object type manually when unable to infer it...
        project<T,U>(props: string[], objs: T[]): U[];
        project(props: string[]): <T,U>(objs: T[]) => U[];
        // project<T,U>: CurriedFn2<string[], T[], U[]>;

        /**
         * Returns a function that when supplied an object returns the indicated property of that object, if it exists.
         */
        prop<T, K extends keyof T>(p: K, obj: T): T[K];
        // prop<T, K extends keyof T>(p: K): (obj: T) => T[K]; // T info late
        // prop<T, K extends keyof T>: CurriedFn2<K, T, T[K]>;
        prop<K extends Prop>(p: K): <T, K extends keyof T>(obj: T) => T[K]; // are these Ks bound properly?
        // prop<T, K extends Prop>: CurriedFn2<K, T, T[K]>;

        /**
         * Determines whether the given property of an object has a specific
         * value according to strict equality (`===`).  Most likely used to
         * filter a list.
         */
        propEq<T extends Struct<any>>(name: string, val: any, obj: T): boolean;
        propEq<T extends Struct<any>>(name: string, val: any): (obj: T) => boolean;
        propEq<T extends Struct<any>>(name: string): CurriedFn2<any, T, boolean>;
        propEq<T extends Struct<any>>(name: string): (val: any, obj: T) => boolean;
        propEq<T extends Struct<any>>(name: number): (val: any) => (obj: T) => boolean;
        // propEq<T extends Struct<any>>: CurriedFn3<string, any, T, boolean>;

        /**
         * Returns true if the specified object property is of the given type; false otherwise.
         */
        propIs<T, V, K extends keyof V>(type: T, name: K, obj: V): obj is (V & Record<K, T>)
        // v object info not available in time :(
        // propIs<T, V, K extends keyof V>(type: T, name: K): (obj: V) => obj is (V & Record<K, T>)
        // propIs<T, V, K extends keyof V>(type: T): {
        //     (name: K, obj: V): obj is (V & Record<K, T>);
        //     (name: K): (obj: V) => obj is (V & Record<K, T>);
        // }
        propIs(type: Function, name: Prop): (obj: Struct<any>) => boolean;
        propIs(type: Function): CurriedFn2<Prop, Struct<any>, boolean>;
        propIs(type: Function): {
            (name: Prop, obj: Struct<any>): boolean;
            (name: Prop): (obj: Struct<any>) => boolean;
        }
        // propIs: CurriedFn3<Function, Prop, Struct<any>, boolean>;

        /**
         * If the given, non-null object has an own property with the specified name, returns the value of that property.
         * Otherwise returns the provided default value.
         */
        propOr<T,U,K extends keyof U>(val: T, p: K, obj: U): U[K]|T; // obj[K]?
        propOr<T,U,K extends keyof U>(val: T, p: K): (obj: U) => U[K]|T;
        propOr<T,U,K extends keyof U>(val: T): (p: K, obj: U) => U[K]|T;
        propOr<T,U,K extends keyof U>(val: T): (p: K) => (obj: U) => U[K]|T;
        // propOr<T,U,K extends keyof U>: CurriedFn3<T, K, U, U[K]|T>;
        propOr<T,U,V>(val: T, p: string, obj: U): V;
        propOr<T>(val: T, p: string): <U,V>(obj: U) => V;
        propOr<T>(val: T): <U,V>(p: string, obj: U) => V;
        propOr<T,U,V>(val: T): CurriedFn2<string, U, V>;
        // propOr<T,U,V>: CurriedFn3<T, string, U, V>;

        /**
         * Acts as multiple `prop`: array of keys in, array of values out. Preserves order.
         */
        props<T>(ps: Prop[], obj: Struct<T>): T[];
        props(ps: Prop[]): <T>(obj: Struct<T>) => T[];
        // props<T>: CurriedFn2<Prop[], Struct<T>, T[]>;
        // TODO: heterogeneous version

        /**
         * Returns true if the specified object property satisfies the given predicate; false otherwise.
         */
        propSatisfies<U extends Struct<any>, K extends keyof U>(pred: Pred<U[K]>, name: Prop, obj: U): boolean;
        // v: info too late, must use a simpler version
        propSatisfies<T,U>(pred: Pred<T>, name: Prop): (obj: U) => boolean;
        propSatisfies<T,U>(pred: Pred<T>): CurriedFn2<Prop, U, boolean>;
        // propSatisfies<T,U>: CurriedFn3<Pred<T>, Prop, U, boolean>;

        /**
         * Returns a list of numbers from `from` (inclusive) to `to`
         * (exclusive). In mathematical terms, `range(a, b)` is equivalent to
         * the half-open interval `[a, b)`.
         */
        range(from: number, to: number): number[];
        range(from: number): (to: number) => number[];
        // range: CurriedFn2<number, number, number[]>;

        /**
         * Returns a single item by iterating through the list, successively calling the iterator
         * function and passing it an accumulator value and the current value from the array, and
         * then passing the result to the next call.
         */
        reduce<T, TResult>(fn: (acc: TResult, elem: T, idx: Number, list: T[]) => TResult|Reduced, acc: TResult, list: T[]): TResult;
        reduce<T, TResult>(fn: (acc: TResult, elem: T, idx: Number, list: T[]) => TResult|Reduced): CurriedFn2<TResult, T[], TResult>;
        reduce<T, TResult>(fn: (acc: TResult, elem: T, idx: Number, list: T[]) => TResult|Reduced): (acc: TResult, list: T[]) => TResult;
        reduce<T, TResult>(fn: (acc: TResult, elem: T, idx: Number, list: T[]) => TResult|Reduced, acc: TResult): (list: T[]) => TResult;
        // reduce<T, TResult>: CurriedFn3<(acc: TResult, elem: T, idx: Number, list: T[]) => TResult|Reduced, TResult, T[], TResult>;

        /**
         * Groups the elements of the list according to the result of calling the String-returning function keyFn on each
         * element and reduces the elements of each group to a single value via the reducer function valueFn.
         */
        // reason for 'any' on acc: somehow empty accumulators like '[]' won't work well when matching
        reduceBy<T, TResult>(valueFn: (acc: TResult, elem: T, idx: number, list: T[]) => TResult, acc: TResult|any, keyFn: (elem: T) => string, list: T[]): TResult;
        reduceBy<T, TResult>(valueFn: (acc: TResult, elem: T, idx: number, list: T[]) => TResult, acc: TResult|any, keyFn: (elem: T) => string): (list: T[]) => TResult;
        reduceBy<T, TResult>(valueFn: (acc: TResult, elem: T, idx: number, list: T[]) => TResult, acc: TResult|any): CurriedFn2<(elem: T) => string, T[], TResult>;
        reduceBy<T, TResult>(valueFn: (acc: TResult, elem: T, idx: number, list: T[]) => TResult): CurriedFn3<TResult|any, (elem: T) => string, T[], TResult>;
        // reduceBy<T, TResult>: CurriedFn4<(acc: TResult, elem: T, idx: number, list: T[]) => TResult, TResult|any, (elem: T) => string, T[], TResult>;

        /**
         * Returns a value wrapped to indicate that it is the final value of the reduce and
         * transduce functions. The returned value should be considered a black box: the internal
         * structure is not guaranteed to be stable.
         */
        reduced<T>(elem: T): Reduced;

        /**
         * Returns a single item by iterating through the list, successively calling the iterator
         * function and passing it an accumulator value and the current value from the array, and
         * then passing the result to the next call.
         */
        // reason for 'any' on acc: somehow empty accumulators like '[]' won't work well when matching
        reduceRight<T, TResult>(fn: (acc: TResult, elem: T) => TResult|Reduced, acc: TResult|any, list: T[]): TResult;
        reduceRight<T, TResult>(fn: (acc: TResult, elem: T) => TResult|Reduced, acc: TResult|any): (list: T[]) => TResult;
        reduceRight<T, TResult>(fn: (acc: TResult, elem: T) => TResult|Reduced): CurriedFn2<TResult, T[], TResult>;
        reduceRight<T, TResult>(fn: (acc: TResult, elem: T) => TResult|Reduced): (acc: TResult|any, list: T[]) => TResult;
        reduceRight<T, TResult>(fn: (acc: TResult, elem: T) => TResult|Reduced): (acc: TResult|any) => (list: T[]) => TResult;
        // reduceRight<T, TResult>: CurriedFn3<(acc: TResult, elem: T) => TResult|Reduced, TResult|any, T[], TResult>;

        // does this function still/already exist?
        reduceRightIndexed<T, TResult>(fn: (acc: TResult, elem: T, idx: Number, list: T[]) => TResult|Reduced, acc: TResult, list: T[]): TResult;
        reduceRightIndexed<T, TResult>(fn: (acc: TResult, elem: T, idx: Number, list: T[]) => TResult|Reduced, acc: TResult): (list: T[]) => TResult;
        reduceRightIndexed<T, TResult>(fn: (acc: TResult, elem: T, idx: Number, list: T[]) => TResult|Reduced): CurriedFn2<TResult,T[],TResult>;

        /**
         * Like reduce, reduceWhile returns a single item by iterating through the list, successively calling the iterator function.
         * reduceWhile also takes a predicate that is evaluated before each step. If the predicate returns false, it "short-circuits"
         * the iteration and returns the current value of the accumulator.
         */
        reduceWhile<T, TResult>(pred: (acc: TResult, elem: T) => boolean, fn: (acc: TResult, elem: T) => TResult|Reduced, acc: TResult, list: T[]): TResult;
        reduceWhile<T, TResult>(pred: (acc: TResult, elem: T) => boolean, fn: (acc: TResult, elem: T) => TResult|Reduced, acc: TResult): (list: T[]) => TResult;
        reduceWhile<T, TResult>(pred: (acc: TResult, elem: T) => boolean, fn: (acc: TResult, elem: T) => TResult|Reduced): CurriedFn2<TResult, T[], TResult>;
        reduceWhile<T, TResult>(pred: (acc: TResult, elem: T) => boolean): CurriedFn3<(TResult, T) => TResult|Reduced, TResult, T[], TResult>;
        // reduceWhile<T, TResult>: CurriedFn4<(acc: TResult, elem: T) => boolean, (acc: TResult, elem: T) => TResult|Reduced, TResult, T[], TResult>;

        /**
         * Similar to `filter`, except that it keeps only values for which the given predicate
         * function returns falsy.
         */
        // array
        reject<T>(fn: (value: T) => boolean, list: T[]): T[];
        reject<T>(fn: (value: T) => boolean): (list: T[]) => T[];
        // reject<T>: CurriedFn2<(value: T) => boolean, T[], T[]>;
        // functor
        reject<T>(fn: (value: T) => boolean, list: Functor<T>): T[];
        reject<T>(fn: (value: T) => boolean): <T>(list: Functor<T>) => T[];
        // reject<T>: CurriedFn2<(value: T) => boolean, Functor<T>, T[]>;
        // object
        reject<T,U extends Dictionary<T>>(fn: (value: T) => boolean, obj: U) : Partial<U>;
        reject<T>(fn: (value: T) => boolean): <U extends Dictionary<T>>(obj: U) => Partial<U>;
        // reject<T,U extends Dictionary<T>>: CurriedFn2<(value: T) => boolean, U, Partial<U>>;

        /**
         * Removes the sub-list of `list` starting at index `start` and containing `count` elements.
         */
        remove<T>(start: number, count: number, list: T[]): T[];
        remove<T>(start: number, count: number): (list: T[]) => T[];
        remove<T>(start: number): CurriedFn2<number,T[],T[]>;
        // remove<T>: CurriedFn3<number, number, T[], T[]>;

        /**
         * Returns a fixed list of size n containing a specified identical value.
         */
        repeat<T>(a: T, n: number): T[];
        repeat<T>(a: T): (n: number) => T[];
        // repeat<T>: CurriedFn2<T, number, T[]>;


        /**
         * Replace a substring or regex match in a string with a replacement.
         */
        replace(pattern: RegExp|string, replacement: string, str: string): string;
        replace(pattern: RegExp|string, replacement: string): (str: string) => string;
        replace(pattern: RegExp|string): CurriedFn2<string, string, string>;
        replace(pattern: RegExp|string): (replacement: string, str: string) => string;
        replace(pattern: RegExp|string): (replacement: string) => (str: string) => string;
        // replace: CurriedFn3<RegExp|string, string, string, string>;


        /**
         * Returns a new list with the same elements as the original list, just in the reverse order.
         */
        reverse<T>(list: T[]): T[];

        /**
         * Scan is similar to reduce, but returns a list of successively reduced values from the left.
         */
        scan<T, TResult>(fn: (acc: TResult, elem: T) => TResult|Reduced, acc: TResult, list: T[]): TResult[];
        scan<T, TResult>(fn: (acc: TResult, elem: T) => TResult|Reduced, acc: TResult): (list: T[]) => TResult[];
        scan<T, TResult>(fn: (acc: TResult, elem: T) => TResult|Reduced): CurriedFn2<TResult, T[], TResult[]>;
        // scan<T, TResult>: CurriedFn3<(acc: TResult, elem: T) => TResult|Reduced, TResult, T[], TResult[]>;

        /**
         * Transforms a Traversable of Applicative into an Applicative of Traversable.
         */
        // TODO: incorporate generalized inheritance e.g.: `<U extends
        // Applicative, V extends Traversable>`; possibly needs [rank 2
        // polymorphism](https://github.com/Microsoft/TypeScript/issues/1213).
        // ADT case:
        sequence<T>(f: (v: T) => Applicative<T>, traversable: Traversable<Applicative<T>>): Applicative<Traversable<T>>;
        sequence<T>(f: (v: T) => Applicative<T>): (traversable: Traversable<Applicative<T>>) => Applicative<Traversable<T>>;
        // sequence<T>: CurriedFn2<(v: T) => Applicative<T>, Traversable<Applicative<T>>, Applicative<Traversable<T>>>;
        // common case of array as traversable:
        sequence<T>(f: (v: T) => Applicative<T>, traversable: Array<Applicative<T>>): Applicative<Array<T>>;
        sequence<T>(f: (v: T) => Applicative<T>): (traversable: Array<Applicative<T>>) => Applicative<Array<T>>;
        // sequence<T>: CurriedFn2<(v: T) => Applicative<T>, Array<Applicative<T>>, Applicative<Array<T>>>;

        /**
         * Returns the result of "setting" the portion of the given data structure focused by the given lens to the
         * given value.
         */
        // smart approach, unreliable:
        set<T,U>(lens: Lens<T,U>, a: U, obj: T): T;
        set<T,U>(lens: Lens<T,U>, a: U): (obj: T) => T;
        set<T,U>(lens: Lens<T,U>): (a: U, obj: T) => T;
        // set<T,U>: CurriedFn3<Lens<T,U>, U, T, T>;
        // assume result type equal to input object:
        set<T>(lens: UnknownLens, a: any, obj: T): T;
        set<T>(lens: UnknownLens, a: any): (obj: T) => T;
        set<T>(lens: UnknownLens): (a: any, obj: T) => T;
        // set<T>: CurriedFn3<UnknownLens, any, T, T>;
        // old version, with value as an unbound generic; is this useful?
        set<T,U>(lens: UnknownLens, a: U, obj: T): T;
        set<T,U>(lens: UnknownLens, a: U): (obj: T) => T;
        set<T,U>(lens: UnknownLens): CurriedFn2<U,T,T>;
        // set<T,U>: CurriedFn3<UnknownLens, U, T, T>;

        /**
         * Returns the elements from `xs` starting at `a` and ending at `b - 1`.
         */
        slice<T extends any[]|string>(a: number, b: number, list: T): T;
        slice(a: number, b: number): <T extends any[]|string>(list: T) => T;
        slice<T extends any[]|string>(a: number): CurriedFn2<number, T, T>;
        slice(a: number): <T extends any[]|string>(b: number, list: T) => T;
        slice(a: number): <T extends any[]|string>(b: number) => (list: T) => T;
        // slice<T extends any[]|string>: CurriedFn3<number, number, T, T>;

        /**
         * Returns a copy of the list, sorted according to the comparator function, which should accept two values at a
         * time and return a negative number if the first value is smaller, a positive number if it's larger, and zero
         * if they are equal.
         */
        sort<T>(fn: (a: T, b: T) => number, list: T[]): T[];
        sort<T>(fn: (a: T, b: T) => number): (list: T[]) => T[];
        // sort<T>: CurriedFn2<(a: T, b: T) => number, T[], T[]>;


        /**
         * Sorts the list according to a key generated by the supplied function.
         */
        sortBy<T>(fn: (a: T) => string, list: T[]): T[];
        sortBy<T>(fn: (a: T) => string): (list: T[]) => T[];
        // sortBy<T>: CurriedFn2<(a: T) => string, T[], T[]>;

        /**
         * Splits a string into an array of strings based on the given
         * separator.
         */
        split(sep: RegExp|string, str: string): string[];
        split(sep: RegExp|string): (str: string) => string[];
        // split: CurriedFn2<RegExp|string, string, string[]>;

        /**
         * Splits a given list or string at a given index.
         */
        splitAt<T>(index: number, list: T[]): T[][];
        splitAt(index: number): <T>(list: T[]) => T[][];
        // splitAt<T>: CurriedFn2<number, T[], T[][]>;
        splitAt(index: number, list: string): [string, string];
        splitAt(index: number): (list: string) => [string, string];
        // splitAt: CurriedFn2<number, string, [string, string]>;

        /**
         * Splits a collection into slices of the specified length.
         */
        splitEvery<T>(a: number, list: T[]): T[][];
        splitEvery(a: number): <T>(list: T[]) => T[][];
        // splitEvery<T>: CurriedFn2<number, T[], T[][]>;
        splitEvery(a: number, list: string): string[];
        splitEvery(a: number): (list: string) => string[];
        // splitEvery: CurriedFn2<number, string, string[]>;

        /**
         * Takes a list and a predicate and returns a pair of lists with the following properties:
         * - the result of concatenating the two output lists is equivalent to the input list;
         * - none of the elements of the first output list satisfies the predicate; and
         * - if the second output list is non-empty, its first element satisfies the predicate.
         */
        splitWhen<T,U>(pred: Pred<T>, list: U[]): U[][];
        splitWhen<T>(pred: Pred<T>): <U>(list: U[]) => U[][];
        // splitWhen<T,U>: CurriedFn2<Pred<T>, U[], U[][]>;

        // deprecated since 0.15.0
        strIndexOf(c: string, str: string): number;
        strIndexOf(c: string): (str: string) => number;

        // deprecated since 0.15.0
        strLastIndexOf(c: string, str: string): number;
        strLastIndexOf(c: string): (str: string) => number;

        /**
         * Subtracts two numbers. Equivalent to `a - b` but curried.
         */
        subtract(a: number, b: number): number;
        subtract(a: number): (b: number) => number;
        // subtract: CurriedFn2<number, number, number>;

        /**
         * Adds together all the elements of a list.
         */
        sum(list: number[]): number;

        /**
         * Finds the set (i.e. no duplicates) of all elements contained in the first or second list, but not both.
         */
        symmetricDifference<T>(list1: T[], list2: T[]): T[];
        symmetricDifference<T>(list: T[]): <T>(list: T[]) => T[];
        // symmetricDifference<T>: CurriedFn2<T[], T[], T[]>;

        /**
         * Finds the set (i.e. no duplicates) of all elements contained in the first or second list, but not both.
         * Duplication is determined according to the value returned by applying the supplied predicate to two list elements.
         */
        symmetricDifferenceWith<T>(pred: (a: T, b: T) => boolean, list1: T[], list2: T[]): T[];
        symmetricDifferenceWith<T>(pred: (a: T, b: T) => boolean): CurriedFn2<T[], T[], T[]>;
        // symmetricDifferenceWith<T>: CurriedFn3<(a: T, b: T) => boolean, T[], T[], T[]>;

        /**
         * A function that always returns true. Any passed in parameters are ignored.
         */
        T(): true;

        /**
         * Returns all but the first element of a list.
         */
        tail<T>(list: T[]): T[];
        tail(s: string): string;

        /**
         * Returns a new list containing the first `n` elements of the given list.  If
         * `n > * list.length`, returns a list of `list.length` elements.
         */
        take<T>(n: number, xs: T[]): T[];
        take(n: number, xs: string): string;
        take<T>(n: number): {
            (xs: string): string;
            (xs: T[]): T[];
        }
        // take<T>: CurriedFn2<number, T[], T[]>;
        // take<T>: CurriedFn2<number, string, string>;


        /**
         * Returns a new list containing the last n elements of the given list. If n > list.length,
         * returns a list of list.length elements.
         */
        takeLast<T>(n: number, xs: T[]): T[];
        takeLast(n: number, xs: string): string;
        takeLast(n: number): {
            <T>(xs: T[]): T[];
            (xs: string): string;
        }
        // takeLast<T>: CurriedFn2<number, T[], T[]>;
        // takeLast<T>: CurriedFn2<number, string, string>;

        /**
         * Returns a new list containing the last n elements of a given list, passing each value
         * to the supplied predicate function, and terminating when the predicate function returns
         * false. Excludes the element that caused the predicate function to fail. The predicate
         * function is passed one argument: (value).
         */
        takeLastWhile<T>(pred: Pred<T>, list: T[]): T[];
        takeLastWhile<T>(pred: Pred<T>): <T>(list: T[]) => T[];
        // takeLastWhile<T>: CurriedFn2<Pred<T>, T[], T[]>;

        /**
         * Returns a new list containing the first `n` elements of a given list, passing each value
         * to the supplied predicate function, and terminating when the predicate function returns
         * `false`.
         */
        takeWhile<T>(pred: Pred<T>, list: T[]): T[];
        takeWhile<T>(pred: Pred<T>): (list: T[]) => T[];
        // takeWhile<T>: CurriedFn2<Pred<T>, T[], T[]>;

        /**
         * The function to call with x. The return value of fn will be thrown away.
         */
        tap<T>(fn: (a: T) => any, value: T): T;
        tap<T>(fn: (a: T) => any): (value: T) => T;
        // tap<T>: CurriedFn2<(a: T) => any, T, T>;

        /**
         * Determines whether a given string matches a given regular expression.
         */
        test(regexp: RegExp, str: string): boolean;
        test(regexp: RegExp): (str: string) => boolean;
        // test: CurriedFn2<RegExp, string, boolean>;

        /**
         * Calls an input function `n` times, returning an array containing the results of those
         * function calls.
         */
        times<T>(fn: (i: number) => T, n: number): T[];
        times<T>(fn: (i: number) => T): (n: number) => T[];
        // times<T>: CurriedFn2<(i: number) => T, number, T[]>;


        /**
         * The lower case version of a string.
         */
        toLower(str: string): string;

        /**
         * Converts an object into an array of key, value arrays.
         * Only the object's own properties are used.
         * Note that the order of the output array is not guaranteed to be
         * consistent across different JS platforms.
         */
        toPairs<T>(obj: Dictionary<T>): [string,T][];

        /**
         * Converts an object into an array of key, value arrays.
         * The object's own properties and prototype properties are used.
         * Note that the order of the output array is not guaranteed to be
         * consistent across different JS platforms.
         */
        toPairsIn<T>(obj: Dictionary<T>): [string,T][];
        toPairsIn(obj: Object): [string,any][];

        /**
         * Returns the string representation of the given value. eval'ing the output should
         * result in a value equivalent to the input value. Many of the built-in toString
         * methods do not satisfy this requirement.
         *
         * If the given value is an [object Object] with a toString method other than
         * Object.prototype.toString, this method is invoked with no arguments to produce the
         * return value. This means user-defined constructor functions can provide a suitable
         * toString method.
         */
        toString<T>(val: T): string;

        /**
         * The upper case version of a string.
         */
        toUpper(str: string): string;

        /**
         * Initializes a transducer using supplied iterator function. Returns a single item by iterating through the
         * list, successively calling the transformed iterator function and passing it an accumulator value and the
         * current value from the array, and then passing the result to the next call.
         */
        transduce<T,U>(xf: (arg: T[]) => T[], fn: (acc: U[], val: U) => U[], acc: T[], list: T[]): U;
        transduce<T,U>(xf: (arg: T[]) => T[], fn: (acc: U[], val: U) => U[], acc: T[]): (list: T[]) => U;
        transduce<T,U>(xf: (arg: T[]) => T[], fn: (acc: U[], val: U) => U[]): CurriedFn2<T[],T[],U>;
        transduce<T,U>(xf: (arg: T[]) => T[]): CurriedFn3<(acc: U[], val: U) => U[],T[],T[],U>;
        // transduce<T,U>: CurriedFn4<(arg: T[]) => T[], (acc: U[], val: U) => U[], T[], T[], U>;

        /**
         * Transposes the rows and columns of a 2D list. When passed a list of n lists of length x, returns a list of x lists of length n.
         */
        transpose<T>(list: T[][]): T[][];
        transpose(list: any[][]): any[][];

        /**
         * Maps an Applicative-returning function over a Traversable, then uses
         * `sequence` to transform the resulting Traversable of Applicative into
         * an Applicative of Traversable.
         */
         // ADT case:
         traverse<T, U>(ap: (v: T) => Applicative<T>, fn: (v: T) => Applicative<U>, traversable: Traversable<T>): Applicative<Traversable<U>>;
         traverse<T, U>(ap: (v: T) => Applicative<T>, fn: (v: T) => Applicative<U>): (traversable: Traversable<T>) => Applicative<Traversable<U>>;
         traverse<T, U>(ap: (v: T) => Applicative<T>): CurriedFn2<(v: T) => Applicative<U>, Traversable<T>, Applicative<Traversable<U>>>;
         // traverse<T, U>: CurriedFn3<(v: T) => Applicative<T>, (v: T) => Applicative<U>, Traversable<T>, Applicative<Traversable<U>>>;
         // common case of array as traversable:
         traverse<T, U>(ap: (v: T) => Applicative<T>, fn: (v: T) => Applicative<U>, traversable: Array<T>): Applicative<Array<U>>;
         traverse<T, U>(ap: (v: T) => Applicative<T>, fn: (v: T) => Applicative<U>): (traversable: Array<T>) => Applicative<Array<U>>;
         traverse<T, U>(ap: (v: T) => Applicative<T>): CurriedFn2<(v: T) => Applicative<U>, Array<T>, Applicative<Array<U>>>;
         // traverse<T, U>: CurriedFn3<(v: T) => Applicative<T>, (v: T) => Applicative<U>, Array<T>, Applicative<Array<U>>>;

        /**
         * Removes (strips) whitespace from both ends of the string.
         */
        trim(str: string): string;

        /**
         * tryCatch takes two functions, a tryer and a catcher. The returned function evaluates the tryer; if it does
         * not throw, it simply returns the result. If the tryer does throw, the returned function evaluates the catcher
         * function and returns its result. Note that for effective composition with this function, both the tryer and
         * catcher functions must return the same type of results.
         */
        tryCatch<T>(tryer: (...args: any[]) => T, catcher: (...args: any[]) => T): (...args: any[]) => T;
        // tryCatch<T>: CurriedFn2<(...args: any[]) => T, (...args: any[]) => T, (...args: any[]) => T>;

        /**
         * Gives a single-word string description of the (native) type of a value, returning such answers as 'Object',
         * 'Number', 'Array', or 'Null'. Does not attempt to distinguish user Object types any further, reporting them
         * all as 'Object'.
         */
        type(val: any): string;

        /**
         * Takes a function fn, which takes a single array argument, and returns a function which:
         * - takes any number of positional arguments;
         * - passes these arguments to fn as an array; and
         * - returns the result.
         * In other words, R.unapply derives a variadic function from a function which takes an array.
         * R.unapply is the inverse of R.apply.
         */
        unapply<T>(fn: (args: any[]) => T): (...args: any[]) => T;

        /**
         * Wraps a function of any arity (including nullary) in a function that accepts exactly 1 parameter.
         * Any extraneous parameters will not be passed to the supplied function.
         */
        unary<T,U>(fn: (a: T, ...args: any[]) => U): (a: T) => U;

        /**
         * Returns a function of arity n from a (manually) curried function.
         */
        uncurryN<T>(len: number, fn: (a: any) => any): (...a: any[]) => T;
        // uncurryN<T>: CurriedFn2<number, (a: any) => any, (...a: any[]) => T>;

        /**
         * Builds a list from a seed value. Accepts an iterator function, which returns either false
         * to stop iteration or an array of length 2 containing the value to add to the resulting
         * list and the seed to be used in the next call to the iterator function.
         */
        unfold<T, TResult>(fn: (seed: T) => TResult[]|boolean, seed: T): TResult[];
        unfold<T, TResult>(fn: (seed: T) => TResult[]|boolean): (seed: T) => TResult[];
        // unfold<T, TResult>: CurriedFn2<(seed: T) => TResult[]|boolean, T, TResult[]>;

        /**
         * Combines two lists into a set (i.e. no duplicates) composed of the
         * elements of each list.
         */
        union<T>(as: T[], bs: T[]): T[];
        union<T>(as: T[]): (bs: T[]) => T[];
        // union<T>: CurriedFn2<T[], T[], T[]>;

        /**
         * Combines two lists into a set (i.e. no duplicates) composed of the elements of each list.  Duplication is
         * determined according to the value returned by applying the supplied predicate to two list elements.
         */
        unionWith<T>(pred: (a: T, b: T) => boolean, list1: T[], list2: T[]): T[];
        unionWith<T>(pred: (a: T, b: T) => boolean, list1: T[]): (list2: T[]) => T[];
        unionWith<T>(pred: (a: T, b: T) => boolean): CurriedFn2<T[], T[], T[]>
        // unionWith<T>: CurriedFn3<(a: T, b: T) => boolean, T[], T[], T[]>;

        /**
         * Returns a new list containing only one copy of each element in the original list.
         */
        uniq<T>(list: T[]): T[];

        /**
         * Returns a new list containing only one copy of each element in the original list, based upon the value returned by applying the supplied function to each list element. Prefers the first item if the supplied function produces the same value on two items. R.equals is used for comparison.
         */
        uniqBy<T,U>(fn: (a: T) => U, list: T[]): T[];
        uniqBy<T,U>(fn: (a: T) => U): (list: T[]) => T[];
        // uniqBy<T,U>: CurriedFn2<(a: T) => U, T[], T[]>;

        /**
         * Returns a new list containing only one copy of each element in the original list, based upon the value
         * returned by applying the supplied predicate to two list elements.
         */
        uniqWith<T,U>(pred: (x: T, y: T) => boolean, list: T[]): T[];
        uniqWith<T,U>(pred: (x: T, y: T) => boolean): (list: T[]) => T[];
        // uniqWith<T,U>: CurriedFn2<(x: T, y: T) => boolean, T[], T[]>;

        /**
         * Tests the final argument by passing it to the given predicate function. If the predicate is not satisfied,
         * the function will return the result of calling the whenFalseFn function with the same argument. If the
         * predicate is satisfied, the argument is returned as is.
         */
        unless<T,U>(pred: Pred<T>, whenFalseFn: (a: T) => U, obj: T): U;
        unless<T,U>(pred: Pred<T>, whenFalseFn: (a: T) => U): (obj: T) => U;
        // unless<T,U>: CurriedFn3<Pred<T>, (a: T) => U, T, U>;

        /**
         * Returns a new list by pulling every item at the first level of nesting out, and putting
         * them in a new array.
         */
        unnest<T>(x: T[][]): T[];
        unnest<T>(x: T[]): T[];

        /**
         * Takes a predicate, a transformation function, and an initial value, and returns a value of the same type as
         * the initial value. It does so by applying the transformation until the predicate is satisfied, at which point
         * it returns the satisfactory value.
         */
        until<T,U>(pred: Pred<T>, fn: (val: T) => U, init: U): U;
        until<T,U>(pred: Pred<T>, fn: (val: T) => U): (init: U) => U;
        until<T,U>(pred: Pred<T>): CurriedFn2<(val: T) => U, U, U>;
        // until<T,U>: CurriedFn3<Pred<T>, (val: T) => U, U, U>;

        /**
         * Returns a new copy of the array with the element at the provided index replaced with the given value.
         */
        update<T>(index: number, value: T, list: T[]): T[];
        update<T>(index: number, value: T): (list: T[]) => T[];
        update<T>(index: number): CurriedFn2<T,T[],T[]>
        // update<T>: CurriedFn3<number, T, T[], T[]>;

        /**
         * Accepts a function fn and a list of transformer functions and returns a new curried function.
         * When the new function is invoked, it calls the function fn with parameters consisting of the
         * result of calling each supplied handler on successive arguments to the new function.
         *
         * If more arguments are passed to the returned function than transformer functions, those arguments
         * are passed directly to fn as additional parameters. If you expect additional arguments that don't
         * need to be transformed, although you can ignore them, it's best to pass an identity function so
         * that the new function reports the correct arity.
         */
        useWith<T>(fn: (...args: any[]) => T, transformers: Function[]): (...args: any[]) => T;
        useWith<T>(fn: (...args: any[]) => T): (transformers: Function[]) => (...args: any[]) => T;
        // useWith<T>: CurriedFn2<(...args: any[]) => T, Function[], (...args: any[]) => T>;

        /**
         * Returns a list of all the enumerable own properties of the supplied object.
         * Note that the order of the output array is not guaranteed across
         * different JS platforms.
         */
        values<T>(obj: Struct<T>): T[];
        values<T>(obj: Object): any[];

        /**
         * Returns a list of all the properties, including prototype properties, of the supplied
         * object. Note that the order of the output array is not guaranteed to be consistent across different JS platforms.
         */
        valuesIn<T>(obj: Struct<T>): T[];
        valuesIn(obj: Object): any[];

        /**
         * Returns a "view" of the given data structure, determined by the given lens. The lens's focus determines which
         * portion of the data structure is visible.
         */
        // smart approach, unreliable:
        view<T,U>(lens: Lens<T,U>, obj: T): U;
        view<T,U>(lens: Lens<T,U>): (obj: T) => U;
        // view<T,U>: CurriedFn2<Lens<T,U>, T, U>;
        view(lens: UnknownLens, obj: Object): any;
        view(lens: UnknownLens): (obj: Object) => any;
        // view: CurriedFn2<UnknownLens, Object, any>;

        /**
         * Tests the final argument by passing it to the given predicate function. If the predicate is satisfied, the function
         * will return the result of calling the whenTrueFn function with the same argument. If the predicate is not satisfied,
         * the argument is returned as is.
         */
        when<T,U>(pred: Pred<T>, whenTrueFn: (a: T) => U, obj: T): U;
        when<T,U>(pred: Pred<T>, whenTrueFn: (a: T) => U): (obj: T) => U;
        when<T,U>(pred: Pred<T>): CurriedFn2<(a: T) => U, T, U>;
        // when<T,U>: CurriedFn3<Pred<T>, (a: T) => U, T, U>;

        /**
         * Takes a spec object and a test object and returns true if the test satisfies the spec.
         * Any property on the spec that is not a function is interpreted as an equality
         * relation.
         *
         * If the spec has a property mapped to a function, then `where` evaluates the function, passing in
         * the test object's value for the property in question, as well as the whole test object.
         *
         * `where` is well suited to declarativley expressing constraints for other functions, e.g.,
         * `filter`, `find`, etc.
         */
        // homogeneous version
        where<T>(spec: Dictionary<(v: T) => boolean>, testObj: Dictionary<T>): boolean;
        where<T>(spec: Dictionary<(v: T) => boolean>): (testObj: Dictionary<T>) => boolean;
        // where<T>: CurriedFn2<Dictionary<(v: T) => boolean>, Dictionary<T>, boolean>;
        // DIY "fill in the type params yourself" version
        where<T,U>(spec: T, testObj: U): boolean;
        where<T>(spec: T): <U>(testObj: U) => boolean;
        // where<T,U>: CurriedFn2<T, U, boolean>;
        // double param version??
        where<U>(spec: Dictionary<(x: any, y: any) => boolean>, testObj: U): boolean;
        where(spec: Dictionary<(x: any, y: any) => boolean>): <U>(testObj: U) => boolean;
        // where<U>: CurriedFn2<Dictionary<(x: any, y: any) => boolean>, U, boolean>;

       /**
        * Takes a spec object and a test object; returns true if the test satisfies the spec,
        * false otherwise. An object satisfies the spec if, for each of the spec's own properties,
        * accessing that property of the object gives the same value (in R.eq terms) as accessing
        * that property of the spec.
        */
        // homogeneous version
        whereEq<T>(spec: Dictionary<T>, testObj: Dictionary<T>): boolean;
        whereEq<T>(spec: Dictionary<T>): (testObj: Dictionary<T>) => boolean;
        // whereEq<T>: CurriedFn2<Dictionary<T>, Dictionary<T>, boolean>;
        // DIY "fill in the type params yourself" version
        whereEq<T,U>(spec: T, testObj: U): boolean;
        whereEq<T>(spec: T): <U>(testObj: U) => boolean;
        // whereEq<T,U>: CurriedFn2<T, U, boolean>;

        /**
         * Returns a new list without values in the first argument. R.equals is used to determine equality.
         * Acts as a transducer if a transformer is given in list position.
         */
        without<T>(list1: T[], list2: T[]): T[];
        without<T>(list1: T[]): (list2: T[]) => T[];
        // without<T>: CurriedFn2<T[], T[], T[]>;

        /**
         * Wrap a function inside another to allow you to make adjustments to the parameters, or do other processing
         * either before the internal function is called or with its results.
         */
        // deprecated: 0.22.0
        wrap<T>(fn: (...args: any[]) => any, wrapper: (...args: any[]) => T): (...args: any[]) => T;
        wrap<T>(fn: (...args: any[]) => any): (wrapper: (...args: any[]) => T) => (...args: any[]) => T;
        // wrap<T>: CurriedFn2<(...args: any[]) => any, (...args: any[]) => T, (...args: any[]) => T>;

        /**
         * Creates a new list out of the two supplied by creating each possible pair from the lists.
         */
        xprod<K,V>(as: K[], bs: V[]): KeyValuePair<K,V>[];
        xprod<K>(as: K[]): <V>(bs: V[]) => KeyValuePair<K,V>[];
        // xprod<K,V>: CurriedFn2<K[], V[], KeyValuePair<K,V>[]>;

        /**
         * Creates a new list out of the two supplied by pairing up equally-positioned items from
         * both lists. Note: `zip` is equivalent to `zipWith(function(a, b) { return [a, b] })`.
         */
        zip<K,V>(list1: K[], list2: V[]): KeyValuePair<K,V>[];
        zip<K>(list1: K[]): <V>(list2: V[]) => KeyValuePair<K,V>[];
        // zip<K,V>: CurriedFn2<K[], V[], KeyValuePair<K,V>[]>;

        /**
         * Creates a new object out of a list of keys and a list of values.
         */
        // TODO: Dictionary<T> as a return value is to specific, any seems to loose
        zipObj<T>(keys: string[], values: T[]): Dictionary<T>;
        zipObj(keys: string[]): <T>(values: T[]) => Dictionary<T>;
        // zipObj<T>: CurriedFn2<string[], T[], Dictionary<T>>;


        /**
         * Creates a new list out of the two supplied by applying the function to each
         * equally-positioned pair in the lists.
         */
        zipWith<T, U, TResult>(fn: (x: T, y: U) => TResult, list1: T[], list2: U[]): TResult[];
        zipWith<T, U, TResult>(fn: (x: T, y: U) => TResult, list1: T[]): (list2: U[]) => TResult[];
        zipWith<T, U, TResult>(fn: (x: T, y: U) => TResult): CurriedFn2<T[], U[], TResult[]>;
        // zipWith<T, U, TResult>: CurriedFn3<(x: T, y: U) => TResult, T[], U[], TResult[]>;

    }
}

export = R;