Banach's fixed-point theorem as a base for data-type equations (Q1330915): Difference between revisions
From MaRDI portal
Latest revision as of 10:51, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Banach's fixed-point theorem as a base for data-type equations |
scientific article |
Statements
Banach's fixed-point theorem as a base for data-type equations (English)
0 references
10 August 1994
0 references
The paper develops a theory of data types in categories enriched by CMS (complete metric spaces) analogous to the theory in categories enriched by CPO (complete posets). In this case for a category \({\mathcal K}\) of data types solutions of recursive data-type equations \(X\cong T(X)\), where \(T:{\mathcal K}\to{\mathcal K}\) is a locally continuous endofunctor, can be constructed by iterating \(T\) on the unique arrow \(T:1\to 1\). For CMS enriched categories it is proved that in an analogous manner a solution can be found for data-type equations \(X\cong T(X)\), where \(T\) is a contracting functor, and that this solution is unique.
0 references
enriched catgegories
0 references
data type theory
0 references
0 references