September 2005 - Haskell-Cafe

RE: Re[2]: [Haskell-cafe] Weak hashtable memoization code?
by Simon Marlow 15 Sep '05

15 Sep '05

On 15 September 2005 13:44, Bulat Ziganshin wrote: > Hello Simon, > > Tuesday, September 13, 2005, 7:42:52 PM, you wrote: > >> There's the memo table implementation in the util package: >> hslibs/util/Memo.lhs. Note that this is scheduled for demolition in >> GHC >> 6.6. > > why? It doesn't perform very well, there's a general lack of interest, and nobody interested in supporting it. The right thing to do is make it available as a Cabal package. Cheers, Simon

1 0

Autrijus Tang interviewed by Perl.com
by John Goerzen 15 Sep '05

15 Sep '05

metaperl posted about this on the Haskell Sequence this morning and I thought all of you list readers might be interested as well. Autrijus Tang is well-known for developing the first working Perl 6 interpreter, Pugs. Pugs is written in Haskell. Perl.com has an interview with Autrijus, and page 2 of that interview gets particularly interesting. URL: http://www.perl.com/pub/a/2005/09/08/autrijus-tang.html?page=2 Favorite quote: "Haskell . . . is faster than C++, more concise than Perl, more regular than Python, more flexible than Ruby, more typeful than C#, more robust than Java, and has absolutely nothing in common with PHP." -- John

3 2

RE: [Haskell-cafe] Weak hashtable memoization code?
by Simon Marlow 15 Sep '05

15 Sep '05

On 28 August 2005 16:39, Bulat Ziganshin wrote: > Hello David, > > Sunday, August 28, 2005, 4:19:07 PM, you wrote: > >> Hi all, > >> Does anyone have a nice bit of example code to implement memoization >> using weak pointers and hash tables? It would be nice to have a >> pre-packaged module that I could just use, which has already been >> tested. The contents of Data.WeakPtr seem a bit lower-level than >> I'd rather work with. > > http://www.haskell.org/~simonmar/papers/weak.pdf There's the memo table implementation in the util package: hslibs/util/Memo.lhs. Note that this is scheduled for demolition in GHC 6.6. Cheers, Simon

2 1

How to call ICS from Haskell
by Huong Nguyen 15 Sep '05

15 Sep '05

Hello everybody, Do you know how to call ICS (Integrated Canonizer and Solver: www.icansolve.com <http://www.icansolve.com>) or PVS (Prototype Verification System) from Haskell ? Thank you in advance.

2 1

Re: Functional vs Imperative
by Dhaemon 14 Sep '05

14 Sep '05

Hi again, Thanks to everyone for replying. I think I get it now; I was focusing on the wrong aspect of the question. I was totally overlooking referential transparency and the cascade of 'capabilities'(lazyness, etc) it creates. Thus evaluation is just getting values out of expressions, actions(which modify the state of the 'world') are never performed... Except when 'cheating' with monads. Hat-anim is really interesting, I'm playing with it at the moment... Thanks again, Best regards,

2 1

wxHaskell: getting a checkbox state
by Mark Carter 14 Sep '05

14 Sep '05

I'm a complete n00b to Haskell, and I am trying to write an experimental app using wxHaskell. I'm getting on suprisingly well, given that I have practially no idea what I'm doing. In my main loop I have cbEdit <- checkBox p1 [text := "Edit Mode", on command := onCbEdit textlog ] where p1 is a panel, and textlog is a textCtrl that I want to write output to. In my where clause I have defined: onCbEdit textlog = do appendText textlog "onCbEdit\n" So far, this works. The thing that's got me totally stumped is this: suppose I want onCbEdit to do something dependent on the state of the checkbox (i.e. whether it is checked or unchecked). I've tried a variety of things, but I can't get anything to work. To put things into a wider context, here's the message I posted to fa.haskell yesterday: I'm the rawest of n00bs to Haskell. I was interested in evaluating it, and I've seen some GUI stuff that looked pretty impressive. I wanted to write a protoype for a commercial application to do hydrocarbon accounting. Which is to say, you've a number of so-called "streams" - think of them as graph nodes - feeding into each other in a directed fashion (assume the graph is acyclic). Then there's a bunch of business logic which determines how the values of one stream are affected by the values in another. An example of a stream might be a platform. Another one might be a well. Each stream would display on the window as some funky symbol, with its name underneath. It would be nice if the application had an edit mode, where you could add, move, delete, and join streams in a window; and a data mode, where you could click on the stream you were interested in and examine its properties. Is there a Haskell GUI toolkit which is particularly suitable for this? Other requirements of the toolkit would be: * Works on Windows (XP) * commercial-friendly licence: GPL is out, and even LGPL is a bit fiddly * free * bonus points for being easy to use, and well-documented ___________________________________________________________ To help you stay safe and secure online, we've developed the all new Yahoo! Security Centre. http://uk.security.yahoo.com

4 3

RE: [Haskell-cafe] static typing and interactivity
by Simon Marlow 14 Sep '05

14 Sep '05

On 18 August 2005 16:11, Jake Luck wrote: >> One slight annoyance using Haskell is the inability to load modules >> with type problems in the interactive environment (i.e. GHCi). When >> I have a type error, it would be nice to have an interactive way to >> explore what the compiler thinks about the types involved -- as it >> is, I have to resort to adding type signatures more or less at >> random to narrow down the problem. >> >> I'm not sure if it is technically feasible to (partially) load a >> module with definitions that fail type checking, but if it were, I >> thing it would make developing Haskell programs even nicer :-) > > Along similiar lines, it would be quite nice if one can mark their > haskell code(working or not) with "breakpoints" and drop the > programmer into GHCi so they can poke around, especially inside a > do-construct. e.g. something the evalutation engine can check during > reduction maybe? I find myself writing a lot of testing frameworks, > maybe this is a good thing!, when I program. How do most of the folks > here debug their large code base? I would really like to do this, and I've put some thought into how to do it. Basically you need 2 things: - A generic way to display data found in the heap. Heap data doesn't carry around it's type, but we need a way to display the arguments to polymorphic functions (for example). Fortunately GHCi has all the information about the layout of known data types, all that's needed is a way to map a heap closure to GHCi's representation of constructor (a DataCon), which is quite possible - some support from the dynamic linker is required, though. - A way to set breakpoints. This is far easier for interpreted code than for compiled code: for interpreted code we can just replace the appropriate BCO (byte code object) with a special breakpoint object. A breakpoint would contain information about its free variables, and a pointer to the original BCO. The harder part is to map source locations to byte code objects, retaining the information through the various compiler passes (HsDebug did some work in this direction, I believe). Anyone interested in working on this, please get in touch. Cheers, Simon

1 0

RE: [Haskell-cafe] Re: Thread pool in GHC
by Simon Marlow 14 Sep '05

14 Sep '05

On 07 September 2005 16:04, Dinh Tien Tuan Anh wrote: > So is there a way to reuse thread ? > I think eventhough threads in GHC are extremely lighweight, it still > make a different if u keep launching and killing thread in so many > times. My advice would be to try without a thread pool first, and see if you have any performance problems. My guess is that you won't - threads are so lightweight that you might end up with *worse* performance if you use a thread pool. Cheers, Simon

1 0

some algorithm help with jhc
by John Meacham 14 Sep '05

14 Sep '05

I have started working on jhc more recently and have come across some places where I think my algorithms could be improved but was not sure exactly where to start so thought I would ask the list since perhaps someone here has some insight. After a long time of trying various methods of speeding up the fixpoint iteration of my points-to analysis (the current main bottleneck) I decided to step back and look at the basic problem again. It turns out I can express the problem as one of constraint satisfaction resulting in much smaller code (600 lines vs 2000) and 10fold speedups with my unoptimized first draft solver. It is much faster but still not as fast as I'd like. I don't know a lot about constraint problems, but my intuiton says this particular problem is of a type that should be particularly easy to solve but am uncertain where to start in my searching to find a fast algorithm. My constraints come in two types of rules. the rules are of the form (where a and b are variables to be solved for and x and y are values in my domain) * a >= f(b) where x >= y implies f(x) >= f(y) * enforce g(a) as a new set of rules where if x >= y then g(x) subsumes g(y) f and g are typed thusly. f :: domain -> domain g :: domain -> set of rules the following useful derived rules can be expressed by the above. a >= b a == b if z(a) then b >= c now, the reason my intuiton says there should be a fast solution is that there is no way for the variables to decrease. every added rule can only add to the least solution and not shrink any set. so, my basic question is, is this a known form of constraint satisfaction problem? does it admit a particulary fast solution as my intuition tells me? does it have a name I can search for on scholar.google.com? my current first draft implementation represents each rule as an IO action taking a difference set that propegates said difference set and then adds it to the current set for each var. The second problem I am facing is one of debugging. my code dealing with jhc core and all the optimizations that are performed on it has gone through a lot of evolution. over time, bugs have been introduced that are very hard to track down, the symptom would be suddenly having core that doesn't typecheck or has an unknown identifier or worse a segfault in the generated program. backtracking to find the error is quite tedious, mainly involving commenting out transformations until I find the offending one, then rederiving the correct code and comparing it to what I have written. I have decided to remedy the situation and start using QuickCheck to verify all my transformations are meaning and type preserving. however, the problem arrises in how to come up with a meaningful instance of Arbitrary for expressions in jhc core. It is not clear at all how to come up with code that generates random yet "interesting", well typed, convergent, terms in the extended lambda calculus with things like recursive definitons and primitives. even if I solved that, the problem of deciding whether two expressions (which might be functions) do the 'same thing' is undecidable, so how do I even test if the transformations are meaning preserving? Ideally, someone would have written a paper on this. I have seen several papers on generating suitable random graphs for testing graph algorithms, but have not come across one on creating typed lambda calculus terms. perhaps someone else has come across this same problem and has some insights? I am interested in ideas, brainstorming and pointers to papers or terms to search for as much as ready made solutions. In any case, I think they are interesting problems to begin with... hopefully someone out there thinks so too :) John -- John Meacham - ⑆repetae.net⑆john⑈

2 1

RE: [Haskell-cafe] Haskell poker server
by Simon Marlow 13 Sep '05

13 Sep '05

On 28 August 2005 20:00, Joel Reymont wrote: > I get a message from Erlang once data arrives over TCP and the > message is a {tcp, Socket, Bin} tuple where Bin is binary data. I can > easily extract what I need using Erlang binary pattern matching: > > read(<<24, GID:32, Seq:16>>) -> > {24, GID, Seq}. I didn't see anyone mention this (apologies if I missed it), but the House project does parsing of network packets and has some useful combinators for parsing binary data: http://www.cse.ogi.edu/~hallgren/House/ Cheers, Simon

1 0