2014/06/09 by Wolfgang Jeltsch
Computer Science · #cs.PL #cs.LO
paper · pdf · doi:10.4204/eptcs.153.9
published as EPTCS 153, 2014, pp. 127-142 · In Proceedings MSFP 2014, arXiv:1406.1534
arxiv created 2014/06/09 · arxiv updated 2014/06/10
Functional reactive programming (FRP) makes it possible to express temporal aspects of computations in a declarative way. Recently we developed two kinds of categorical models of FRP: abstract process categories (APCs) and concrete process categories (CPCs). Furthermore we showed that APCs generalize CPCs. In this paper, we extend APCs with additional structure. This structure models recursion and corecursion operators that are related to time. We show that the resulting categorical models generalize those CPCs that impose an additional constraint on time scales. This constraint boils down to ruling out ω-supertasks, which are closely related to Zeno's paradox of Achilles and the tortoise.