This paper presents a general framework for the analysis of programs over an infinite horizon in continuous time. Sufficient conditions for the existence of an optimal program are derived and are shown to reduce to the condition that the underlying preference ordering exhibit impatience in a topology determined by the underlying technology.