dokondr's blog
http://sequence.complete.org/blog/95
enHaskell on Pocket PC?
http://sequence.complete.org/node/152
<p>Any ideas on how much work needs to be done for using Haskell on PPC Windows Mobile platform?<br />
It would be interesting to use PPC as:<br />
1) Haskell learning tool, so small code snipets could be entered and run directly on hand-held (REPL). How hard is it to port Hugs to PPC for this? Do any other (then Hugs) implementations exist that are easier to port?<br />
2) Running on PPC Haskell applications cross-compiled on host PC. How much work must be done for GHC to support this?</p>
<p>3) There are several ways both for porting Haskell to PPC as well as cross-compiling Haskell code. Which one makes more sense to implement and will take less effort:<br />
a) Porting/compiling to VM byte code (Java, Parrot)?<br />
b) Porting/compiling to .NET CLR?</p>
<p>4) And finally, do any projects already exist in this area?</p>
http://sequence.complete.org/node/152#commentsCompilers/InterpretersDiscussionThu, 30 Mar 2006 04:37:36 -0800dokondr152 at http://sequence.complete.orgNewbie: Recursive lambda definitions?
http://sequence.complete.org/node/149
<p>{-<br />
Haskell newbie: Recursive lambda definitions?<br />
Simon Thompson gives the following exercise (10.9) in his "Haskell. The Craft of Functional Programming" book:</p>
<p>10.9 Define a function total</p>
<p>total:: (Int -> Int) -> (Int -> Int)</p>
<p>so that total f is the function which at value n gives the total</p>
<p>f 0 + f 1 + ... + f n</p>
<p>I use 'where' clause to describe the resulting function 'tot':<br />
-}</p>
<pre>
total:: (Int -> Int) -> (Int -> Int)
total f = tot
where
tot n
| n >= 0 = (f n) + (tot (n-1))
| otherwise = 0
test = total f1 4
</pre><p>{-<br />
Q: Is it possible instead of naming and defining a resulting function (such as 'tot' in this example) just use recursive lambda definition? In this example recursion is required to create a function which is a variable sum of another function applications like:</p>
<p>f 0 + f 1 + ... + f n </p>
<p>Giving function a name ('tot' in this case) makes recursive definition possible. But what about lambda recursion? Can it be defined?<br />
-}</p>
http://sequence.complete.org/node/149#commentsRecursionDiscussionSat, 18 Mar 2006 11:04:19 -0800dokondr149 at http://sequence.complete.org