The Library

Effectively giving domains

Tools

Smyth, M. B. (1975) Effectively giving domains. Coventry, UK: Department of Computer Science..

Full text not available from this repository.

Abstract

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.

Item Type: Report
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
Date: June 1975
Identification Number: CS-RR-009
Institution: University of Warwick
Theses Department: Department of Computer Science
Status: Not Peer Reviewed
Publication Status: Published
Access rights to Published version: Restricted or Subscription Access
Related URLs:
URI: http://wrap.warwick.ac.uk/id/eprint/46305

Request changes to a record

Actions (login required)

View Item View Item