There are some cstheory questions that touches function-problems. Like this: Complexity class corresponding to sorting
So here is the question: Is there good literature about the computational complexity of functions problems? Especially, but not limited to that, about functions-problems with polynomial space bound.