Fixpoint operators for domain equations
Power, J. and Rosolini, G., 2002. Fixpoint operators for domain equations. Theoretical Computer Science, 278 (1-2), pp. 323-333.
Related documents:This repository does not currently have the full-text of this item.
You may be able to access a copy if URLs are provided below.
We investigate previous termfixpointnext termprevious termoperatorsnext term for previous termdomainnext termprevious termequationsnext term. It is routine to verify that if every endofunctor on a category has an initial algebra, then one can construct a previous termfixpointnext termprevious termoperatornext term from the category of endofunctors to the category. That construction does not lift routinely to enriched categories, using the usual enriched notion of initiality of an endofunctor. We show that by embedding the 2-category of small enriched categories into the 2-category of internal categories of a presheaf topos, we can recover the previous termfixpointnext term construction elegantly. Also, we show that in the presence of cotensors, an enriched category allows the previous termfixpointnext term construction.
|Creators||Power, J.and Rosolini, G.|
|Departments||Faculty of Science > Computer Science|
|Additional Information||Mathematical foundations of programming semantics (Boulder, CO, 1996)|
Actions (login required)