|
Title
|
|
|
|
Towards "dynamic domains" : totally continuous cocomplete Q-categories
|
|
|
Author
|
|
|
|
|
|
|
Abstract
|
|
|
|
| It is common practice in both theoretical computer science and theoretical physics to describe the (static) logic of a system by means of a complete lattice. When formalizing the dynamics of such a system, the updates of that system organize themselves quite naturally in a quantale, or more generally, a quantaloid. In fact, we are led to consider cocomplete quantaloid-enriched categories as a fundamental mathematical structure for a dynamic logic common to both computer science and physics. Here we explain the theory of totally continuous cocomplete categories as a generalization of the well-known theory of totally continuous suplattices. That is to say, we undertake some first steps towards a theory of "dynamic domains". (c) 2007 Elsevier B.V. All rights reserved. |
|
|
|
Language
|
|
|
|
English
|
|
|
Source (journal)
|
|
|
|
Theoretical computer science. - Amsterdam
|
|
|
Source (book)
|
|
|
|
21st Annual Conference on Mathematical Foundations of Programming, Semantics (MFPS XXI), MAY 17-21, 2005, Univ Birmingham, Birmingham, ENGLAND
|
|
|
Publication
|
|
|
|
Amsterdam
:
2007
|
|
|
ISSN
|
|
|
|
0304-3975
|
|
|
DOI
|
|
|
|
10.1016/J.TCS.2007.01.002
|
|
|
Volume/pages
|
|
|
|
373
:1-2
(2007)
, p. 142-160
|
|
|
ISI
|
|
|
|
000245499700007
|
|
|
Full text (Publisher's DOI)
|
|
|
|
|
|
|
Full text (publisher's version - intranet only)
|
|
|
|
|
|