home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: comp.lang.prolog
- Path: sparky!uunet!spool.mu.edu!agate!doc.ic.ac.uk!warwick!qmw-dcs!dc
- From: dc@dcs.qmw.ac.uk (Daniel Cohen)
- Subject: Re: Prolog is declarative
- Message-ID: <1993Jan22.114357.13172@dcs.qmw.ac.uk>
- Sender: usenet@dcs.qmw.ac.uk (Usenet News System)
- Nntp-Posting-Host: guinness.dcs.qmw.ac.uk
- Organization: Computer Science Dept, QMW, University of London
- References: <90458@ncratl.AtlantaGA.NCR.COM> <1993Jan22.023622.23284@latcs1.lat.oz.au>
- Date: Fri, 22 Jan 1993 11:43:57 GMT
- Lines: 25
-
- In <1993Jan22.023622.23284@latcs1.lat.oz.au> jacob@latcs1.lat.OZ.AU (Jacob L. Cybulski) writes:
- >
- >|> What other languages are declarative?
- >E.g. SQL, SNOBOL
- >
- >|> What term describes languages which are not declarative?
- >Procedural - e.g. Cobol
- >Functional - e.g. Lisp
-
- This seems a little unfair to the functional programming paradigm.
- I know that Lisp as used by most Lisp programmers is about as
- non-declarative as you can get, but pure functional programming has a
- declarative reading just like pure logic programming, only the language
- involved is that of mathematics rather than logic. Just interpret
- function calls as mathematical expressions with some value, and
- function definitions as definitions of mathematical functions.
-
- I suspect that declarativeness in a language is closely related to the
- degree of referential transparency in the language; any alternative
- formulations?
-
- Daniel Cohen Department of Computer Science
- Email: dc@dcs.qmw.ac.uk Queen Mary and Westfield College
- Tel: +44 71 975 5245/4/9 Mile End Road, London E1 4NS, UK
- Fax: +44 81 980 6533 *** Glory, Glory, Hallelujah ***
-