Hume is a domain-specific language for resource-constrained systems, such as real-time embedded systems. It combines an asynchronous process layer with a purely functional expression layer. This talk describes a new stack and heap analysis for PR-Hume, the version of Hume with primitive recursive functions and data structures. The analysis derives good upper bounds for a number of recursive programs.