Oracle FAQ Your Portal to the Oracle Knowledge Grid
HOME | ASK QUESTION | ADD INFO | SEARCH | E-MAIL US
 

Home -> Community -> Usenet -> comp.databases.theory -> Re: Declarative constraints in practical terms

Re: Declarative constraints in practical terms

From: <ralphbecket_at_gmail.com>
Date: 1 Mar 2006 19:00:40 -0800
Message-ID: <1141268440.481721.175070@e56g2000cwe.googlegroups.com>

vc wrote:
> It's a fascinating statement in the light of more than 40 years of
> denotational semantics history for imperative languages.

Yes, and it's taken that amount of time to achieve rather limited results. I admit that the word "useful" is a value judgement, but are you really disputing the difference between "*easy* to reason about" and "*possible* to reason about (to a very limited extent and then only after a great expenditure of effort)"?

> On the other
> hand, all the 'pure' languages can have operational semantics
> (Mercury/Prolog ->WAM).

They all have to run on something, but how that happens is not (cannot be) mandated by a pure language.

Received on Wed Mar 01 2006 - 21:00:40 CST

Original text of this message

HOME | ASK QUESTION | ADD INFO | SEARCH | E-MAIL US