Ordered Logic is a substructural logic that has been conceived to reason about hypotheses that cannot be exchanged. We explore the transition from ordered lambda calculus (OLC) to a calculus for managing typestate in programming languages. Starting from the logical foundations, we consider some early applications of ordered logic to memory management that highlight some limitations of OLC. We then shift focus to typestate with borrowing and explain the adaptations that have to be applied to previous calculi to handle this feature set.