Transfinite corecursion
Härmel Nestra · 2005
This paper presents which enable to define transfinite semantics for programming languages easily. We call these theorems because they state the existence of a function satisfying certain conditions analogous to the usual corecurrent equations for defining stream-valued functions.Transfinite semantics have been proposed for overcoming the semantic anomaly of program slicing. In this paper, we define two example semantics which justify this approach, relying on our corecursion theorems.