- Haskell-Cafe - Haskell.org

Re: [Haskell-cafe] ANN: TextRegexLazy-0.56, (=~) and (=~~) are here
by Chris Kuklewicz 02 Aug '06

02 Aug '06

Bulat Ziganshin wrote: > Hello Chris, > > Wednesday, August 2, 2006, 3:16:58 PM, you wrote: > >> Announcing: TextRegexLazy version 0.56 > > your feature list is really strong! it will be great now to make it > a part of GHC standard distribution > > afaiu, selection of regex engine implemented via import statements? > You can actually choose which backend (=~) uses at runtime: > {-# OPTIONS_GHC -fglasgow-exts #-} > import Text.Regex.Lazy > > import qualified Text.Regex.PCRE as R > import qualified Text.Regex.PosixRE as S > import qualified Text.Regex.Full as F > > -- Choose which library to use depending on presence of PCRE library > > (=~) :: (RegexMaker R.Regex R.CompOption R.ExecOption a,RegexContext R.Regex b t > ,RegexMaker F.Regex F.CompOption F.ExecOption a,RegexContext F.Regex b t > ,RegexMaker S.Regex S.CompOption S.ExecOption a,RegexContext S.Regex b t) > => b -> a -> t > (=~) = case R.getVersion of > Just _ -> (R.=~) > Nothing -> case S.getVersion of > Just _ -> (S.=~) > Nothing -> (F.=~) > > main = print (("ba" =~ "(.)a") :: (String,String,String,[String])) The R.getVersion and S.getVersion detect whether it was compiled against PCRE or PosixRE. The (=~) is then chosen at run time.

1 0

[Parsec] Backtracking with try does not work for me?
by Stephane Bortzmeyer 02 Aug '06

02 Aug '06

I'm trying to write a Parsec parser for a language which authorizes (this is a simplified example) "a" or "a,b,c" or "a,c" or "a,b". (I can change the grammar but not the language.) The first attempt was: ***** CUT HERE **** import Text.ParserCombinators.Parsec import System (getArgs) comma = char ',' minilang = do char 'a' optional (do {comma ; char 'b'}) optional (do {comma ; char 'c'}) eof return "OK" run parser input = case (parse parser "" input) of Left err -> putStr ("parse error at " ++ (show err) ++ "\n") Right x -> putStr (x ++ "\n") main = do args <- getArgs run minilang (head args) ***** CUT HERE **** Of course, it fails for "a,c": parse error at (line 1, column 3): unexpected "c" expecting "b" for a reason explained in Parsec's documentation (the parser "optional (do {comma ; char 'b'})" already consumed the input, do note the column number). What puzzles me is that the solution suggested in Parsec's documentation does not work either: ********* CUT HERE ******************* minilang = do char 'a' try (optional (do {comma ; char 'b'})) optional (do {comma ; char 'c'}) eof return "OK" ********* CUT HERE ******************* parse error at (line 1, column 2): unexpected "c" expecting "b" Apparently, "try" was used (do note that the column number indicates that there was backtracking) but the parser still fails for "a,c". Why?

5 10

Future Edison directions
by Robert Dockins 01 Aug '06

01 Aug '06

Hello all, There has been very recently a thread discussing the design decisions involved in creating a sequence abstraction. This was naturally of interest to me as the current Edison maintainer, and generated a fair bit of interesting discussion. I'd like to kick off a new thread here to talk about future directions for the Edison API in particular. 1) Regarding Sequence, I have become convinced by the discussion that the Edison Sequence class should be broken down into smaller classes. Furthermore, it would be very nice to make these smaller classes shared across the various families of data structure abstractions in Edison (Sequences, Collections and Associative Collections). The formulation of Sequence of kind * -> * may need to be sacrificed to this end. I am not convinced that losing the maps and zips would be a major blow; however there are a couple of strategies for retaining them in some form. 2) The associated collection API is in a similar situation, except there are no zips. 3) I am reluctant to undertake a major overhaul of the Edison API while the future of type classes in Haskell' is so hazy. I haven't heard any news from the Haskell' type classes focus group in quite some time, and last I was aware, discussion was somewhat stalled. I there any hope for a coherent story here in the nearish future? 4) I am on the verge of deciding that nobody wants non-observable collections (ie, collections in which the element values are not available for inspection). Currently Edison has no implementations which are non-observable, and I am not aware of anyone else creating a datastructure implementation in Haskell which is non-observable. Therefore, I am considering removing this feature of the Edison typeclass hierarchy to reduce complexity. Shout if you think this would be a terrible mistake. 5) OTOH, something people DO seem to want is collection "views", or the ability to treat a datastructure as though it were something else. For example, it would be nice to transparently treat the keys of a finite map as a set, or to treat a nested sequence as a single flattened sequence. Such uses require the separation of operations which can create datastructures from those which merely inspect them (or some fancy bidirectional stuff I don't think I want to get into). 6) Edison 1.2 has now been out for a couple of months. If you've used or looked at the new Edison, I'd love to hear what you think. I think the next development cycle will involve pretty substantial changes, and if you want to get your gripes addressed, now is a good time to voice them. Alternately, if you think there are some aspects that are very important to keep, that's also good information. 7) Finally, I somehow feel like there should be a nice categorical formulation of these datastructure abstractions which would help to drive a refactoring of the API typeclasses in a principled way, rather than on an ad-hoc I-sort-of-think-these-go-together sort of way. Unfortunately, my category-fu is quite weak, so all I have is this vague intuition that I can't substantiate. I'm sort of familiar with initial algebras, but I think they may be too concrete. I'm looking for some way to classify algebras that have, eg, the property of having folds, or of being set-like, etc. If anybody can point me in the right direction wrt this, that would be great. Rob Dockins Speak softly and drive a Sherman tank. Laugh hard; it's a long way to the bank. -- TMBG

3 5

A program which never crashes (even when a function calls "error")
by Stephane Bortzmeyer 01 Aug '06

01 Aug '06

[It is a philosophical question, not a practical programming problem.] I'm used, in imperative programming languages with exceptions (like Python) to call any function without fear of stopping the program because I can always catch the exceptions with things like (Python): while not over: try: code which may raise an exception... except Exception e: do something clever How to do it in Haskell? How can I call functions like Prelude.head while being sure my program won't stop, even if I call head on an empty list (thus calling "error")?

6 5

Fw: [Haskell-cafe] The difficulty of designing a sequence class
by Brian Hulley 01 Aug '06

01 Aug '06

David Menendez wrote: > Brian Hulley writes: > >> 1) Did Edison choose MonadPlus just because this fitted in with the >> lack of multi-parameter typeclasses in H98? > > Instances of Monoid (and your ISeq) have kind *. Instances of > MonadPlus (and Edison's Sequence) have kind * -> *. > > Functions like map, zip, and their variants are best defined in terms > of type constructors. > > With Sequence, you have > > zipWith :: (Sequence s) => (a -> b -> c) -> s a -> s b -> s c > > With ISeq, you'd have to do something like > > zipWith :: (ISeq s1 a, ISeq s2 b, ISeq s3 c) => > (a -> b -> c) -> s1 -> s2 -> s3 > > which isn't able to make any assumptions about s1, s2, and s3 having > the same structure. On the other hand it's more powerful because they can now have different structures ie was there any reason not to have: zipWith :: (Sequence s1, Sequence s2, Sequence s3) => (a -> b -> c) -> s1 a -> s2 b -> s3 c >> 3) Is it worth bothering to derive ISeq from Monoid (with the >> possible extra inefficiency of the indirection through the >> definitions for append = mappend etc or does the compiler completely >> optimize this out)? > > I would expect the compiler to inline append. Thanks - that's good news. I' probably still too much in C++ mode. >> 4) Would it be worth reconsidering the rules for top level names so >> that class methods could always be local to their class (ditto for >> value constructors and field names being local to their type >> constructor). > > Qualified module imports are the way to go, here. Do you really want > to start writing "if x Eq/== y Num/+ 1 then ... "? I'm beginning to see that qualified module imports are indeed the only way to go, because the methods in a type class are only the "virtual" methods - often there are many other "methods" which are put outside the class to save space in the dictionary but which conceptually belong to the class thus putting the class + these extra functions in a single module wraps everything up into a conceptual unit. eg: module Foldable ( Foldable(..) , reduceR ) where class Foldable c a | c -> a where foldR :: (a -> b -> b) -> b -> [a] -> b -- ... reduceR :: Foldable c a => (a -> b -> b) -> (c -> b -> b) reduceR f xs y = foldR f y xs forms the single conceptual unit to use Foldable.foldR, Foldable.reduceR etc so I'll have to retract my suggestion as regards classes... (Although I'm still concerned about value constructors and field names being in the top level instead of local to their type but changing this would require some changes to type inference (so that the constructors and field names could be used unqualified when the type at the given position is known eg by a top level type signature for the function or value) so that's more of a long term idea.) Regards, Brian. -- Logic empowers us and Love gives us purpose. Yet still phantoms restless for eras long past, congealed in the present in unthought forms, strive mightily unseen to destroy us. http://www.metamilk.com

5 6

The difficulty of designing a sequence class
by Brian Hulley 01 Aug '06

01 Aug '06

Hi - Part 1 of 2 - Monoid versus MonadPlus =========================== I've just run into a troublesome question when trying to design a sequence class: class ISeq c a | c -> a where empty :: c single :: a -> c append :: c -> c -> c However I've noticed that people sometimes separate the empty and append operations out as sequences with these ops form a Monoid therefore: class Monoid c => ISeq c a | c -> a where single :: a -> c -- now outside the class append :: ISeq c a => c -> c -> c append = mappend empty :: ISeq c a => c empty = mempty Another option, is the Edison library which uses: class (Functor s, MonadPlus s) => Sequence s where so here MonadPlus is used instead of Monoid to provide empty and append. So I've got three main questions: 1) Did Edison choose MonadPlus just because this fitted in with the lack of multi-parameter typeclasses in H98? 2) Are there any reasons to prefer the Edison design over the MPTC design (apart from H98 compatibility) or vice versa? 3) Is it worth bothering to derive ISeq from Monoid (with the possible extra inefficiency of the indirection through the definitions for append = mappend etc or does the compiler completely optimize this out)? and a fourth more long term question: 4) Would it be worth reconsidering the rules for top level names so that class methods could always be local to their class (ditto for value constructors and field names being local to their type constructor). For example it would be nice imho to be able to write: class Monoid c => ISeq c a | c -> a where length :: c -> Int f x y = Monoid/append x y -- or ISeq/append x y g x = ISeq/length x instead of having all names collide in the top level of a module, since at the moment it is difficult to think of method names that don't collide with the Prelude, and it's not nice to have to write "mempty" in place of "empty". Part 2 of 2 - Monad versus Ancillary result type ================================ Another issue relates to left and right views of a sequence. If a sequence is non-empty, the left view is just the leftmost element and the rest of the sequence. The problem arises when the sequence is empty. In the Edison library, this is solved by returning a monadic value ie: lview :: Monad m => s a -> m (a, s a) whereas from the paper "Finger trees: a simple general purpose data structure" by Ralf Hinze and Ross Paterson they use an ancillary data type to store the result of a view: data ViewL s a = NilL | ConsL a (s a) viewL :: FingerTree a -> ViewL FingerTree a So my question here is: what's the best choice? I can see that the monadic version has the advantage that it could be used in do notation in cases where you expect the sequence to be non-empty, but has the disadvantage that it treats the empty sequence as something special (resulting in Monad/fail) and an extra indirection to find the components when the sequence is non-empty. Anyway these are my main questions for now - any feedback appreciated ;-) Thanks, Brian. -- Logic empowers us and Love gives us purpose. Yet still phantoms restless for eras long past, congealed in the present in unthought forms, strive mightily unseen to destroy us. http://www.metamilk.com

8 19

Reviving wxHaskell (was: Re: [wxhaskell-users] [Haskell-cafe] Trouble compiling wxhaskell)
by Jeremy O'Donoghue 01 Aug '06

01 Aug '06

Hi list, Apologies for continuing with the cross-posting, but wxhaskell-users is not exactly active. It seems like there may be enough interest in wxHaskell to justify trying to revive the project. At present, from what I can tell, Daan Leijen, the principal developer of wxHaskell, no longer has much interest in the project - the CVS log shows little activity for about 15 months now - and using wxHaskell with newer wxWidgets versions or on Unicode systems requires the application of various patches (for which the interested potential user must search diligently). Ideally, it would be best Daan for to enable new CVS committers to the project (or even to hand over project administration), but if this is not an option, is there a possibility of hosting a fork on hackage.haskell.org (I think there's a benefit in hosting Haskell-specific projects in a Haskell-friendly location). I don't have the time to nurture huge ambitions for wxHaskell, but I think it is realistic to aim for the following in the short term: * Patches to ensure that wxHaskell compiles against latest wxWidgets versions on Mac, Linux and Windows (exists today) * Add Eric Kow's Unicode patches (exist today) * Produce suitable binary packages for whatever targets we can get maintainers for, compatible with up-to-date versions of both GHC and wxWidgets. * Improve samples and documentation. In the longer term, we could look at: * Fixing operation with sash windows (a personal gripe ;-) - easy * Wrapping some of the more complex widgets - easy. * Subclassing of widgets in Haskell (i.e. allow C++ virtual methods to be redefined in Haskell) - moderately hard * Move from the Eiffel wxc bindings to wxC project to give better maintained interface to wxWidgets - time consuming, but easy * Porting to other Haskell implementations (Hugs, YHC etc) Taking on a project like this is a very significant commitment, and only makes sense if there are a number of willing contributors. I'm happy to kick this off and try to cover some of the boring 'administrative' bits, as well as contributing on documentation and smaller bug fixes, but I don't have time to save wxHaskell from permanent bit-rot. If there's enough interest, I'll push ahead with trying to organize this. Regards Jeremy On 01/08/06, shelarcy <shelarcy(a)gmail.com> wrote: > > > On 7/31/06, David F. Place <d(a)vidplace.com> wrote: > >> Hi: > >> > >> I'm having trouble compiling wxhaskell 0.9.4 under both ghc 6.4.2 and > >> ghc 6.5. Does anyone know where I should direct my queries? > > If you use ghc 6,4,2 under Windows platform, you > can use my patched version of wxHaskell. > > And you can get my patch from Kamiariduki's source. > > http://www.haskell.org/pipermail/haskell/2006-June/018043.html > https://sourceforge.net/project/showfiles.php?group_id=168626 > > > I also know Eric Y. Kow's unicode patch doesn't > include db problems fix. These problems has not > only wxWidgets 2.6.x change, but also unicode > change. > > I try to fix latter case, use attached after unicode > patch, this fixes compile problem ... but it has > another problem that can't use non-ascii characters > correctly. So, if want to accesss DB by wxHaskell's > ODBC, data is garbled and cause problems. > > I don't know how to fix that. > > Attached is already sent wxhaskell-user's list, but > you can't get this file. So I send again. > http://sourceforge.net/mailarchive/message.php?msg_id=16222530 > > > My patch where I put Kamiariduki's project page doesn't > include unicode support that I noticed above Mailng-List's > log. > > Don't worry about this. You can use both my patch and > unicode patch, if you want. These cause conflict message > but this is not problem. > > > On Tue, 01 Aug 2006 08:18:27 +0900, Jason Dagit > <dagit(a)eecs.oregonstate.edu> wrote: > > I've done this recently. I put my notes on the wiki: > > http://www.haskell.org/haskellwiki/WxHaskell/Install#Windows > > I don't know this problem when I made patch. > So, my patch doesn't fix this problem. > > > -- > shelarcy <shelarcy capella.freemail.ne.jp> > http://page.freett.com/shelarcy/ > > ------------------------------------------------------------------------- > Take Surveys. Earn Cash. Influence the Future of IT > Join SourceForge.net's Techsay panel and you'll get the chance to share > your > opinions on IT & business topics through brief surveys -- and earn cash > http://www.techsay.com/default.php?page=join.php&p=sourceforge&CID=DEVDEV > > _______________________________________________ > wxhaskell-users mailing list > wxhaskell-users(a)lists.sourceforge.net > https://lists.sourceforge.net/lists/listinfo/wxhaskell-users > > > >

1 0

Trouble compiling wxhaskell
by David F. Place 31 Jul '06

31 Jul '06

Hi: I'm having trouble compiling wxhaskell 0.9.4 under both ghc 6.4.2 and ghc 6.5. Does anyone know where I should direct my queries? Thanks. -------------------------------- David F. Place mailto:d@vidplace.com

6 5

Re: [Haskell-cafe] The difficulty of designing a sequence class
by David Menendez 31 Jul '06

31 Jul '06

Brian Hulley writes: > 1) Did Edison choose MonadPlus just because this fitted in with the > lack of multi-parameter typeclasses in H98? Instances of Monoid (and your ISeq) have kind *. Instances of MonadPlus (and Edison's Sequence) have kind * -> *. Functions like map, zip, and their variants are best defined in terms of type constructors. With Sequence, you have zipWith :: (Sequence s) => (a -> b -> c) -> s a -> s b -> s c With ISeq, you'd have to do something like zipWith :: (ISeq s1 a, ISeq s2 b, ISeq s3 c) => (a -> b -> c) -> s1 -> s2 -> s3 which isn't able to make any assumptions about s1, s2, and s3 having the same structure. > 3) Is it worth bothering to derive ISeq from Monoid (with the > possible extra inefficiency of the indirection through the > definitions for append = mappend etc or does the compiler completely > optimize this out)? I would expect the compiler to inline append. > 4) Would it be worth reconsidering the rules for top level names so > that class methods could always be local to their class (ditto for > value constructors and field names being local to their type > constructor). Qualified module imports are the way to go, here. Do you really want to start writing "if x Eq/== y Num/+ 1 then ... "? -- David Menendez <zednenem(a)psualum.com> | "In this house, we obey the laws <http://www.eyrie.org/~zednenem> | of thermodynamics!"

1 0

What is the state if Unicode in Haskell implementations?
by Olof Bjarnason 31 Jul '06

31 Jul '06

Hi there! I'm trying to user Haskell as a code-generating language, specifically generating C# code files. The wish list is 1) reading UTF-8 coded text files into unicode-enabled Strings, lets call them UString 2) writing UStrings to UTF-8 coded text files 3) using unicode strings in-code, that is in my .hs files I can live without 3), and with a little good will also 2), but 1) is harder since I cannot really hope my input files (meta-data-files) are coded in anything else than UTF-8. I've searched&browser the web for information on the current state of unicode in GHC/Hugs but the latest discussion I could find on the topic leaves me less than happy. BUT it is from january 2005 so I thought maybe you guys have more up-to-date answers to these questions. The discussion I found: http://groups.google.se/group/fa.haskell/browse_thread/thread/ccf1c6f32dbea… Thanks! /Olof

4 5