| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 424389 | Electronic Notes in Theoretical Computer Science | 2007 | 20 Pages |
Abstract
We generalise the traditional approach of Smyth and Plotkin to the solution of recursive domain equations from order-enriched structures to bicategorical ones and thereby develop a bicategorical theory for recursively defined domains in accordance with Axiomatic Domain Theory.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
