home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: comp.theory
- Path: sparky!uunet!wupost!tulane!fs
- From: fs@cs.tulane.edu (Frank Silbermann)
- Subject: Re: Fixed point semantics
- Nntp-Posting-Host-[nntpd-4753]: caesar
- Message-ID: <1992Sep11.171438.4816@cs.tulane.edu>
- Sender: news@cs.tulane.edu
- Organization: Computer Science Dept., Tulane Univ., New Orleans, LA
- References: <1992Sep7.172738@cs.utwente.nl> <1992Sep9.065818.9053@odin.diku.dk>
- Date: Fri, 11 Sep 1992 17:14:38 GMT
- Lines: 37
-
-
- skow@cs.utwente.nl
- Jacek Skowronek:
- >> What does it mean when "a language gives
- >> a least fixed point semantics"?
-
- <1992Sep9.065818.9053@odin.diku.dk> rose@diku.dk
- (Mads Rosendahl):
- > Fixed Point Semantics is often used for the kind
- > of Denotational Semantics which is based on Domain Theory
-
- Stoy writes that Scott invented Domain Theory to give
- Denotational Semantics on a firm mathematical foundation.
- So what kind of denotational semantics is _not_ based
- (at least implicitly) on domain theory?
-
- > and where one does not require the semantics in some sense
- > to be computable (ie. based on the lambda calculus).
-
- It is my impression that the language of Domain Theory
- _is_ a lambda notation, albeit one that was specifically
- created to represent elements of a pre-conceived mathematical
- model (the domain).
-
- As for Domain Theory not being computable, I thought the notion
- of _continuity_ (a notion which permeates domain theory)
- which was motivated by the desire to ensure computability.
-
- If you rely only on continuous operations over continuous
- domains, then how can the semantics be uncomputable?
- Chapter 10 of David Schmidt's text discusses work
- by Uwe Pleban and others on use of denotational semantics
- as an interpreter-generator.
-
- ------------------------------------------
- Frank Silbermann fs@cs.tulane.edu
- Tulane University New Orleans, Louisiana USA
-