Effectively giving domains
Smyth, M. B. (1975) Effectively giving domains. Coventry, UK: Department of Computer Science..Full text not available from this repository.
Official URL: http://eprints.dcs.warwick.ac.uk/1132/1/cs-rr-009....
A definition of the notion of an effectively given continuous cpo is provided. The importance of the notion lies in the fact that we can readily characterize the computable (partial) functions of arbitrary finite type over an effectively given domain. We show that the definition given here is closed under several important domain constructions, namely sum, product, function space , power domain and inverse limits (the last two in a restricted form); this permits recursive domain equations to be solved effectively.
|Subjects:||Q Science > QA Mathematics > QA75 (Please use QA76 Electronic Computers. Computer Science)|
|Divisions:||Faculty of Science > Computer Science|
|Publisher:||Department of Computer Science|
|Place of Publication:||Coventry, UK|
|Institution:||University of Warwick|
|Theses Department:||Department of Computer Science|
|Status:||Not Peer Reviewed|
|Access rights to Published version:||Restricted or Subscription Access|
Actions (login required)