Denotational semantics

compilers@ima.UUCP
16 Jan 86 16:20:00 GMT

          From comp.compilers
Related articles
Re: denotational semantics compilers@ima.UUCP (1986-01-07)
Denotational Semantics compilers@ima.UUCP (1986-01-09)
denotational semantics compilers@ima.UUCP (1986-01-10)
Re: denotational semantics compilers@ima.UUCP (1986-01-15)
Denotational semantics compilers@ima.UUCP (1986-01-16)
| List of all articles for this month |
From: compilers@ima.UUCP
Newsgroups: mod.compilers
Date: 16 Jan 86 16:20:00 GMT
Article-I.D.: ima.136300060
Posted: Thu Jan 16 11:20:00 1986

[from harvard!seismo!mcvax!euroies.UUCP!rshepherd]


Ideally the denotational semantics of a languages supplies its underpinning,
for practical purposes there are better techniques around for dealing with
language semantics. For example with OCCAM we have an underpinning based
on both denotational semantics (for the sequential part of the language)
and on a CSP-like failure set model (for the concurrent part). For practical
purposes it is best to use an algebraic semantics; for example, in
occam there is an equivalence between message passing
and assignment,


CHAN c : is equivalant to
PAR
    c ! e
      c ? v v := e


this algebraic law is underpinned (mathematically).
Roger Shepherd INMOS (...!euroies!rshepherd)




Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.