Abstract
For an abstract programming language both a linear and a branching denotational semantics are developed. The main instrument for the construction of the two models and for the semantical operators involved is the classical Banach Fixed Point Theorem. Via higher-order transformations the various semantical definitions are justified by their characterization as—necessarily unique—fixed points of contractions on a complete metric space. Additionally the Banach Theorem proves itself useful in relating the two models presented.
| Original language | English |
|---|---|
| Pages (from-to) | 35-52 |
| Number of pages | 18 |
| Journal | Topology and its Applications |
| Volume | 85 |
| Issue number | 1-3 |
| DOIs | |
| Publication status | Published - 1998 |
Fingerprint
Dive into the research topics of 'Denotational models for programming languages : applications of Banach's fixed point theorem'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver