In denotational semantics, the family of relational models and their extensions has been recently under intense study. One of their distinct advantage is that they enjoy syntactic presentations as non-idempotent intersection type systems or under the guise of the Taylor expansion of 𝜆-terms. While the denotational picture is important to design these syntactic tools, their subsequent theory consists of syntax-directed inductive rules that can be manipulated by elementary means. But while very expressive, these models only record traces of complete computations and lack an account of partial computations as they progress over time. Time can be addressed via the related game semantics models, but those have a more elaborate combinatorial structure – visible in particular in the composition of strategies – that is harder to present syntactically. In this paper, we provide a syntactic presentation of the interpretation of PCF in the model of thin concurrent games, which subsumes its interpretation in many traditional models. More precisely, we propose a rigid intersection type system letting us associate with any term a groupoid of approximants additionally equipped with a partial order accounting for time. Our main result is that this groupoid (along with companion groupoids for types) coincides with a similar ordered groupoid representing the thin concurrent games interpretation. To prove the connection, we bridge the two via a new intermediate model we introduce, called ordered thin spans, which extend the recently introduced thin spans of Clairambault and Forest with partial orders both on states and their symmetries, accounting for time.