{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:24:53Z","timestamp":1761611093243},"reference-count":0,"publisher":"Cambridge University Press (CUP)","issue":"5","license":[{"start":{"date-parts":[[1997,10,1]],"date-time":"1997-10-01T00:00:00Z","timestamp":875664000000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Struct. Comp. Sci."],"published-print":{"date-parts":[[1997,10]]},"abstract":"<jats:p><jats:italic>Domain-theoretic<\/jats:italic> categories are axiomatised by means of\n categorical \nnon-order-theoretic \nrequirements on a cartesian closed category equipped with a commutative\n monad. \nIn this \npaper we prove an <jats:italic>enrichment theorem<\/jats:italic> showing that every axiomatic \ndomain-theoretic \ncategory can be endowed with an <jats:italic>intensional<\/jats:italic> notion of approximation,\n the \n<jats:italic>path relation<\/jats:italic>, with respect to which the category <jats:bold>Cpo<\/jats:bold>-enriches.<\/jats:p><jats:p>Our analysis suggests more liberal notions of domains. In particular,\n we \npresent a category \nwhere the path order is <jats:italic>not<\/jats:italic> \u03c9-complete, but in which \nthe constructions of domain theory \n(such as, for example, the existence of uniform fixed-point \noperators and the solution of domain equations) are available.<\/jats:p>","DOI":"10.1017\/s0960129597002429","type":"journal-article","created":{"date-parts":[[2002,7,27]],"date-time":"2002-07-27T13:29:40Z","timestamp":1027776580000},"page":"591-618","source":"Crossref","is-referenced-by-count":6,"title":["An enrichment theorem for an axiomatisation of \ncategories of domains and continuous functions"],"prefix":"10.1017","volume":"7","author":[{"given":"MARCELO P.","family":"FIORE","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[1997,10,1]]},"container-title":["Mathematical Structures in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0960129597002429","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,11]],"date-time":"2019-05-11T20:12:42Z","timestamp":1557605562000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0960129597002429\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,10]]},"references-count":0,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1997,10]]}},"alternative-id":["S0960129597002429"],"URL":"https:\/\/doi.org\/10.1017\/s0960129597002429","relation":{},"ISSN":["0960-1295","1469-8072"],"issn-type":[{"value":"0960-1295","type":"print"},{"value":"1469-8072","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,10]]}}}