[2]: [Haskell-cafe] Why Haskell?
|
| Hi,
|
| sequence [] = return []
| sequence (action:actions) = do x - action
| xs - sequence actions
| return (x:xs)
|
| sequence_ [] = return ()
| sequence_ (action:actions) = do action
Well now that I understand how it works, I'm perfectly happy with the
current functionality.
As long as I put all my FFI imports into one module and compile that,
then I can load the other modules into GHCi at will
during development and testing. I was going to do some FFI imports into
another
vim has been my choice as well. Now that vim 7.0 has tabbed windows
it's better than ever.
All they need now is a way to integrate it with a console window
I guess you can find scite/scintilla settings for Haskell as well
http://www4.in.tum.de/~haftmann/resources/haskell.properties
Marc
2) Recompiling binaries (necessary in order to link in foreign object
code into GHCi) is slow using GHC. Moreover I have to restart GHCi if I
want to reload a changed DLL (unless there is a way to unload a DLL in
GHCi). It also requires jumping around between several console windows
to
marco-oweber:
2) Recompiling binaries (necessary in order to link in foreign object
code into GHCi) is slow using GHC. Moreover I have to restart GHCi if I
want to reload a changed DLL (unless there is a way to unload a DLL in
GHCi). It also requires jumping around between several
The GSL has been ported to Windows:
http://gnuwin32.sourceforge.net/packages/gsl.htm
so I think that GSLHaskell could also be adapted to work in Windows... I will
try to do it.
Alberto
On Monday 24 July 2006 02:56, SevenThunders wrote:
Jared Updike wrote:
GSL Haskell bindings:
Alberto Ruiz-2 wrote:
The GSL has been ported to Windows:
http://gnuwin32.sourceforge.net/packages/gsl.htm
so I think that GSLHaskell could also be adapted to work in Windows... I
will
try to do it.
Alberto
On Monday 24 July 2006 02:56, SevenThunders wrote:
Jared Updike wrote:
| I think I understand my issue now with this (other than the anomaly of
| the above example). I've been using the make option with ghc to
compile
| all the dependent sources, creating binaries for all of them. Those
| binaries can be loaded into GHCi, but if you do so it will not make
the
|
I used what I thought, initially was an elegant contruction technique in
Haskell. Something like this
do
...
sequence $ [ reffill b s | s - [0..(fi temits)-1], b - [0..(fi
nc)-1]]
...(push list on to matrix stack)
Try the sequence_ (note the underscore) function, it should be a big
Matthew Bromberg wrote:
I used what I thought, initially was an elegant contruction technique in
Haskell. Something like this
do
...
sequence $ [ reffill b s | s - [0..(fi temits)-1], b - [0..(fi
nc)-1]]
...(push list on to matrix stack)
Try the sequence_ (note the
Matthew Bromberg [EMAIL PROTECTED] writes:
1) Hat looks really interesting thanks. Hopefully it will run on windows.
Under mingw or cygwin, possibly. Natively, not.
3) The problem here is existing code. I don't want to add every
function that I use into a class just to maintain simple
Hi
1) Hat looks really interesting thanks. Hopefully it will run on windows.
Under mingw or cygwin, possibly. Natively, not.
http://www.haskell.org//pipermail/hat/2006-July/000288.html - I ported
Hat to Windows natively last week. No mingw or cygwin required.
Thanks
Neil
Matthew Bromberg wrote:
3) The problem here is existing code. I don't want to add every
function that I use into a class just to maintain simple polymorphism
over closely related numeric types. This would take longer than just
calling the coercion routines. It's funny how trivial stuff likes
On Jul 23, 2006, at 1:20 AM, Matthew Bromberg wrote:
I do want to understand the advantages of Haskell. My approach has
been to consign the heavy imperative, state manipulating code to C
and leave the higher end stuff to Haskell. The nature of my
problem (a simulation) necessitates
Hello Matthew,
Sunday, July 23, 2006, 10:35:41 AM, you wrote:
sequence $ [ reffill b s | s - [0..(fi temits)-1], b - [0..(fi
nc)-1]]
Now thats interesting. I can see that this function is more appropriate
since I do not need to retrieve data from the IO monad,
but what I don't
Hi,
sequence [] = return []
sequence (action:actions) = do x - action
xs - sequence actions
return (x:xs)
sequence_ [] = return ()
sequence_ (action:actions) = do action
sequence_ actions
So, by
1) Lack of debugging support. Yes there are print statements and trace,
but I would like to set a breakpoint. It would be nice to do so and
launch the GHCi interpreter with all the variable context supported. A
google search revealed that there is current work on this, but
unfortunately the
Hello Pepe,
Sunday, July 23, 2006, 5:23:18 PM, you wrote:
1) Lack of debugging support. Yes there are print statements and trace,
You can find more info about this project in the Haskell wiki at:
http://haskell.org/haskellwiki/Ghci/Debugger
All you'd need to do is to compile ghc-6.5 with
Bulat, now that Krasimir has resumed work on Visual Haskell, I have
planned to pursue an integration of the ghc-api debugger with Visual
Haskell as soon as possible.
But as we get closer to having dynamic breakpoints working 100%, the
plain ghci debugging support starts to look as a fairly nice
Matthew,
On 7/22/06, Matthew Bromberg [EMAIL PROTECTED] wrote:
I'm not using an IDE does one exist?
You may want to use EclipseFP for your Haskell work. It is still a
work in progress, but it may be worth to give it a try.
http://eclipsefp.sourceforge.net
Cheers,
Thiago Arrais
I agree that this would be the cleaner solution. In fact I already
have a typedef for the Double type in anticipation of using different
sized floating point.
Unfortunately I rely heavily on the BLAS linear algebra libraries. As
long as I can type cast the haskell types in C to double or
You make a good point and the decision was by no means cut and dry. However
I made a point of developing some test code using some the newer array data
types and looked at maintaining the array in Haskell and then directly
calling Blas etc. I even had a nice polymorphic matrix class going.
GSL Haskell bindings:
http://dis.um.es/~alberto/GSLHaskell/
http://dis.um.es/~alberto/GSLHaskell/doc/
Specifically for Linary Algebra:
http://dis.um.es/~alberto/GSLHaskell/doc/GSL-Base.html
You make a good point and the decision was by no means cut and dry. However
I made a point of
Jared Updike wrote:
GSL Haskell bindings:
http://dis.um.es/~alberto/GSLHaskell/
http://dis.um.es/~alberto/GSLHaskell/doc/
Specifically for Linary Algebra:
http://dis.um.es/~alberto/GSLHaskell/doc/GSL-Base.html
You make a good point and the decision was by no means cut and dry.
I am currently in the middle of a reasonably large software simulation
of a wireless network that I'm programming
in Haskell and in C. Progress has been slower than anticipated and I
occasionally (probably because of looming deadlines)
ask myself did I take the right approach?
Here are the
Hi,
1) Lack of debugging support.
See Hat http://www.haskell.org/hat - it might give you the debugging
stuff you want, provided you have stuck mainly to Haskell 98.
2) Recompiling binaries (necessary in order to link in foreign object
code into GHCi) is slow using GHC. Moreover I have to
On 7/22/06, Matthew Bromberg [EMAIL PROTECTED] wrote:
I used what I thought, initially was an elegant contruction technique in
Haskell. Something like this
do
...
sequence $ [ reffill b s | s - [0..(fi temits)-1], b - [0..(fi nc)-1]]
...(push list on to matrix stack)
Try the sequence_
1) Hat looks really interesting thanks. Hopefully it will run on windows.
2) I have downloaded the latest version of WinHugs. In the end I need
my Haskell to compile under GHC for performance reasons. I am
concerned about portability, especially as concerns the ffi. I got
scared off by
Matthew Bromberg wrote:
4) Hmm, a simple example I tried actually worked, however I have a file
that has this header
module Parsefile where
import System.IO
import System.IO.Unsafe
import Text.ParserCombinators.Parsec
import Data.HashTable
...
For some reason it requires that I use
29 matches
Mail list logo
