@sig(["a"]/ H[(Ord, "a")] >> ["a"])
def sort(xs):
    """
    sort :: Ord a => [a] -> [a]

    The sort function implements a stable sorting algorithm. It is a special
    case of sortBy, which allows the programmer to supply their own comparison
    function.

    Note: Current implementation is not lazy
    """
    return L[sorted(xs)]
dataset/ETHPy150Open billpmurphy/hask/hask/Data/List.py/sort/swapped operands of `/`