Abstract Temporal stream logic (TSL) extends LTL with updates and predicates over arbitrary function terms. This allows for specifying data-intensive systems which is not expressive enough. In the semantics of TSL, functions are left uninterpreted. this paper, we extend TSL first-order theories, enabling us to specify using interpreted such as incrementation or equality. We investigate satisfia...