In this thesis we focus on the problem of reasoning about the space and time usage of functional programs. Such reasoning is less straightforward than for imperative programs, due to the lack of explicit control flow and memory management that is inherent in the functional style. Our approach to making such information explicit is to consider the behaviour of an underlying abstract machine for executing functional programs, at which level both control flow, and the additional data structures required for execution, are manifest.