I strongly support this. I edit on Wikispecies, and not having access Magnolia Press' journals feels like a massive hole. I am particularly interested in Zootaxa (my scope is limited to Animalia).

Ran into this today. See e.g. the test cases for Z12427/is prime - for several of the "is not prime" tests (for a specific example, test "2147483647^2 is not prime", implementation "is prime (Python)"), the test displays as "Passed" for a number of implementations, but clicking on the details reveals that the test had an error: "Reached time limit in evaluator".

Implementing this particular function (Z13322/is sorted) using fold left seems to be impossible, at current. Implementing "is sorted" for a particular comparison function should be possible using fold left, but implementing it for an arbitrary comparison function does not seem to be possible, from my understanding (it could be implemented by creating another version of fold left that passes additional arguments to the applied function... but that would get unwieldly). Quick mockup of how I might write it in OCaml:

let is_sorted (comp_fun : 'a -> 'a -> bool) (lst : 'a list) =
    let helper (acc : bool * 'a) (elem : 'a) =
        match acc with
        | (sorted, last) -> (sorted && (comp_fun last elem), elem)
    in
    match List.fold_left helper (true, List.hd lst) lst with
    | (res, _) -> res

(This specific implementation wouldn't work for empty lists, but that's besides the point.)
If this was to be translated into a function composition, it would not be possible, because there would not be a helper function closure that has access to the comp_fun variable. Some other form of fold/reduce would have to be made that calls the given function with an additional argument.

See also T386422 - didn't notice that when I made this. However, these tickets have not-entirely-overlapping scopes (the other is asking for currying/partial function application, this is asking in part for anonymous/inline functions).