Smyth, M. B. (Michael B.) (1975) Effectively giving domains. University of Warwick. Department of Computer Science. (Theory of Computation Report). (Unpublished)

Preview

Text WRAP_Smyth_cs-rr-009.pdf - Published Version Download (1707Kb) | Preview

Request Changes to record.

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
Divisions:	Faculty of Science > Computer Science
Library of Congress Subject Headings (LCSH):	Partially ordered sets, Continuous lattices
Series Name:	Theory of Computation Report
Publisher:	University of Warwick. Department of Computer Science
Official Date:	June 1975
Dates:	Date Event June 1975 ["eprint_fieldopt_dates_date_type_available" not defined]
Date of first compliant deposit:	1 August 2016
Number:	Number 9
Number of Pages:	26
DOI:	CS-RR-009
Institution:	University of Warwick
Theses Department:	Department of Computer Science
Status:	Not Peer Reviewed
Publication Status:	Unpublished
Access rights to Published version:	Restricted or Subscription Access
Funder:	Science Research Council (Great Britain) (SRC)

Request changes or add full text files to a record

Repository staff actions (login required)

View Item

Downloads