Banach's fixed-point theorem as a base for data-type equations (Q1330915): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Q4044767 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving reflexive domain equations in a category of complete metric spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metric interpretations of infinite trees and semantics of non deterministic recursive programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Processes and the denotational semantics of concurrency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5649639 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Category-Theoretic Solution of Recursive Domain Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-point constructions in order-enriched categories / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf00878504 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2058067778 / rank
 
Normal rank

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
    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

    Identifiers