Re: Poll: How to respond to homework questions

. For the second case, I vote for (F) Ignore. -- Matthew Donadio ([EMAIL PROTECTED]) ___ Haskell-Cafe mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: User-Defined Operators

and tan. Check out the AMS-LaTeX package. I think it has a macro to solve this. It also includes a zillion new symbols/operators. http://www.ams.org/tex/amslatex.html If you have TeTeX installed as your TeX system, then it should be included. -- Matthew Donadio ([EMAIL PROTECTED

Re: main modules in GHC, deriving differences between GHC and Hugs

#else foo_test = and tests #endif I haven't done this with Haskell, but I have done it with a lot of my C libraries. -- Matthew Donadio ([EMAIL PROTECTED]) ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell

Re: Green Card and Exceptions

saves me this step. - Are you developing new libraries or just maintaining the ones you've got? New library. - Is there a demand for new features? A more generic %fail mechanism? Thanks for the response. -- Matthew Donadio ([EMAIL PROTECTED

Testing was Re: main modules in GHC, deriving differences between GHC and Hugs

always to hear about other methods of automated testing. -- Matthew Donadio ([EMAIL PROTECTED]) ___ Haskell-Cafe mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell-cafe

FFI Help

reports a SIGSEGV in signgam(), but I'm not sure why. I believe that I need to use the monad because signgam is only valid after lgamma returns. Does anyone have an idea what I am doing wrong? Thanks. -- Matthew Donadio [EMAIL PROTECTED] module Gamma (gamma, lgamma) where import

Looking for Libraries

graphics programming. Does anyone have an FFI interface to LAPACK? Does anyone have an FFI interface to a free linear program solver? Or, a Haskell implmentation of the two-step simplex method? (I sold my copy of Chvatal's book in college for beer money). Thanks. -- Matthew Donadio ([EMAIL PROTECTED

Re: Looking for Libraries

://www.haskell.org/pipermail/haskell/2002-June/009833.html Duh. I thought I looked through the archives for this, but I guess I didn't. Thanks. -- Matthew Donadio ([EMAIL PROTECTED]) ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman

FFI Tutorial / Examples

about how to do this. Can anyone point me to an FFI tutorial, or some examples? I have a feeling that once I see some examples using lists and arrays that things will fall into place. Thanks. -- Matthew Donadio ([EMAIL PROTECTED]) ___ Haskell mailing

Re: compiling

project. How do I compile something? Also it can't find an interface for Data. How do I make an interface file for that? Read the ghc docs, but try ghc -o Main --make -package data -fglashow-exts Main.hs -- Matthew Donadio ([EMAIL PROTECTED

Re: Learning Haskell moved

, Number 3, pp.359-411, 1989 This would probably be good, too. --Matthew Donadio ([EMAIL PROTECTED]) ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell

Re: time since the epoch

the correction to UTC. I understand the argument for using TAI. Maybe internally the libray should use TAI, but default to giving the user UTC? -- Matthew Donadio ([EMAIL PROTECTED]) ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org

ANNOUNCE: DSP Libraries for Haskell

values of N Inverse FFT defined in terms of the FFT 2N-point real FFT computed with N-point FFT More algorithms will be appearing over time, as well as some demo applications. -- Matthew Donadio ([EMAIL PROTECTED]) ___ Haskell mailing

Bizarre Haskell Problem

prime n (ie, foo n produces the permutation for a generator of the Galois field n). I appologize in advance if this is a bug on my part, but based on what I am seeing, I am getting results that should not happen. Thanks. -- Matthew Donadio ([EMAIL PROTECTED]) FFT2.lhs Description

Bizarre Haskell Problem

use a separate file? Separate files isn't really an option, because the above is simplified a bit, and the final version would have mutually recursive modules, which hugs can't handle. Thanks. -- Matthew Donadio ([EMAIL PROTECTED]) ___ Haskell mailing

Class Question

a million. -- Matthew Donadio ([EMAIL PROTECTED]) ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell

Arrays vs Lists and Specialization

? If anyone is interesting in what I have put together, I will be making everything public sometime next week. I have a lot of algorithms implemented, but I need to clean up the documentation a bit (well, a lot). Thanks. -- Matthew Donadio ([EMAIL PROTECTED

Debugging Arrays

problems. Is there an easy way to trace execution? Does anyone have any advice on how to go about debugging this? I am using Hugs 98, November 2002 if it matters. Thanks. -- Matthew Donadio ([EMAIL PROTECTED]) ___ Haskell mailing list [EMAIL PROTECTED] http

Re: Haskell 98 draft report

Hans Aberg wrote: Thinking of it, "round" should probably be viewed as a method to convert a float to another float of less precision (and not a conversion to an integer) To be picky, rounding a fixed point value to less bits is a very common procedure (at least it is in the DSP world) to

Re: Functional DSP

Philip Wadler wrote: By the way, FFTW although written in C, was generated by a functional program written in Caml. You can find more details on the web page I asked the authors (Steven Johnson and Matteo Frigo from MIT) a few months ago why they chose Objective Caml over SML, Haskell, and

Re: Haskell in Scientific Computing?

Dave Tweed wrote: But there's a lot of problems, probably more in the hazy region between science engineering, where `numerically intensive' algorithms are developed which don't look anything like existing classical techniques. Here the issue is to generate CORRECT results REASONABLY