scientific article; zbMATH DE number 3949678

From MaRDI portal
Publication:3719794





[For the entire collection see Zbl 0568.00021.] The author presents a semantic description of ALGOL-like languages with a rich type structure, procedures of arbitrarily complex types, imperative capabilities and block structure. His approach intends to capture the intuitively clear fact that during the execution of a program (in a language with stack discipline) not only the store is changed, but also the shape of the store changes during block entrances and block exits. Semantic considerations are reduced to an abstract language (Basic Desugared ALGOL) which represents the important structural features of a typed programming language and is built over the poset \({\mathcal T}\) of all phrase types (this set can be viewed as a free type algebra and this approach is developed in the second part of the paper), the set Id of identifiers and the typed set G of generators (derived from the operators). The fundamental idea of the semantic approach consists in defining the meaning of a phrase type as a functor from the category \(\Sigma\) of store shapes into the category \({\mathcal P}dom\) of predomains. Then the denotation of a phrase \(\ell\), dependent on a phrase type assignment and a store shape, is interpreted as a natural transformation from an enrivonment determined by the phrase type assignment (and which is a functor from \(\Sigma\) into \({\mathcal P}dom)\) to a meaning of the corresponding type (which is again a functor from \(\Sigma\) into \({\mathcal P}dom)\).




Cited in
(27)








This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3719794)