Denotational models for programming languages: Applications of Banach's fixed point theorem

DOI10.1016/S0166-8641(97)00140-5zbMath0933.68086MaRDI QIDQ1295293

E. P. de Vink, J. W. de Bakker

Publication date: 20 July 1999

Published in: Topology and its Applications (Search for Journal in Brave)

Mathematics Subject Classification ID

68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)

03B70: Logic in computer science

68Q55: Semantics in the theory of computing

Related Items

Unnamed Item, Denotational semantics for programming languages, balanced quasi-metrics and fixed points, On the structure of the space of complexity partial functions, Metric semantics for true concurrent real time, Hyperspaces of a weightable quasi-metric space: application to models in the theory of computation, The Banach fixed point theorem in fuzzy quasi-metric spaces with application to the domain of words, CPO semantics of timed interactive actor networks, The Hausdorff fuzzy quasi-metric, Coincidence and fixed points for maps on topological spaces, The complexity space of partial functions: a connection between complexity analysis and denotational semantics, A quasi-metric computational model from modular functions on monoids

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving reflexive domain equations in a category of complete metric spaces
• Contractions in comparing concurrency semantics
• A timed model for communicating sequential processes
• Towards a foundation for semantics in complete metric spaces
• Fully abstract denotational models for nonuniform concurrent languages
• A lattice-theoretical fixpoint theorem and its applications
• Sur une méthode de métrisation complète de certains espaces d'ensembles compacts
• Processes and the denotational semantics of concurrency