Abstract
In a class of categories, including E. Manes's assertional ones, the control structures if-then-else and repeat-until are modeled as natural transformations of suitable functors. This context show how the three basic pieces of any structured programming language (concatenation, conditional and recursion) share naturality.
∗Supported by a Research Project of the Galicia Government
∗Supported by a Research Project of the Galicia Government
Notes
∗Supported by a Research Project of the Galicia Government