Re: denotational semantics

compilers@ima.UUCP
7 Jan 86 16:24: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 |
Relay-Version: version B 2.10.2 9/12/84; site mit-hermes.ARPA
Posting-Version: Notesfiles $Revision: 1.6.2.16 $; site ima.UUCP
From: compilers@ima.UUCP
Newsgroups: mod.compilers
Date: 7 Jan 86 16:24:00 GMT
Article-I.D.: ima.136300031
Posted: Tue Jan 7 11:24:00 1986
Date-Received: 9 Jan 86 13:03:50 GMT
Nf-ID: #N:ima:136300031:000:748
Nf-From: ima!compilers Jan 7 11:24:00 1986



[from ]


      When I read a denotational semantics, I think of it as an
operational semantics written in Scheme (a small Lisp dialect closely
resembling the lambda calculus). Such games as making up
statically-scoped functions on the fly and passing multiple
continuations are standard coding practice in Scheme, but appear
nearly inpenetrable, I would imagine, to a person trained solely in
traditional algorithmic languages.


      One neat aspect of looking at things this way is that it is
conceivably possible to write a meta-interpreter that can interpret
any language, given its denotational semantics. (I believe that this
has sort of been done: Peter Mosses' SIS (Semantic Interpretation
System)?)


-- Richard Schooler
Intermetrics, Inc.


Post a followup to this message

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