The Bicategory-Theoretic Solution of Recursive Domain Equations

Authors:
Gian Luca Cattani;Marcelo P. Fiore
Affiliations:
ds Data Systems S.p.A., Parma, Italy;Computer Laboratory, University of Cambridge, Cambridge, UK
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2007

Citing 6
Cited 0

Axiomatic domain theory in categories of partial maps

Axiomatic domain theory in categories of partial maps
On Semantic Foundations for Applicative Multiprogramming

Proceedings of the 10th Colloquium on Automata, Languages and Programming
A Theory of Recursive Domains with Applications to Concurrency

LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Topical categories of domains

Mathematical Structures in Computer Science
On categories generalizing universal domains

Mathematical Structures in Computer Science
A categorical generalization of Scott domains

Mathematical Structures in Computer Science

Quantified Score

Hi-index	0.00

Visualization

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.