[Haskell-cafe] Search vs search vs search

Hi, I have some usability issues with the Haskell homepage. What is the best place to discuss them? 1) Search vs search vs search The front page has 3 search boxes: * at the top with the buttons Go and Search * the third link on the left called Search * the next link below Search haskell.org

[Haskell-cafe] Leaner Haskell.org frontpage

of a leaner, more structured Haskell front page: http://www.haskell.org/haskellwiki/User:Lenny222/Haskell Comments? Bye, Lenny ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] Leaner Haskell.org frontpage

-of/ On the current Haskell frontpage there are over 60 links competing for attention. I am not sure whether we should design interfaces solely with few people having exceptional abilities in mind. This could be understood as a statement about who Haskell is made for in itself. Bye, Lenny

Re: [Haskell-cafe] Leaner Haskell.org frontpage

things there are to be sayed about Haskell in the top left corner. For the hompage we're talking about, glancing is even simpler since everything is on the same page and you can scroll it quite easily. I don't agree that everything on one page makes comprehension easier. I'm not sure hiding

Re: [Haskell-cafe] Leaner Haskell.org frontpage

I never said we should only expose 7 links. Take for example the task Find out more about this Haskell i heared about. You would need to scan the right half of the front page and you need to scan the left part of the page. There you need to scan About, it could be explained under Why use

[Haskell-cafe] Mapping over multiple values of a list at once?

way to do that? The naive ansatz to use (!!) excessively sounds pretty inefficient. Bye, Lenny ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] Mapping over multiple values of a list at once?

tails seems to be the key. I haven't thought of this before. Thanks for pointing me in the right direction, guys. ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] Recommended Haskell Books

Also the Beta Version of Real World Haskell looks promising: http://book.realworldhaskell.org/beta/index.html On Sun, Aug 10, 2008 at 1:29 PM, Warren Aldred [EMAIL PROTECTED] wrote: I'm new to Haskell and looking for recommendations on introductory Haskell books. Online or offline. Any

[Haskell-cafe] FiniteMap, Map, FiniteSet, Set

Here's a really elementary question: Why does the library have [FiniteMap and Set] instead of [FiniteMap and FiniteSet] or just [Map and Set]? Is there some reason for this inconsistency? Thanks, James ___ Haskell-Cafe mailing list [EMAIL PROTECTED

[Haskell-cafe] Hierarchical Library

___ Haskell-Cafe mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell-cafe

[Haskell-cafe] Type Theory? Relations

String in Haskell. This is, according to the definitions above, a Set (Int,String).An element of that has type (Int,String), which contains {Int,String}. But that can't exist because a Set contains only elements of one type. What I'm getting at is that it seems that a Relation should be defined

[Haskell-cafe] Parsec Problem

. ___ Haskell-Cafe mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] Pesky monads...

- getExit_ e True return undefined continueW = ask = \e - getExit e True return undefined ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] how can I select all the 3-element-combination out of a list efficiently

___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] List algorithm

]] ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] Network.HTTP+ByteStrings Interface--Or: How to shepherd handles and go with the flow at the same time?

or at least stop trying to read from it. That way there is no _need_ to 'seq' your way to the end of the lazy bytestring to cause it to close. -- Chris ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell

Re: [Haskell-cafe] Finding points contained within a convex hull.

may find no integer points in its convex hull, but that does not stop the algorithm from checking the next value of x in the series. The above looks like a polynomial time complexity algorithm to me. Cheers, Chris ___ Haskell-Cafe mailing list

Re: [Haskell-cafe] Finding points contained within a convex hull.

___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] Which regular syntax does Text.Regex use?

/posix.html The specification is at http://www.opengroup.org/onlinepubs/009695399/basedefs/xbd_chap09.html -- Chris ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] Evaluation of IO actions in record assignment

, userPanelRepeatEntry = repeatEntry} Thanks, Adde ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org

Re: [Haskell-cafe] Floating phi, round and even Fibonnaci numbers

) ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] Floating phi, round and even Fibonnaci numbers

: even_fibs' :: (Integral t) = [t] even_fibs' = iterate (\x - round(fromIntegral x * (dp**3))) 2 where dp :: Float dp = phi So it fails earlier: head $ dropWhile (uncurry (==)) $ zip even_fibs' even_fibs_2 (14930353,14930352) ___ Haskell-Cafe

Re: [Haskell-cafe] Floating phi, round and even Fibonnaci numbers

,71558092601766452430641106302905217344934236440122960529002115744) ... ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] Re: money type ?

must round. Perhaps we should have a binding to this. Anyway, sorting out how money is supposed to be represented in Haskell, and documenting it, seems a very useful thing. -- Don It is funny that this thread is going on alongside the Defaulting to Rational thread. There are separate issues

Re: [Haskell-cafe] Re: xkcd #287 NP-Complete

'with'. This is achieve by the using_cost items being after the (poor ++) which means they have been shifted by (length poor) positions which, by the definition of (splitN cost), is equal to 'cost'. Cheers, Chris ___ Haskell-Cafe mailing list Haskell-Cafe

Re: [Haskell-cafe] Time consumption nub

or nsortBy, which benchmark (with -O2) as slightly faster than (map head . group . sort) Cheers, Chris ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

[Haskell-cafe] Performance question

Hi, i have compared a C++ implementation with a Haskell implementation of the Monte Carlo Pi approximation: http://lennart.kudling.de/haskellPi/ The Haskell version is 100 times slower and i wonder whether i do something obvious wrong. Profiling says that the majority of the time is spend

Re: [Haskell-cafe] Performance question

But you can remove sqrt from the C++ implementation as well, so it only improves the relative performance if the C++ implementation of sqrt is worse than its Haskell counterpart. Oops, of course I mean, you only improve if Haskell's implementation is worse than C++'s implementation

Re: [Haskell-cafe] Performance question

:: (Floating a, Ord a) = (a,a) - Bool with isInCircle :: (Double, Double) - Bool Can you point me to why that matters? Ben. On 26/02/2009, at 8:53 PM, hask...@kudling.de wrote: Hi, i have compared a C++ implementation with a Haskell implementation of the Monte Carlo Pi approximation: http

Re: [Haskell-cafe] Performance question

. ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] Performance question

. ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe -- Eugene Kirpichov Web IR developer, market.yandex.ru ___ Haskell-Cafe mailing list Haskell-Cafe

[Haskell-cafe] Testing

Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

[Haskell-cafe] INVITATION

Haskell Hall is up and running. Haskell Hall is a mailing list, a forum, where you can discuss Haskell, functional programming and anything related, freely and openly with fellow enthusiasts. We welcome people of all abilities and know-how. So, if you fancy a change from what you get

[Haskell-cafe] Re: borked windows environment, want to start over

On 11/18/2010 5:02 PM, Michael Litchard wrote: On Tue, Nov 16, 2010 at 4:39 PM, Michael Litchard mich...@schmong.org wrote: I think I may have borked things good using cygwin. I want to remove it and do a clean install of haskell platform w/out cygwin. What do I need to do to make sure all

Re: determining if a int is a power

[EMAIL PROTECTED] writes: I'm new to haskell and have to do some excersises. Okay. Thank you for being up-front about it. You got some advice, so I'll just add that So i have been trying using any with a helper function Yep, this is a good way to do it. You may want to consider filter

Re: Preventing/handling space leaks

Henk-Jan.van.Tuyl [EMAIL PROTECTED] writes: L.S., (Whom?) Does anyone know about documentation (preferably on the Web) on how to prevent/find/remove space leaks? Are there any differences between Hugs and GHC or any other Haskell platform, regarding space leaks? I should probably invest

Re: Preventing/handling space leaks

to this: http://www.awprofessional.com/content/images/020163371x/supplements/Exception_Handling_Article.html I'd also add that GC is more important in object oriented programming, it's more natural to pass objects around on a larger scale. At least IME. And one final remark on Haskell and Java

[Haskell-cafe] hxt validation outside of IO?

Hello. Is it possible to validate XML trees against a RELAX NG schema outside of IO, using hxt? All of the functions I can see use an IOSArrow. I'm not sure what I'm missing. ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http

[Haskell-cafe] CFP -- Haskell Symposium 2011

                     Haskell 2011              ACM SIGPLAN Haskell Symposium 2011                       Tokyo, Japan                   22nd September, 2011                      CALL FOR PAPERS       http://www.haskell.org/haskell-symposium/2011/ The ACM SIGPLAN Haskell Symposium 2011

[Haskell-cafe] Slightly tangential topic about functional programming (specifically, Lambda-Calculus)

Hi everybody - I'm just starting to learn Haskell, and I figured it would be productive to first review my Lambda-Calculus that I picked up in college. Actually, we only touched upon it in college, so I'm effective learning it all over again for the first time. Anyway, I'm working my way through

[Haskell-cafe] How not to force ghci debugger but still know the _result?

___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] Re: A suggestion for the next high profile Haskell project

mentioned that this project may be hihgly speed-dependent and this case Haskell is definitely not the solution I highly disagree. Why would you want to write 99% of your code in a tedious and error-prone way to get speed in 1% of your code? Isn't it better to write that 1% of the code in a slightly

Re: [Haskell-cafe] Re: A suggestion for the next high profile Haskell project

Bulat Ziganshin [EMAIL PROTECTED] writes: Hello ajb, Monday, December 18, 2006, 4:12:01 AM, you wrote: time. For example, for certain types of problem, Haskell minimises the amount of time between the point where I start typing and the point where I have the answer. of course, we can

Re: [Haskell-cafe] Re: A suggestion for the next high profile Haskell project

there by the enemy). How would you lock data in memory in Haskell? Would that be possible? It seems to me that all participants in this thread have missed this point so far. You could just mlock() everything allocated by the RTS... Brute force. :-) Certainly the most simple way to do

[Haskell-cafe] Re: A suggestion for the next high profile Haskell project

Tomasz Zielonka [EMAIL PROTECTED] writes: Anyway, don't concentrate on this particular example. All I say is that: - sometimes I get efficient programs in Haskell right away (I my case quite often, but YMMV) - sometimes efficiency doesn't matter I don't think it is contradictory

Re: [Haskell-cafe] Re: A suggestion for the next high profile Haskell project

where the process provides appropriate guarantees that allow it to handle exposable and non-exposable storage at the same time. (Should I write disclosure anstead of exposure?) Whatever -- I think the implementing crypto in Haskell would be a good thing, but the issue of how to prevent swapping

Re: [Haskell-cafe] Re: A suggestion for the next high profile Haskell project

Bulat Ziganshin [EMAIL PROTECTED] writes: Hello Tomasz, Tuesday, December 19, 2006, 3:19:52 PM, you wrote: why you (and Donald) don't want to understand me. i say that imperative Haskell code is more efficient Your statement is too general to deserve answering. can you provide couter

Re: [Haskell-cafe] Re: Optimization fun

-midnight.html#how-to-spend-midnight This is my implementation, please, forgive my shameless self-advertisment :-). Regards -- Markus ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

[Haskell-cafe] Can't Haskell catch up with Clean's uniqueness typing?

Hi all, being occupied with learning both languages, I'm getting curious if Haskell couldn't achieve most of the performance gains resulting from uniqueness typing in Clean by *automatically* determining the reference count of arguments wherever possible and subsequently allowing them

Re: [Haskell-cafe] Can't Haskell catch upwith Clean's uniqueness typing?

From: Shae Matijs Erisson - [EMAIL PROTECTED] Sent: Tuesday, December 06, 2005 6:16 PM [EMAIL PROTECTED] writes: being occupied with learning both languages, I'm getting curious if Haskell couldn't achieve most of the performance gains resulting from uniqueness typing in Clean

Re: [Haskell-cafe] Can't Haskell catch up with Clean's uniqueness typing?

checker knows the coercion laws better than me, anyway. Hence, my question about automatically deriving uniqueness properties of tokens, to the greatest extent safely feasible at compile time. (Sorry, if this is all trivial and already implemented in ghc. As indicated, I am merely learning Haskell

Re: [Haskell-cafe] Can't Haskell catch up with Clean's uniqueness typing?

- Original Message - From: Tomasz Zielonka - [EMAIL PROTECTED] Sent: Tuesday, December 06, 2005 9:18 PM We can get similar performance from Haskell using various features of GHC (unboxed arrays, mutable arrays, ST monad, soon SMP, etc) and one can argue that they are even nicer

Re: [Haskell-cafe] Can't Haskell catch up with Clean's uniqueness typing?

On Wed, Dec 07, 2005 at 05:59:55PM +0100, [EMAIL PROTECTED] wrote: I liked the concept of UT in Clean, but I haven't ever got comfortable with using it to write real programs. Clean-like _explicit_ uniqueness typing is not what I'm asking for in Haskell. So you want implicit, automatically

Re: [Haskell-cafe] Can't Haskell catch up with Clean's uniqueness typing?

- Original Message - From: Wolfgang Jeltsch - [EMAIL PROTECTED] Sent: Thursday, December 08, 2005 6:13 PM I thought that the original question was about using some kind of uniqueness type system at an intermediate stage during compiling. Haskell would still have no uniqueness

Re: [Haskell-cafe] Can't Haskell catch up with Clean's uniqueness typing?

- Original Message - From: Tomasz Zielonka - [EMAIL PROTECTED] Sent: Wednesday, December 07, 2005 8:53 PM Clean-like _explicit_ uniqueness typing is not what I'm asking for in Haskell. So you want implicit, automatically inferred uniqueness typing - something that would

Re: [Haskell-cafe] Can't Haskell catch up with Clean's uniqueness typing?

- Original Message - From: Tomasz Zielonka - [EMAIL PROTECTED] Sent: Wednesday, December 07, 2005 8:53 PM Clean-like _explicit_ uniqueness typing is not what I'm asking for in Haskell. So you want implicit, automatically inferred uniqueness typing - something that would be even

Re: [Haskell-cafe] Can't Haskell catch up with Clean's uniqueness typing?

On Thu, Dec 08, 2005 at 06:38:53PM +0100, [EMAIL PROTECTED] wrote: - Original Message - From: Tomasz Zielonka - [EMAIL PROTECTED] Sent: Wednesday, December 07, 2005 8:53 PM Clean-like _explicit_ uniqueness typing is not what I'm asking for in Haskell. So you want implicit

Re: [Haskell-cafe] Can't Haskell catch up with Clean's uniqueness typing?

the optimisation it in the first place. If you prefer consistently slower code to accidentilly faster one, you can still turn off the optimisations of your choice. :) We already have this issue in Haskell with strictness. This holds for nearly every automatical optimisation, doesn't it? So

[Haskell-cafe] mailman issue

mailman is somehow confused by this weird address: xoxy = haskell-cafe [EMAIL PROTECTED] ? Relevant headers of this message: [...] Looks like gourmet.spamgourmet.com resends to haskell-cafe@haskell.org messages addressed to [EMAIL PROTECTED] as if they were send from [EMAIL PROTECTED

Re: representation getting verbose...

been looking over your paper on using Haskell as an Embedded DSL, which is extremely appealing for my application. I'm attempting to synthesize all of this into a coherent game plan... What I did in my book was very simple, and the use of variables was only given as an exercise (by the way, you

representation getting verbose...

but decrease the verbosity? peace, Isaac Jones ___ Haskell-Cafe mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell-cafe

Haskell related Debian packages

I'm considering packaging several Haskell libraries for Debian, and wonder what people think about where things should go. Please excuse me if anyone feels that this email isn't appropriate for this mailing list. Though these are somewhat Debian-specific questions, I thought that some Haskell

Re: [Haskell-cafe] Algorithms

___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] Poor first impression

that ... on Fedora Core 6 all he had to do was, yum install ghc Well. I mean, that practically tells me all about poor first impressions and the OPs own level of competence. Regards -- Markus ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http

Re: [Haskell-cafe] Poor first impression

didn't work for me, so I won't use it ever again, there!). Regards -- Markus ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] Poor first impression

yourself I'd be expecting from programmers. If one doesn't have it, he/she should just use the packages of his/her distro or another distro. Regards -- Markus ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman

Re: [Haskell-cafe] Silly mail client

Andrew Coppin [EMAIL PROTECTED] writes: OK, this is hacking me off now... Does ANYBODY know how I can convince Thunderbird to send replies to Haskell Cafe rather than sending them to the original poster? This is really becoming tiresome... My best approach to that has been to explicitely

Re: [Haskell-cafe] Silly mail client

Chris Eidhof [EMAIL PROTECTED] writes: One thing I did was replacing the Reply button in my toolbar with Reply All. The only problem is that I always use Cmd+R instead of clicking a button, but I'm at least a little bit closer. (and: No top posting please.) Yes, I just found, that haskell

Re: [Haskell-cafe] ANNOUNCE: iterIO-0.1 - iteratee-based IO with pipe operators

to the handling thread using throwTo if the timeout is exceeded. Excellent point. There's actually a chance that iterIO already catches those kinds of exceptions, but I wasn't sure enough about how the Haskell runtime works to make that claim. I've noticed in practice that asynchronous exceptions tend

Re: [Haskell-cafe] ANNOUNCE: iterIO-0.1 - iteratee-based IO with pipe operators

are simpler. e) enumerator has fewer dependencies. f) enumerator uses conventional nomenclature. g) enumerator is Haskell 98, while iterIO needs many extensions (e.g. MPTC and functional dependencies). Anything that I missed? The bottomline: the biggest advantage I see right now

Re: [Haskell-cafe] ANNOUNCE: iterIO-0.1 - iteratee-based IO with pipe operators

___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] ANNOUNCE: iterIO-0.1 - iteratee-based IO with pipe operators

for the terms iteratee, enumerator and enumeratee would go a hell of a long way here; Peaker on #haskell suggested Consumer/Producer/Transformer, and there is a lot of agreement in the channel that these are vastly better names. They’re also far less intimidating to users. I personally feel

Re: [Haskell-cafe] ANNOUNCE: iterIO-0.1 - iteratee-based IO with pipe operators

which is one of the things I need. But how do I get an Fd in the first place? (unix-compat seems to have no equivalent of openFd.) David ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] ANNOUNCE: iterIO-0.1 - iteratee-based IO with pipe operators

consider changing the names in the iterIO library, but it's a pretty big change... David ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] ANNOUNCE: iterIO-0.1 - iteratee-based IO with pipe operators

the amount of stuff in contexts. (Of course, (Iter t m) itself is an Applicative Functor, even when m is just a Monad. So that I make use of in the parsing module.) David ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman

Re: [Haskell-cafe] Type-class conditional behavior

a data AV t where AVLeft :: AV (Showable a) - AV (Either (Showable a) b) David ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] ANNOUNCE: iterIO-0.1 - iteratee-based IO with pipe operators

.  g) enumerator is Haskell 98, while iterIO needs many extensions (e.g. MPTC and functional dependencies). 'a' is important, but I think a lot of people underestimate the value of 'c', which is why a control system was implemented in 'iteratee'. ... it's relatively simple

Re: [Haskell-cafe] ANNOUNCE: iterIO-0.1 - iteratee-based IO with pipe operators

a `finallyI` after a David ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] ANNOUNCE: iterIO-0.1 - iteratee-based IO with pipe operators

a `finallyI` after a David ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] ANNOUNCE: iterIO-0.1 - iteratee-based IO with pipe operators

___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] ANNOUNCE: iterIO-0.1 - iteratee-based IO with pipe operators

or equivalent every time I use unmaskAsyncExceptions#... David ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] Sending messages up-and-down the iteratee-enumerator chain [Was: iterIO-0.1]

stuck on is figuring out the right way to sequence the downstream requests with respect to the input data, particularly when you have enumeratees transcoding from one type to the other. Any thoughts? Thanks, David ___ Haskell-Cafe mailing list Haskell

Re: [Haskell-cafe] ANNOUNCE: iterIO-0.1 - iteratee-based IO with pipe operators

to get more performance is through parallelism. How are we going to teach programmers to write concurrent code when it's so hard to write and debug? I've heard numerous people ask. Haskell could be a major step in the right direction, since in the absence of variables, it's impossible to have data

Re: [Haskell-cafe] ANNOUNCE: iterIO-0.1 - iteratee-based IO with pipe operators

and the blog post is simply wrong about needing MVars. David ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

[Haskell-cafe] Haskell memory model (was iterIO-0.1)

Haskell has a memory model, and we have to say what it is, or at least say that ordering is undefined. Right. So I think the memory model is something along the lines of the no-crash property you mentioned--i.e., readIORef will return some value written with writeIORef and not a mish-mash of multiple

Re: [Haskell-cafe] Haskell memory model (was iterIO-0.1)

increases the scope of what a writer can do, since they can perform an update on a bunch of state at the same time. Good point. There is an operational semantics in the Concurrent Haskell paper that does not admit the behaviour you describe, but I'll add something to the docs

[Haskell-cafe] Enabling GADTs breaks Rank2Types code compilation - Why?

several workarounds for the issue, but I'd like to understand what the error message means and why it is caused by GADTs. Thanks in advance for any help. David ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo

Re: [Haskell-cafe] Enabling GADTs breaks Rank2Types code compilation - Why?

-proof my code. However, is it reasonable to conclude that if I'm going to use GADTs anyway, then additionally enabling ScopedTypeVariables doesn't really make my code any less future-proof? Thanks, David ___ Haskell-Cafe mailing list Haskell-Cafe

Re: [Haskell-cafe] Iteratees again (Was: How on Earth Do You Reason about Space?)

with the point about dependencies and waiting for the dust to settle, though I hope a lot of that changes in a year or so. However, iterIO should already significantly reduce the complexity. David ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org

[Haskell-cafe] What is a simple pattern binding?

Section 4.4.3.2 of the 2010 Haskell report says: A simple pattern binding has form p = e. The pattern p is matched “lazily” as an irrefutable pattern, as if there were an implicit ~ in front of it. This makes it sound as though p is a pattern, which I assume means what

Re: [Haskell-cafe] What is a simple pattern binding?

. How can my example have two declaration groups when this example has only one? David ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] What is a simple pattern binding?

me a better definition of declaration group, ideally with support in the language spec... David ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] What is a simple pattern binding?

is given for EVERY variable when there can be only one such variable? David ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] What is a simple pattern binding?

At Sun, 26 Jun 2011 09:31:05 +0100, Paterson, Ross wrote: Indeed, the Report has two problems: Sections 4.4.3.2 and 4.5.5 have different definitions of simple pattern. This has been there since section 4.5.5 (Monomorphism Restriction) was added in Haskell 1.1. But then the only technical

Re: [Haskell-cafe] What is a simple pattern binding?

for the declaration. I already sent the haskell-prime mailing list a proposal for the following wording: A binding b1 depends on a binding b2 in the same list of declarations if either 1. b1 contains a free identifier v, v is bound by b2, and the list

Re: [Haskell-cafe] IterIO type restricted functions

than plain Strings. (enumFile supports multiple types, but in this example there is not enough information for Haskell to choose one of them, so we must use enumfile' or use :: to specify a type explicitly. Which is fine, but shouldn't there also be iterHandle' and iterStream

Re: [Haskell-cafe] How to flush with IterIO in echo server

At Wed, 29 Jun 2011 21:13:47 +1000, John Ky wrote: Hi Haskell Cafe, I've written an echo server using just sockets: ... When I send text to it, it will echo it back immediately after my newline. I then modified it to user IterIO: import Control.Concurrent import

Re: [Haskell-cafe] Confused about my IterIO code

or handle EOF conditions. David ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] Patterns for processing large but finite streams

from: - http://hackage.haskell.org/package/iteratee(original) - http://hackage.haskell.org/package/enumerator (John Milikin's re-write) - http://hackage.haskell.org/package/iterIO (my 3rd-generation attempt) David ___ Haskell-Cafe mailing

Re: [Haskell-cafe] Strange context reduction with partial application and casting

. This makes the code more readable. It has the disadvantage that Haskell doesn't allow you to name monomorphic type variables, which, for local bindings, can require either the use of -XScopedTypeVariables or giving extra function arguments whose only purpose is to bring a type variable into scope. But both

  1   2   >