Local fixpoint iteration describes a technique that restricts in function spaces to needed arguments only. It has been studied well for first-order functions abstract interpretation and also model checking. Here we consider the problem least greatest fixpoints of arbitrary type order. We define an algebra simply-typed higher-order with order express evaluation problems as they occur routinely v...

Notions of guardedness serve to delineate admissible recursive definitions in various settings a compositional manner. In recent work, we have introduced an axiomatic notion symmetric monoidal categories, which serves as unifying framework for examples from program semantics, process algebra, and beyond. the present paper, propose generic metalanguage guarded iteration based on combining this w...