[Haskell-cafe] Adding Html formatting to formlets

I came across the idea that is easy to define additional operators to Text.FormLets for adding custom HTML formatting. Had anyone tried that? For example to enclose the Prod formulary in a Table using Text.XHtml tags. I defined additional operators <<< and <++ for enclosing and prepending Html to

Re: [Haskell-cafe] What happens if you get hit by a bus?

Hehee Great. Haskell is a flexible high level language perfect for domain specific languages it isn't?. A well designed solution is, at the top level, simple and understandable even by non experts. The software transforms the complexities of the hardware into something that the user can understan

[Haskell-cafe] ANNOUNCE: Workflow-0.5.8.0

This is A new version of the package workflow. I probably will change the name of this package since it is too generic. A workflow can be seen as a persistent thread that executes a monadic computation. Therefore, it can be used in very time consuming computations such are CPU intensive calcula

Re: [Haskell-cafe] Poll: Do you want a mascot?

{^_^} ||| 2011/11/23 Alejandro Serrano Mena > Yes > > 2011/11/23 heathmatlock > >> On Wed, Nov 23, 2011 at 1:40 PM, Alexander Bernauer < >> alex-hask...@copton.net> wrote: >> >>> Yes >>> >>> PS: Why not using Doodle for the poll? >>> >> >> Email is an easy way to make sure nobody votes

Re: [Haskell-cafe] Easiest to use NoSQL storage with Haskell?

TCache manages persistent data trough STM references called DBRefs that are very similar to TVars, but with added user-configurable persistence. Very intuitive to use. 2011/11/9 Bas van Dijk : > On 9 November 2011 19:50, dokondr wrote: >> On Wed, Nov 9, 2011 at 8:41 PM, Bas van Dijk wrote: >>>

Re: [Haskell-cafe] Persistent Concurrent Data Structures

hi Dimitri Take a look at TCache. It is a transactional cache with configurable persistence. http://hackage.haskell.org/package/TCache It defines persistent TVars (DBRef`s) with similar primitives. Persistence can be defined by the user for each datatype by an instance declaration. There is a

[Haskell-cafe] Fwd: Organizing big repository

This is not evident in hte documentation, but Leksah does these things for you if you add your packages to the workspace list.. It is necessary to use the background compilation option, that is, set by default. Alberto 2011/10/27 Konstantin Litvinenko > I am trying to understand how to orga

Re: [Haskell-cafe] Organizing big repository

This is not evident in hte documentation, but Leksah does these things for you if you add your packages to the workspace list.. It is necessary to use the background compilation option, that is, set by default. Alberto 2011/10/27 Konstantin Litvinenko > I am trying to understand how to orga

Re: [Haskell-cafe] Efficient mutable arrays in STM

> > > The main question is: does the STM transaction actually "see" that I > changed > part of the underlying array, so that the transaction gets re-tried? Or do > I > have to implement this manually, and if yes: how? > > The transaction does not detect anything inside the unsafeIOtoSTM. But to im

Re: [Haskell-cafe] Fwd: Is it possible to represent such polymorphism?

That´s the very same advantage and disadvantage when using any EDSLs, By the way 2011/10/6 Steffen Schuldenzucker > On 10/05/2011 11:30 PM, Alberto G. Corona wrote: > >> >> if Hlist is sugarized as variable length tuples, then the initial code >> would compile without n

[Haskell-cafe] Fwd: Is it possible to represent such polymorphism?

if Hlist is sugarized as variable length tuples, then the initial code would compile without noticing the use of HList... 2011/10/5 Felipe Almeida Lessa > On Wed, Oct 5, 2011 at 8:45 AM, Alberto G. Corona > wrote: > > If a newbie considers this as something natural, this is an

Re: [Haskell-cafe] Is it possible to represent such polymorphism?

If a newbie considers this as something natural, this is another reason for syntactic sugaring of HList: http://www.haskell.org/pipermail/haskell-cafe/2011-April/090986.html 2011/10/2 Du Xi > --I tried to write such polymorphic function: > > expand (x,y,z) = (x,y,z) > expand (x,y) = (x,y,1) > >

Re: [Haskell-cafe] Where is SNMap for stable names?

How do you do that, since Stable Names have not an Ord instance?. Using the Eq instance the lookup should be O(n). The paper suggest that SNMap is a hash table, presumably with hashStableNames underneath: This should work more or less . using Data.HashTable Import Data.HashTable import Data.Dyn

Re: [Haskell-cafe] Smarter do notation

The problem in the parallel distribution of monadic computations that may have been Applicative seems to be the >> operator But if Monad is defined as a subclass of applicative: http://www.haskell.org/haskellwiki/Functor-Applicative-Monad_Proposal then ">>" can be defined as (>>) = (*>) an

[Haskell-cafe] Fwd: Smarter do notation

-- Forwarded message -- From: Alberto G. Corona Date: 2011/9/5 Subject: Re: [Haskell-cafe] Smarter do notation To: Sebastian Fischer Cc: Max Bolingbroke , haskell-cafe@haskell.org The problem in the parallel distribution of monadic computations that may have been Applicative

[Haskell-cafe] Fwd: The Typeable class is changing

What to do when the data has been defined in other package and provides no Typeable instance? 2011/7/11 Yitzchak Gale > Simon Marlow has announced[1] on the Haskell Libraries > list that the Typeable class is changing. > > The standard way to create a Typeable instance is > just to derive it. I

Re: [Haskell-cafe] Possible bug in GHC 7.0.3

http://hackage.haskell.org/trac/ghc/ticket/5287 El 29/06/2011 10:22, "Yitzchak Gale" escribió: > Ryan Ingram wrote: >> So this is definitely a GHC bug, but I think the problem is probably >> triggered by this line: >> >> instance Serializable a b => IResource a >> >> I don't think this is a valid

Re: [Haskell-cafe] Possible bug in GHC 7.0.3

Ryan' P robably the read instance can not be infered without the functional dependency but the bug is also triggered with it. I simplified ithe coder as much as possible El 29/06/2011 02:26, "Ryan Ingram" escribió: ___ Haskell-Cafe mailing list Haskell-C

Re: [Haskell-cafe] Possible bug in GHC 7.0.3

Reported: http://hackage.haskell.org/trac/ghc/ticket/5287 2011/6/28 Alberto G. Corona > > 2011/6/28 Jason Dagit > >> On Tue, Jun 28, 2011 at 3:43 AM, Alberto G. Corona >> wrote: >> > I have an "'impossible' happened" error. >> > The

[Haskell-cafe] Possible bug in GHC 7.0.3

I have an "'impossible' happened" error. The code may look a little bit convoluted but it is part of my real code.: - begin of code-- {-# LANGUAGE FlexibleInstances, UndecidableInstances , MultiParamTypeClasses #-} class Serializable a b class IRe

Re: [Haskell-cafe] Category theory as a design tool

Tjhis presentation has been very useful for me: Category Theory for software engineers,. http://www.cs.toronto.edu/~sme/presentations/cat101.pdf It is an excelent introduction using basic notations (graphs). It includes "Applying category theory to specifications" and "Tools based on category

Re: [Haskell-cafe] *GROUP HUG*

fluency in Scala is an industry asset, since it runs in the Java VM, while Haskell is an academic asset as well as a fun asset. The value of an industry asset grows with the lack of competence of others. Therefore competing guys are not welcome. There are enoug crocodiles in the pond. Alberto.

[Haskell-cafe] Fwd: Re: Binary and Serialize classes

-- Forwarded message -- De: "Alberto G. Corona" Fecha: 03/05/2011 11:24 Asunto: Re: [Haskell-cafe] Binary and Serialize classes Para: "Antoine Latter" E1610With the exception of heavy serialization usage, for example, in very optimized RPC applications

Re: [Haskell-cafe] deriving instances in GHC 7.*

Well, this is not so general. It seems to be associated to the inferred contexts in automatically derived instances (generated with the "deriving" keyword). I will write a clear example as soon as I make sure what is different between GHC 6 and 7 about this. 2011/4/18 Alberto G. Corona

[Haskell-cafe] deriving instances in GHC 7.*

By my little experience with GHC 7.* it seems that this version is more "deterministic" when deriving instances. For example if there is a general instance declaration such is: instance C1 x=> C2 x where then the absence of the C1 instance becomes an error. C1 instance becomes a prerequis

[Haskell-cafe] ANNOUNCE: TCache 0.8

Tired of your persistence layer? Take persistence the haskelll way. Besides the backward compatible stuff, TCache now defines persistent STM variables (DBRef's) that leverages the traditional haskell reference syntax to perform fast in-memory database transactions and inter-object references. It

Re: [Haskell-cafe] syntactic sugar for heterogeneous lists

other kind of structures, and the lack of standardization (i.e sugaring to begin with) makes them not being widely adopted. That´s my opinion... Albert. 2011/4/12 Antoine Latter > On Tue, Apr 12, 2011 at 12:57 PM, Alberto G. Corona > wrote: > > Hi Cafe: > > http://hackage.ha

[Haskell-cafe] syntactic sugar for heterogeneous lists

Hi Cafe: http://hackage.haskell.org/trac/ghc/ticket/1245 I also want some kind of syntactic sugar for H. Lists. The absence of syntactic sugar makes heterogeneous list to look scary. People in haskell is accostumed to syntactic sugaring, so people think of not sugared expressions as second clas

Re: [Haskell-cafe] Haskell IDE

uch is GHCI. 2011/3/7 Daniel Fischer > On Monday 07 March 2011 16:08:01, Alberto G. Corona wrote: > > I use leksah, and I want to say thanks to the people that maintain it. I > > want also to encourage them to continuing its valuable work. > > > > from the last re

Re: [Haskell-cafe] Haskell IDE

I use leksah, and I want to say thanks to the people that maintain it. I want also to encourage them to continuing its valuable work. from the last release of Leksah, I particulary appreciate its: Multiplatform support Ease of installation in all platforms including windows capability to works wi

Re: [Haskell-cafe] type safe web forms at compile time Was: Re: Ur vs Haskell

> WASH is full of wonderful ideas . packed in a not so wonderful syntax. It > is worth to evolve it. > > WASH does force form safety in a similar way to Formlets > : because the form and the > form read code are generated automatically by a class instan

[Haskell-cafe] type safe web forms at compile time Was: Re: Ur vs Haskell

Hi. Some time ago I forgot to forward this message to thie ur versus Haskell discussion, (as usual) --- The most impressive feature (of ur) is the compile time checking of conformance between the form and the form results. T

Re: [Haskell-cafe] ANN: unordered-containers - a new, faster hashing-based containers library

I took a rapid look and they seem a replacement for pure Map's, but not for mutable HashTable's. Sorry if it isn't the case. I don´t know if Data.HashTable has improved, but the performance used to be very poor in comparison with other languages. The point is that pure data structures can not be

[Haskell-cafe] monadic plumbing

Recently I had to navigatate trough data structures chained with mutable referenes in th STM monad. The problem is that their values are enveloped in Either or Maybe results. functional compositions in the Either of Maybe , or list monads are not possible when the values are embedded inside eff

Re: [Haskell-cafe] H98, OOHaskell - getting started with objects in Haskell

Hi! 2011/1/14 gutti I'm especially interestes in engineering calculation tasks where cellular > automata could be used. In that case all u have to do is to give the class > the right properties and that "let it grow". > > Such a localised intelligence approach seems an ideal OO - task. I don't >

Re: [Haskell-cafe] Type System vs Test Driven Development

2011/1/12 Serge Le Huitouze > Evan Laforge wrote: > . > So, in addition to defining the approximation (not always easy as I tried > to "demonstrate" above) to be used in comparisons, one probably needs > ad'hoc generators whose complexity might very well exceed that of > the code one wants t

Re: [Haskell-cafe] Rather off topic: An ab initio universe simulation?

The good fact about evolutionary simulations is that all is theoretically possible . The bad fact is that in practice is very hard to achieve results. Biota.org has links to some artificial life projects.Some of them are naive, but some others may be interesting. http://www.biota.org/

Re: [Haskell-cafe] [Haskell] ANNOUNCE: genprog-0.1

> > Hi! >> >> On Thu, Dec 9, 2010 at 1:48 PM, Alberto G. Corona >> wrote: >> > assign rates of mutation for each statement, >> >> This could be assigned by evolution itself. If "if" will have high >> probability of mutation then resul

Re: [Haskell-cafe] [Haskell] ANNOUNCE: genprog-0.1

Hi Ketil, 2010/12/9 Ketil Malde > Mitar writes: > > >> Neither Haskell nor any conventional language has [evolved to evolve] > > > True. > > Well - thinking about it, there's no fundamental difference between > genetic algorithms - where you have a "genome" in the form of a set of > parameters

Re: [Haskell-cafe] [Haskell] ANNOUNCE: genprog-0.1

Hi ;) 2010/12/8 Mitar > Hi! > > On Wed, Dec 8, 2010 at 3:39 PM, Alberto G. Corona > wrote: > > DNK? I think you mean DNA. > > Sorry. In my native language it is DNK. ;-) > > > the genotype program that develips the fenotype is much more smooth and > &

Re: [Haskell-cafe] [Haskell] ANNOUNCE: genprog-0.1

Dec 8, 2010 at 12:33 PM, Alberto G. Corona >> wrote: >> > But programs are non lineal. >> >> And DNK is? I doubt. ;-) >> >> I think the approach is valid, it simulates what is happening in >> nature (random insertions, deletions, changes, translations, copie

Re: [Haskell-cafe] [Haskell] ANNOUNCE: genprog-0.1

Off topic I was deeply involved in genetic programming in the past (in fact I discovered Haskell on looking for a functional language for genetic programing with better syntax than LISP). But I soon realized that GP was not the holy grial after all. The problem with evolving arbitrary programmi

Re: [Haskell-cafe] Making monadic code more concise

I like your autolifting stuff, and the runnable concept. > 2010/11/15 Ling Yang > > See my reply to Alex's post for my perspective on how this relates to >> applicative functors, reproduced here: >> >> >> This, to me, is a big hint that applicative functors could be useful. >> > >> >Indeed, the

Re: [Haskell-cafe] Re: dynamic loading of code on windows

I use Hint for the same purpose. It has been tested under windows 2010/11/12 Arnaud Bailly > Hello Kevin, > Thanks. I understand that this is a toolchain issue, I just got used > to the nice feeling of having 'cabal install foo' works seamlessly and > flawlessly to get me some magic piece of sof

Re: [Haskell-cafe] Serialization of (a -> b) and IO a

nstance Read (F a) where read str= eval str >>= F str sorry 2010/11/11 Alberto G. Corona > There are some straighforward tricks using the package eval (or hint)l. > > This is more or less the idea in pseudocode: > > type FuncExpr= String > > data F a = F FuncExpr

Re: [Haskell-cafe] Serialization of (a -> b) and IO a

There are some straighforward tricks using the package eval (or hint)l. This is more or less the idea in pseudocode: type FuncExpr= String data F a = F FuncExpr a apply (F _ f) x= f x instance Show (F a) where show (F str _)= str instance Read (F a) where read (F str f)= eval f >>= F str 2

Fwd: [Haskell-cafe] Fuzzy time deltas

Michael, The package Workflow has persistent timeouts (can wait for years and restart on system failure if embedded in the workflow monad, although it can run in the IO monad, with no recovery). They are composable with any action in the STM monad with orElse: flag <- getTimeoutFlag $ 5*24*6

Re: [Haskell-cafe] Ultra-newbie Question

2010/9/18 Daniel Fischer > > > n_lastn n = reverse . take n . reverse > > Which is the most elegant definition, but it's an O(length list) space > operation (as are all others proposed so far). T No!. You forget laziness!. it is 0(n) with n= the parameter passed to n_lastn. It is not O(

Re: [Haskell-cafe] Re: [Haskell] ANNOUNCE: reference 0.1

Why not to define it for any monad, for example STM (TVars) and whatever? 2010/9/7 Maciej Piechotka > On Tue, 2010-09-07 at 02:15 +0200, Bas van Dijk wrote: > > On Mon, Sep 6, 2010 at 11:55 PM, Maciej Piechotka > wrote: > > > Reference is class which generalizes references and monads they exist

Fwd: Searching for Haskell (was: [Haskell-cafe] Slightly humorous: Headhunters toolbox (example for Germany))

y the way, the term "tired" has increasing share in the programming category ;) 2010/8/31 Henk-Jan van Tuyl On Tue, 31 Aug 2010 13:57:42 +0200, Alberto G. Corona > wrote: > > Entering "haskell language" instead of "haskell" the ambiguity >> d

Fwd: [Haskell-cafe] Is there any experience using Software Transactional Memory in substantial applications?

-- Forwarded message -- From: Alberto G. Corona Date: 2010/8/8 Subject: Re: [Haskell-cafe] Is there any experience using Software Transactional Memory in substantial applications? To: Serguey Zefirov This first papers is the first that describes the preliminary haskell

Re: [Haskell-cafe] philosophy of Haskell

I did`nt care about the underlying theory behind monads once I learn that the easy way to understand them is trough desugarization. Desugarize the "do" notation, after that, desugarize the >>= and >> operators down to the function call notation and suddenly everithing lost its magic because it bec

Re: [Haskell-cafe] can Haskell do everyting as we want?

Just to clarify, I mean: Haskell may be seriously addictive. Sounds like a joke, but it is not. I do not recommend it for coding something quick and dirty. 2010/8/4 Alberto G. Corona > Before entering haskell, please read our disclaimer: > > http://www.haskell.org/pipermail/haskell-

Re: [Haskell-cafe] can Haskell do everyting as we want?

Before entering haskell, please read our disclaimer: http://www.haskell.org/pipermail/haskell-cafe/2010-June/079044.html You've been warned * * 2010/8/4 Zura_ > > As already noted here, Haskell is a general purpose language, but you > should > take it with a grain of salt. > For instance, you

Re: [Haskell-cafe] ANNOUNCE: DSTM 0.1.1

That is really nice. The architecture seems to be around a single server that bring lookup services, so there is a single point of failure. I´m thinking on cloud computing. Can be extended to have backup servers somehow ? Alberto. 2010/8/3 Christopher Done > This is very cool, thanks for writ

Re: [Haskell-cafe] Re: Microsoft's Singularity Project and Haskell

I guess that the house OShas no one of these problems that singularity tries to solve in the first place. The problem of general OSs is: we have unsafe code, so what we do to deal with it?. The usual

Re: [Haskell-cafe] what's the best environment for haskell work?

leksah 2010/7/31 Johan Tibell > On Sat, Jul 31, 2010 at 12:07 PM, Rustom Mody wrote: > >> Do most people who work with haskell use emacs/vi/eclipse or something >> else?? >> > > I use Emacs and haskell-mode. > > Johan > > > ___ > Haskell-Cafe mailing l

Fwd: [Haskell-cafe] fine control of bytestring streaming

ser made blocks, have such possibility of controlling precise streaming. Something that neither ordinary strings nor strict bytestring, and I guess nothing else has. Don´t miss out this!. 2010/7/27, Henning Thielemann : > > On Tue, 27 Jul 2010, Alberto G. Corona wrote: > >> Th

[Haskell-cafe] fine control of bytestring streaming

Hi, I´m streaming content using lazy bytestrings in a web application. The problem is that the output comes in huge blobs (presumably of 32k) one at a time. This is good for some purposes, but not for console-like interfaces or runtime log visualization. (one of my purposes is to web-alize ghci.

Fwd: [Haskell-cafe] Re: Is my code too complicated?

Very often the type system assures safety to a point where some coding is done trough trial and error: -I think that this composition is right, let´s try it-... -oh, some missing type here, Let´s put it here and here-...-go on-... -The typechecker say t´s OK. I run it and, well it works. Later wh

Re: [Haskell-cafe] Re: How does one get off haskell?

The fast write-only way: - generate C code with JHC (no haskell runtime) - use a C-to-java converter , for example, c2j (http://www.novosoft-us.com) At least you can laugh at the generated code. anyone tried that? Alberto 2010/6/18 wren ng thornton : > Edward Z. Yang wrote: >> >> Excerpts fro

[Haskell-cafe] Announce: Properties-0.0.2

http://hackage.haskell.org/package/properties-0.0.2 Properties can use QuickCheck properties in the same way than assertions are used, for causal debugging of real programs. It also add an human readable structure for grouping properties for cl

Re: [Haskell-cafe] is there a way to prove the equivalence of these two implementations of (Prelude) break function?

> This isn`t a manifestation of the Curry-Howard isomorphism? > > 2010/6/8 Alexander Solla > > >> On Jun 7, 2010, at 4:10 PM, Alexander Solla wrote: >> >> >>> You might note how much like evaluating the function generating the >>> analysis is. >>> >> >> ___

Re: [Haskell-cafe] Why Either = Left | Right instead of something like Result = Success | Failure

Left-Right also good for representing binary trees. 2010/5/27 C. McCann > On Thu, May 27, 2010 at 10:25 AM, Ionut G. Stan > wrote: > > I was just wondering if there's any particular reason for which the two > > constructors of the Either data type are named Left and Right. I'm > thinking > > th

Re: [Haskell-cafe] Google Summer of Code: BlazeHTML RFC

As a user, I have too many HTML generators, a few of them with Ajax and none with server-side event handling (like ASPX or JSPX). Ajax is complicated but server side event handling is what I really miss because it is simple from the user point of view, my ervents could be handled in haskell code

Re: [Haskell-cafe] Numerical Analysis

SAGE is the kind of thing that I dreamed to have available online a few years ago. To recode everithing in haskell perhaps does not worth the pain, but perhapts it would be nice to do something similar to SAGE in an advanced environment such is Google Wave, with all the collaborative facilities fo

Re: [Haskell-cafe] Suitable structure to represents lots of similar lists

Id doesn´t have to create a copy of the original object ( I infer this from referential transparency) so the new list must store the same original reference. Any pure structure would conserve references after id. filter as far as I know. Am I wrong? 2010/4/8 Dan Piponi > I have a situation wh

Fwd: [Haskell-cafe] Are there any female Haskellers?

. 2010/3/29 Jason Dusek 2010/03/29 Alberto G. Corona : > > [...] What we evolved with is a general hability: to play with > > things to achieve what we need from them, (besides other > > abilities). The pleasure to acheve ends by using available > > means. [...] A

Re: [Haskell-cafe] Are there any female Haskellers?

> explained by the results of the study. > > By the way, I've been on many programming mailing lists and other > techie mailing lists where this subject has come up, and I've never > seen it so rationally discussed as on this mailing list... > > -- Jeff > > On Mon, M

Fwd: [Haskell-cafe] Re: Are there any female Haskellers?

What's evil in being different? I only see here a form of discrimination that i can label as inherentely sexist and/elitist/or racist: the assumption that certain habilities, the normally associated historically whith men are worth to have and good, and whoever hasn´t them is worth to be discrimi

Re: [Haskell-cafe] Are there any female Haskellers?

2010/3/27 wren ng thornton > Alberto G. Corona wrote: > >> because math abilities are not a -primary- reason for survival. >> Tools engineering and mastering is. >> > > Do not be misled by the fact that CS departments are often lumped in with > engineering. For

Re: [Haskell-cafe] Are there any female Haskellers?

> IQ tests, for example. google it. > > 2010/3/28 Jochem Berndsen > > Alberto G. Corona wrote: >> > The reasons for the sexual differences in mathematical abilities are >> > different, because math abilities are not a -primary- reason for >> > surviva

Fwd: [Haskell-cafe] Re: Are there any gay haskelleres?

Also some operators are clearly sexist >>=, -> => etc etc. I don´t kmow if the lack of female haskellers is due to this inpudic exhibition of male domination ;) 2010/3/28 Ertugrul Soeylemez Fraser Wilson wrote: > > > I'm sure there's some theory about fags being unable to use tools and > > stu

Re: [Haskell-cafe] Are there any female Haskellers?

2010/3/27 Jason Dusek > 2010/03/27 Alberto G. Corona : > > To say this in scientific headline jargon, it's a matter of > > division of work, time, and dimorphic fixation of abilities in > > the brain by natural selection trough dimorphic development of > > the bra

Re: [Haskell-cafe] Are there any female Haskellers?

To say this in scientific headline jargon, It´s a matter of division of work, time, and dimorphic fixation of abilities in the brain by natural selection trough dimorphic development of the brain of men and women by different genetic sequences. I don´t know any kind of tool more flexible and powerf

Fwd: [Haskell-cafe] Bytestrings and [Char]

2010/3/24 Stephen Tetley > If you consider containers as the containers package, the data > structures are all (?) functorial - but they have different shapes, > so e.g. a cons operation makes sense on the linear ones > (Data.Sequence, Data.List) but not on Data.Map, Data.Tree. 'cons' is > anal

Fwd: [Haskell-cafe] Bytestrings and [Char]

-- Forwarded message -- From: Alberto G. Corona Date: 2010/3/24 Subject: Re: [Haskell-cafe] Bytestrings and [Char] To: Stephen Tetley 2010/3/24 Stephen Tetley Hi Alberto > > I rather doubt a valuable set of type classes that is suitable for all > containers ex

Re: [Haskell-cafe] Bytestrings and [Char]

ion is > significantly more difficult; I can't say if the scope would be > appropriate for SoC. > > Best, > John > > > From: "Alberto G. Corona " > > > > Just a dream: > > -separate interface and implementation for all containers, via type > cl

Fwd: [Haskell-cafe] Bytestrings and [Char]

Alberto G. Corona The question can be generalized via type classes: Is there any common set of > primitives encapsulated into a single type class that has instances for > Strings (Data.List) ByteStrings, Data.Text, Lazy bytestrings, Arrays, > vectors and wathever container that can store

Fwd: [Haskell-cafe] Bytestrings and [Char]

The question can be generalized via type classes: Is there any common set of primitives encapsulated into a single type class that has instances for Strings (Data.List) ByteStrings, Data.Text, Lazy bytestrings, Arrays, vectors and wathever container that can store an boxed, unboxed, packed unpacked

[Haskell-cafe] fast, strongly typed heterogeneous collections

Hi What is the speed of hProjectByLabel/s in Data.HList.Record? . The documentation in hackage does not mention it. Perhaps this is because Hlist is designed for supposedly short records

Re: [Haskell-cafe] Web application interface

2010/1/14 Michael Snoyman > > > Well, for one thing, you'd need to use lazy IO to achieve your goal, which > has some safety issues. As things get more and more complex, the > requirements of lazy IO will continue to grow. This also has implications > for number of open file handles and determini

Re: [Haskell-cafe] Web application interface

2010/1/14 Jinjing Wang > > > Hyena is especially tuned for streaming and that's exactly what hack > can't do (in practice). > Isn't possible to stream an (almost) infinite bytestring trough hack?. I ever trough that the laziness of haskell is a great advantage in Web applications. This is very i

Re: [Haskell-cafe] Re: what is *hack*?

rack (and hack) permits also to concatenate applications (request handlers) one in top of the other. with interesting combinations (filters, encriptation layers, applications as such). It seems that this is the reason for its name. At first sight it seems too little code to make something useful,

[Haskell-cafe] overloaded overloading?

Hi, I sometimes strumble on the same quiestion that forces me to insert functions that process objects of a certain class inside their class definition. This occurs when a computation uses the object internally, neiter as parameter or as a return value or in the case of existential types. An exam

Fwd: [Haskell-cafe] Deconstruction

Cast uses unsafeCoerce. but well, it´s more elegant ;) 2009/12/26 Miguel Mitrofanov > On 26 Dec 2009, at 12:45, Alberto G. Corona wrote: > > You can also make use of Typeable and unsafeCoerce (Data.Dynamic style) >> >> >> data Bar = forall a. (BarLike a, Typeable

Re: [Haskell-cafe] Are functional dependencies around to stay?

Semi Off Topic: If the ultimate nature of reality is mathematical, as many physicist say, then everything is mathematical. Then the question must be rephrased to ¿is this or that isomorphic with a mathematical structure powerful enough (general enough, simple enough, but not more) or is out there

Fwd: [Haskell-cafe] Boxed Mutable Arrays

-- Forwarded message -- From: Alberto G. Corona Date: 2009/12/15 Subject: Re: [Haskell-cafe] Boxed Mutable Arrays To: Daniel Peebles Ok, so the state content is not accessible. Nice. 2009/12/15 Daniel Peebles No, they are actually being mutated. ST is basically IO with a

Re: [Haskell-cafe] Boxed Mutable Arrays

AFAIK, ST Arrays are pure data structures. They are not really mutable. They are destroyed and recreated on every update. The mutation is just simulated thanks to the hidden state in the state monad. Sure, the garbage collector must have a hard work in recycling all the "backbones" of the discarded

Fwd: Re[4]: [Haskell-cafe] Re: How Can Haskell Be Saved?

> > POSIX subsystem was implemented by MS (and other major players) only > to meet some bureaucratic reqs from DoD/UsGov, and i don't know any > program really using it. just don't mix C library emulation of POSIX > calls on top of Win32 with POSIX subsystem (btw, both are implemented > on top of n

Fwd: [Haskell-cafe] Re: Why?

ll has been that sometimes > it's too lazy for me to write the code that I first thought would be > efficient without a lot f study and refactoring of that code. > > I'm sure this gets easier with practice, but it's not something I was > expecting to be as difficult as

Re: [Haskell-cafe] Re: Why?

. 2009/12/10 Alberto G. Corona > > > > What material benefit does Haskell derive from being a "pure" functional > language as opposed to an impure one? > > > > Here is my list of benefits of purity (some of them are enhanced by other > features like the ty

Fwd: [Haskell-cafe] Re: Why?

What material benefit does Haskell derive from being a "pure" functional language as opposed to an impure one? Here is my list of benefits of purity (some of them are enhanced by other features like the type system). Purity means referential transparency. that means that the programmer has no

Re: Re[2]: [Haskell-cafe] can there be (hash-table using) O(n) version of this (I think currently) n log n algo?

Any application where multiple updates are done in multiple threads . gain by using a hashTable 2009/7/18 Bulat Ziganshin > Hello Thomas, > > Saturday, July 18, 2009, 7:23:10 PM, you wrote: > > > Going back to my original question, I am now looking for a dead simple > > motivating example for sh

[Haskell-cafe] The Transient monad

Hi haskell cafe: concerning Stable Names http://www.haskell.org/ghc/docs/6.10.4/html/libraries/base/System-Mem-StableName.html makeStableName :: a -> IO (StableName a) I Did not test fully my proposal, and I´m thinking aloud, Just to inpire others and fish some ideas; The IO in makeStableName

Re: [Haskell-cafe] Optimization with Strings ?

" In fact, the correct answer is that pEqualsP should produce an error and qEqualsQ should never terminate" ¿¿??? should? or you want to say "actually do that so the optimization does is not done"? The correct amswer is not the sould you mention, but True (IMHO). So the optimization can be done a

Fwd: [Haskell-cafe] Optimization with Strings ?

Use makeStableName from System.Mem.StableName StableName`s are just for checking pointer equality. Instead of checking for equality of the strings, check for pointer equality of their stableNames a dirty way: pointerEq x y= unsafePerformIO $ do px <- makeStableName x py <- makeStabl

Re: [Haskell-cafe] Re: socket error

3 and 6.10.4 in two different machines. > > 2009/11/3 Alberto G. Corona > > : hPutBuf: illegal operation (handle is finalized) > > I´m a bit lost trying to find the source of this error. > I´m running an hack application (package hack). Basically it is a handler > of web

Re: [Haskell-cafe] What's the deal with Clean?

A comparison of the evolution in speed of Haskell from version to version rather than with other languages could have been very informative about the progress in haskell speed. I think that the progression has been astonishing. I though that while seeing this language shootout in windows http://d

Re: Re[2]: [Haskell-cafe] What's the deal with Clean?

I personally don´t care about raw performance. Haskell is in the top of the list of language performance. It has all the ingredients for improving performance in the coming years: A core language, clear execution strategy, analysis and parsing, transformations based on math rules. So my code will i

<    1   2   3   >