Re: Translating circular Haskell code to lisp

On 29 May, 13:00, "Alex Mizrahi" <udode...@xxxxxxxxxxxxxxxxxxxxx>
wrote:
 ??>> On top of that: Why would that matter? Code should be clear and easy
to
 ??>> read, not clever and hard to understand...

 pa> I obviously agree that we should strive for clear code wherever
 pa> possible but sometimes we have to do messy things to our programs to
 pa> get them to run acceptably quickly

sure, but how does that relate to Haskell code? i'm pretty sure it's both
cryptic
and slow.

It doesn't relate to it which is why I was careful that no part of my
post, nor the part of Pascal's post that I quoted mentions Haskell at
all.

(since there is no special lazy hardware, Haskell code _must_ be
translated into eager one, and believe Pascal's code is most optimal
eager code to do this).

...nor does my post mention any of the code posted.

 pa> (if my code takes more than 50ms to match a limit order in an order
 pa> book then my customers will buy another matching engine, no matter how
 pa> readable it is!).

your customers are impatient! :)

They're generally running algorithmic trading models, so in some sense
the "customer" is a machine :-)

--
Phil
http://phil.nullable.eu/
.