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

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

    Onderzoeksoutput: Bijdrage aan tijdschriftTijdschriftartikelAcademicpeer review

    29 Citaten (Scopus)
    6 Downloads (Pure)

    Samenvatting

    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.
    Originele taal-2Engels
    Pagina's (van-tot)35-52
    Aantal pagina's18
    TijdschriftTopology and its Applications
    Volume85
    Nummer van het tijdschrift1-3
    DOI's
    StatusGepubliceerd - 1998

    Vingerafdruk

    Duik in de onderzoeksthema's van 'Denotational models for programming languages : applications of Banach's fixed point theorem'. Samen vormen ze een unieke vingerafdruk.

    Citeer dit