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

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

    Research output: Contribution to journalArticleAcademicpeer-review

    6 Downloads (Pure)

    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 languageEnglish
    Pages (from-to)35-52
    Number of pages18
    JournalTopology and its Applications
    Volume85
    Issue number1-3
    DOIs
    Publication statusPublished - 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