On 11/9/06, Brandon Moore [EMAIL PROTECTED] wrote:
Looks nice, especially if you're just getting started.
The overall structure looks good, I've just made a bunch of
little changes to the details. Mostly I found repeated patterns
to replace with library functions or extract as helper functions.
Quoth Justin Bailey, nevermore,
Above are all more examples of partial functions and function
composition. I understand the first concept, but function composition
escapes me somehow. What are the rules for partial functions getting
arguments when they are eventually supplied? For example, in
On 11/10/06, Dougal Stanton [EMAIL PROTECTED] wrote:
As you noted that doesn't seem right --- how does compile capture its
input? Well, the (.) operator is slightly different. It captures
variables and passes them into the 'innermost' function, a bit like
this:
That is a great explanation.
As part of the Ruby Quiz in Haskell solutions appearing on the wiki
recently, I just a solution to Ruby Quiz #100 - create a bytecode
interpreter for a simple expression language.
Like I said, the code below parses simple integer arithmetic
expressions and generates byte codes for a hypothetical
Justin Bailey wrote:
As part of the Ruby Quiz in Haskell solutions appearing on the wiki
recently, I just a solution to Ruby Quiz #100 - create a bytecode
interpreter for a simple expression language.
Like I said, the code below parses simple integer arithmetic
expressions and generates byte
Justin Bailey wrote:
As part of the Ruby Quiz in Haskell solutions appearing on the wiki
recently, I just a solution to Ruby Quiz #100 - create a bytecode
interpreter for a simple expression language.
Like I said, the code below parses simple integer arithmetic
expressions and generates byte
