home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!pipex!bnr.co.uk!uknet!mucs!m1!bevan
- From: bevan@cs.man.ac.uk (Stephen J Bevan)
- Newsgroups: comp.programming
- Subject: Re: Programming by Description of Output...
- Message-ID: <BEVAN.93Jan4163218@panda.cs.man.ac.uk>
- Date: 4 Jan 93 16:32:18 GMT
- References: <BEVAN.92Dec31202001@panda.cs.man.ac.uk> <1993Jan1.043329.27160@netcom.com>
- <BEVAN.93Jan1134444@panda.cs.man.ac.uk>
- <1993Jan4.045009.2471@cs.cornell.edu>
- Sender: news@cs.man.ac.uk
- Organization: Department of Computer Science, University of Manchester
- Lines: 20
- In-reply-to: karr@cs.cornell.edu's message of 4 Jan 93 04:50:09 GMT
-
- In article <1993Jan4.045009.2471@cs.cornell.edu> karr@cs.cornell.edu (David Karr) writes:
- A denotational semantics of a programming language is a formal spec of
- the language itself; strangely (or perhaps not so strangely), such specs
- *are* executable in Standard ML.
-
- [ Shouldn't that be "in, for example, Standard ML" since almost any
- (programming) language can be used as the meta-language for a
- definition? ]
-
- 1. Many (most?) denotational definitions are not as abstract as they
- could be, i.e. they often overspecify the language. This is
- particularly true of denotational definitions of the context
- conditions (static semantics if you prefer) of languages.
-
- 2. I've seen some denotational definitions executed (I've even written
- some), but I've never seen an _executable_ definition of "real"
- language containing some form of parallelism. This is not to say
- it can't be done; examples to the contrary are welcome.
-
- bevan
-