- Haskell-Cafe - Haskell.org

LIP and the AAP project
by Isaac Jones 20 Jan '04

20 Jan '04

Greetings, Now that I have at least gotten something started on the Library Infrastructure Project, I'm going to bend some of my energy toward the build/install issues for Haskell modules. The plan at this point, which is summarized on the project web site[1] is to attempt to leverage HMake's usefulness as a non-compiler-specific build system. Since I wrote the proposal, I've been made aware of the AAP project[2]. Does anyone have any experience with this? Does anyone have a sense for how it might fit in with LIP? I know that Peter Simons seems to think it might. I haven't read through all of the documentation, but I suspect it might help us out with the CPAN-style distribution stuff, and perhaps the building stuff. One big objection I have with using it would be that Haskell modules would depend on Python (!), but I thought I'd let everyone know about it anyway. Seems like an interesting project, and we could quite possibly learn something from it. peace, isaac [1] http://www.haskell.org/libraryInfrastructure/ [2] http://www.a-a-p.org/

1 0

Haskell binaries for AIX?
by Dean Herington 16 Jan '04

16 Jan '04

Does anyone out there have a prebuilt Haskell system for AIX? I'm trying to find the easiest route to running a Haskell interpreter on AIX (5.1 and 5.2). Dean

1 0

FFI preprocessor for GHC
by Gour 15 Jan '04

15 Jan '04

Hi! I'd like to create Haskell bindings for swisseph C library for calculating ephemeris. Which preprocessor would be a suitable for ghc compiler with the ability to run the code both on Linux & Win32? Sincerely, Gour -- Gour gour(a)mail.inet.hr Registered Linux User #278493

3 2

RE: ghc optimization of incremental update
by Simon Marlow 13 Jan '04

13 Jan '04

> Does ghc make any attempt to analyze dataflow and eliminate > unnecessary > copying for incremental updates? I compile the code below > with -O, and > based on the time it takes to run I'd guess it's copying the > array with > every update, even though there's no need in this particular > case to do > that. Perhaps there's a compiler flag or pragma to turn on > the analysis? > > module Main where > import Array > main = print (take 1 (reverse (elems (array_neg (setup > 100000))))) > setup i = listArray (1,i) [1..i] > -- the next three lines are the important part. > array_neg array = array_neg2 (length (elems array)) array > array_neg2 0 array = array > array_neg2 i array = array_neg2 (i-1) (array // [(i,-i)]) > > I realize I can force it to stop copying if I use a Monad, and there > are of course more efficient ways to code this contrived testcase. > I want to know if ghc can make it efficient as it stands. GHC doesn't do this kind of optimisation, no. There is the DiffArray type which provides constant-time array update, although it has been reported to have a high constant factor overhead. Your best bet for algorithms using mutable arrays is to encapsulate it in a state thread with the ST monad. Cheers, Simon

1 0

EDI X12
by Christopher Milton 13 Jan '04

13 Jan '04

Has anyone in the Cafe written EDI X12 generator/parser in Haskell? ===== Christopher Milton cmiltonperl(a)yahoo.com

1 0

pet project - 7 Millennium Prize problemss
by Christopher Milton 13 Jan '04

13 Jan '04

Folks, I think Haskell can be used to solve several, if not all, of the seven problems. Now I have to decide which problem to tackle first. Chris ===== Christopher Milton cmiltonperl(a)yahoo.com

4 6

ghc optimization of incremental update
by Doug Brown 12 Jan '04

12 Jan '04

Does ghc make any attempt to analyze dataflow and eliminate unnecessary copying for incremental updates? I compile the code below with -O, and based on the time it takes to run I'd guess it's copying the array with every update, even though there's no need in this particular case to do that. Perhaps there's a compiler flag or pragma to turn on the analysis? module Main where import Array main = print (take 1 (reverse (elems (array_neg (setup 100000))))) setup i = listArray (1,i) [1..i] -- the next three lines are the important part. array_neg array = array_neg2 (length (elems array)) array array_neg2 0 array = array array_neg2 i array = array_neg2 (i-1) (array // [(i,-i)]) I realize I can force it to stop copying if I use a Monad, and there are of course more efficient ways to code this contrived testcase. I want to know if ghc can make it efficient as it stands.

1 0

RE: no continuations
by Kevin S. Millikin 12 Jan '04

12 Jan '04

On Tuesday, December 30, 2003 5:04 PM, Kevin S. Millikin [SMTP:kmillikin@atcorp.com] wrote: > Oh, sure. I didn't mean to quibble with the idea that continuations > are computational effects. Just wanted to point out that (I think) > you can't macro express mutation with call/cc, unless you've already > got mutation anyway. [snip] > Yup. If you do that, you can use d as your setter and c as your > getter: > > > (define c (make-cell)) > > (define d c) > > ((d 'set) 9) > > (c 'get) > 9 > > ((d 'set) 17) > > (c 'get) > 17 It sure looks like the example contradicts the assertion, but I happen to know that there is a set! (or some other assignment) in the macro expansion of define. I'm just using call/cc to get at that, rather than getting at the one in the expansion of letrec. Moved to Haskell Cafe.

4 9

Hi, I have a question!
by NamO 12 Jan '04

12 Jan '04

Hi. I am a student, who get interesting in Haskell. So, nowdays, I study Hakell with "Introduction to Functional Programming using Haskell - second edition" And today, I face an error from bellow code. ---------------------------- module OperationTest where data Nat = Zero | Succ Nat deriving (Show) (+) :: Nat -> Nat -> Nat m + Zero = m m + Succ n = Succ (m + n) ---------------------------- But above source make an error like bellow Reading file "g:\Haskell\OperationTest.hs": Dependency analysis ERROR "g:\Haskell\OperationTest.hs":8 - Ambiguous variable occurrence "+" *** Could refer to: OperationTest.+ Prelude.+ above source is from the text book - "Introduction to Functional Programming using Haskell - second edition" and I use Hugs to interpret it. I understand what interpreter say, but I don't know How I can solve this problem. Please, Help me!!! - 5 - P.S. Tank you very much to read my broken english letter.

4 5

JVM bridge
by Mark T.B. Carroll 11 Jan '04

11 Jan '04

With haskell-jvm-bridge-0.2.1 I get: ghc -package javavm HelloWorld.o HelloWorld_JVM.o Class_java_io_PrintStream.o Class_java_lang_System.o -o HelloWorld gcc: unrecognized option `-rpath' gcc: unrecognized option `-rpath' gcc: unrecognized option `-rpath' /usr/bin/ld: cannot open /usr/lib/jvm-bridge/lib/: File format not recognized $ ld --version GNU ld version 2.12.90.0.1 20020307 Debian/GNU Linux Copyright 2002 Free Software Foundation, Inc. This program is free software; you may redistribute it under the terms of the GNU General Public License. This program has absolutely no warranty. $ gcc --version 2.95.4 $ ghc --version The Glorious Glasgow Haskell Compilation System, version 6.2 I don't suppose anyone can hand-hold me through tracking this problem down? -- Mark

4 5