Path: csiph.com!v102.xanadu-bbs.net!xanadu-bbs.net!usenet.blueworldhosting.com!feeder01.blueworldhosting.com!news.misty.com!news.iecc.com!.POSTED!nerds-end
From: Another anonymous coward <dog@gmail.com>
Newsgroups: comp.compilers
Subject: How does Haskell ...?
Date: Fri, 6 Mar 2015 10:06:41 +0000 (UTC)
Organization: Compilers Central
Lines: 16
Sender: news@iecc.com
Approved: comp.compilers@iecc.com
Message-ID: <15-03-003@comp.compilers>
NNTP-Posting-Host: news.iecc.com
Mime-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit
X-Trace: miucha.iecc.com 1425676285 50100 2001:470:1f07:1126:0:676f:7373:6970 (6 Mar 2015 21:11:25 GMT)
X-Complaints-To: abuse@iecc.com
NNTP-Posting-Date: Fri, 6 Mar 2015 21:11:25 +0000 (UTC)
Keywords: Haskell, question
Posted-Date: 06 Mar 2015 16:11:25 EST
X-submission-address: compilers@iecc.com
X-moderator-address: compilers-request@iecc.com
X-FAQ-and-archives: http://compilers.iecc.com
Xref: csiph.com comp.compilers:1539

In the decades that PASCAL was popular, I built recursive descent
compilers, for P-code interpreters.

For explaining my <Haskell query>, my present knowlegde could compile:

LHS := Char(Mod(64,Randon(date) + Max(1,-3))

I just sucked that out of my finger, as an example of an expression.
Are <horn clauses - from Prolog> relevant ?
It's very annoying to repeatedly read that <Haskell finds the sequence
of statements needed to provide the answer>.
It reminds me of the smart-arses who followed the herd during the economic
boom.

== TIA.