
Accession Number : ADA289358
Title : Solving Recursive Domain Equations with Enriched Categories.
Descriptive Note : Doctoral thesis,
Corporate Author : CARNEGIEMELLON UNIV PITTSBURGH PA DEPT OF COMPUTER SCIENCE
Personal Author(s) : Wagner, Kim R.
PDF Url : ADA289358
Report Date : JUL 1994
Pagination or Media Count : 107
Abstract : Both preorders and metric spaces have been used at various times as a foundation for the solution of recursive domain equations in the area of denotational semantics. In both cases the central theorem states that a'converging' sequence of 'complete' domains/spaces with 'continuous'retraction pairs between them has a limit in the category of complete domains/spaces with retraction pairs as morphisms. The preorder version was discovered first by Scott in 1969, and is referred to as Scott's inverse limit theorem. The metric version was mainly developed by de Bakker and Zucker and refined and generalized by America and Rutten. The theorem in both its versions provides the main tool for solving recursive domain equations. The proofs of the two versions of the theorem look astonishingly similar, but until now the preconditions for the preorder and the metric versions have seemed to be fundamentally different. In this thesis we establish a more general theory of domains based on the notions of enriched categories, and prove Scott's inverse limit theorem in this theory. The metric and preorder versions are special cases, obtained just by using different logics as parameter to the general theory.
Descriptors : *PROGRAMMING LANGUAGES, *PROBLEM SOLVING, *RECURSIVE FUNCTIONS, SEMANTICS, THESES, CONCURRENT ENGINEERING, MATHEMATICAL PROGRAMMING, SOLUTIONS(GENERAL), APPROXIMATION(MATHEMATICS), CONVERGENCE, SEQUENCES(MATHEMATICS), CAUCHY PROBLEM, MATHEMATICAL LOGIC.
Subject Categories : Computer Programming and Software
Operations Research
Theoretical Mathematics
Distribution Statement : APPROVED FOR PUBLIC RELEASE