Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.compilers > #1539 > unrolled thread
| Started by | Another anonymous coward <dog@gmail.com> |
|---|---|
| First post | 2015-03-06 10:06 +0000 |
| Last post | 2015-03-06 10:06 +0000 |
| Articles | 1 — 1 participant |
Back to article view | Back to comp.compilers
How does Haskell ...? Another anonymous coward <dog@gmail.com> - 2015-03-06 10:06 +0000
| From | Another anonymous coward <dog@gmail.com> |
|---|---|
| Date | 2015-03-06 10:06 +0000 |
| Subject | How does Haskell ...? |
| Message-ID | <15-03-003@comp.compilers> |
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.
Back to top | Article view | comp.compilers
csiph-web