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

http://www.haskell.org/mailman/listinfo/haskell-cafe -- Eugene Kirpichov Senior Developer, JetBrains ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

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

/listinfo/haskell-cafe -- Eugene Kirpichov Senior Developer, JetBrains ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

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

2010/4/8 Eugene Kirpichov ekirpic...@gmail.com: I think Dan is talking about sharing the spine of the lists... How about representing the lists using something along the lines of: data List a = Nil | Leaf a | Cat (List a) (List a) data Transformed a = Changed a | Unchanged a extract

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

2010/4/8 Eugene Kirpichov ekirpic...@gmail.com: I think Dan is talking about sharing the spine of the lists... How about representing the lists using something along the lines of: data List a = Nil | Leaf a | Cat (List a) (List a) data Transformed a = Changed a | Unchanged a extract

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

2010/4/9 Heinrich Apfelmus apfel...@quantentunnel.de: Eugene Kirpichov wrote: I think Dan is talking about sharing the spine of the lists... How about representing the lists using something along the lines of: data List a = Nil | Leaf a | Cat (List a) (List a) data Transformed a = Changed

Re: [Haskell-cafe] Actors and message-passing a la Erlang

http://www.haskell.org/mailman/listinfo/haskell-cafe -- Eugene Kirpichov Senior Software Engineer, Grid Dynamics http://www.griddynamics.com/ ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] Re: ANN: weighted-regexp-0.1.0.0

and seq_ RegExp is itself a Semiring, but I'm not sure what that would do. -- Sjoerd Visscher http://w3future.com ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe -- Eugene Kirpichov

Re: [Haskell-cafe] Re: ANN: weighted-regexp-0.1.0.0

This is very interesting! Could you provide some more info? T.i. where to look in the source, or on the web? 2010/7/28 S. Doaitse Swierstra doai...@swierstra.net: On 27 jul 2010, at 09:30, Eugene Kirpichov wrote: Perhaps this might mean that we can get incremental and parallel regexp

Re: [Haskell-cafe] better way to do this?

b) ___ 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

Re: [Haskell-cafe] better way to do this?

2009/10/5 Michael Mossey m...@alumni.caltech.edu: Eugene Kirpichov wrote: [x,y,t,b,l,r] - mapM (getStdRandom . randomR) [(-10,10), (-70,70), ...] return (BoxBounds ...) Thanks. I'm curious about the idea of pattern matching in do-statements that can fail. This particular pattern cannot

Re: [Haskell-cafe] better way to do this?

, but a quick googling didn't find that exact mail.) -k -- If I haven't seen further, it is by standing in the footprints of giants ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe -- Eugene

Re: [Haskell-cafe] is proof by testing possible?

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

Re: [Haskell-cafe] is proof by testing possible?

For example, it is possible to prove correctness of a function negatedHead :: [Bool] - Bool by testing it on True:undefined and False:undefined. 2009/10/12 Eugene Kirpichov ekirpic...@gmail.com: It is possible for functions with compact domain, not just finite. 2009/10/12 Joe Fredette jfred

Re: [Haskell-cafe] is proof by testing possible?

Also google seemingly impossible functional programs. 2009/10/12 Eugene Kirpichov ekirpic...@gmail.com: For example, it is possible to prove correctness of a function negatedHead :: [Bool] - Bool by testing it on True:undefined and False:undefined. 2009/10/12 Eugene Kirpichov ekirpic

Re: [Haskell-cafe] is proof by testing possible?

you can disregard my other message. I suppose this is a bit like short-circuiting. No? On Oct 12, 2009, at 1:56 PM, Eugene Kirpichov wrote: For example, it is possible to prove correctness of a function negatedHead :: [Bool] - Bool by testing it on True:undefined and False:undefined. 2009

Re: [Haskell-cafe] (no subject)

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

[Haskell-cafe] ANN: strptime bindings

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

[Haskell-cafe] What is the current state of affairs with supercompilation?

by someone eager to learn about supercompilation and maybe to make research contributions? - What are some solved problems and some open problems in supercompilation? -- Eugene Kirpichov Web IR developer, market.yandex.ru ___ Haskell-Cafe mailing list

Re: [Haskell-cafe] Hoogle is great but ...

-but-...-tp26046410p26046410.html Sent from the Haskell - Haskell-Cafe mailing list archive at Nabble.com. ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe -- Eugene Kirpichov Web IR

Re: [Haskell-cafe] Re: What is the current state of affairs with supercompilation?

-Order.Terms.by.Means.of.Supercompilation.pdf ___ 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

Re: [Haskell-cafe] Applicative but not Monad

-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.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] How to fulfill the code-reuse destiny of OOP?

mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe -- 竹密岂妨流水过 山高哪阻野云飞 ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe -- Eugene Kirpichov

Re: [Haskell-cafe] Are all arrows functors?

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.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] Re: proposal: point free case expressions

___ 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

Re: [Haskell-cafe] Is () a 0-length tuple?

://quicquid.org/ ___ 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

Re: [Haskell-cafe] help with Haskell performance

--- ___ 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.org http

Re: [Haskell-cafe] help with Haskell performance

Ah, you're right. Then we need a foldl' insertWith with a strict plus. 2009/11/8 Felipe Lessa felipe.le...@gmail.com: On Sun, Nov 08, 2009 at 12:15:57AM +0300, Eugene Kirpichov wrote: Here, you should not use Map.fromListWith (+) because Map is not strict in its entries and you end up having

Re: [Haskell-cafe] Area from [(x,y)] using foldl

) (x, y) - ((*) (xold - x) (yold + y)))' Failed, modules loaded: none. Prelude ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe -- Eugene Kirpichov Web IR developer, market.yandex.ru

Re: [Haskell-cafe] unboxed arrays restricted to simple types (Int, Float, ..)

out if an abstract data type is non-recursive. Then this type should be serializable automatically. What do you think? ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe -- Eugene

Re: [Haskell-cafe] Least common supertype?

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

Re: [Haskell-cafe] What does the `forall` mean ?

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

Re: [Haskell-cafe] What does the `forall` mean ?

2009/11/12 Neil Brown nc...@kent.ac.uk: Eugene Kirpichov wrote: 2009/11/12 Andrew Coppin andrewcop...@btinternet.com: Even I am still not 100% sure how placing forall in different positions does different things. But usually it's not something I need to worry about. :-) To me it does

Re: [Haskell-cafe] What does the `forall` mean ?

2009/11/12 Ryan Ingram ryani.s...@gmail.com: On Thu, Nov 12, 2009 at 2:50 AM, Eugene Kirpichov ekirpic...@gmail.com wrote: But that's not an issue of semantics of forall, just of which part of the rather broad and universal semantics is captured by which language extensions. The forall

Re: [Haskell-cafe] Could someone teach me why we use Data.Monoid?

not know why we use it? -- 竹密岂妨流水过 山高哪阻野云飞 ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe -- Eugene Kirpichov Web IR developer, market.yandex.ru

Re: [Haskell-cafe] Could someone teach me why we use Data.Monoid?

a-a with composition. 2009/11/13 Magicloud Magiclouds magicloud.magiclo...@gmail.com: I see. Then what is about Dual and Endo? Especially Endo, I completely confused 2009/11/14 Eugene Kirpichov ekirpic...@gmail.com: There is an astonishing number of things in programming that are monoids

Re: [Haskell-cafe] Could someone teach me why we use Data.Monoid?

there can be more collapse, but in that case we'd need the analogue your version too). Greetings, Daniel ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe -- Eugene Kirpichov Web IR

Re: [Haskell-cafe] O(n) algorithm for determining subset

like  (y - x) == (y `exclusiveOr` x) ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe -- Eugene Kirpichov Web IR developer, market.yandex.ru

Re: [Haskell-cafe] ANNOUNCE: control-monad-failure and safe-failure

/Failure Thanks, Jose Iborra, Nicolas Pouillard and Michael Snoyman ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe -- Eugene Kirpichov Web IR developer, market.yandex.ru

Re: [Haskell-cafe] (possibly) a list comprehensions 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.org http

Re: [Haskell-cafe] I miss OO

___ 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

Re: [Haskell-cafe] I miss OO

to a MIDI command or to a graphical glyph (which is further to be positioned by a layout engine). Thanks, Mike Eugene Kirpichov wrote: Hi, Are you sure you need to store the time *inside* your objects instead of using, say, pairs (Time, YourObject) (and lists of them instead of lists of your

Re: [Haskell-cafe] Other instances of Integral

! ___ 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.org http://www.haskell.org

Re: [Haskell-cafe] GHC magic optimization ?

in a computer. thanks -- Emmanuel Chantréau ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe -- Eugene Kirpichov Web IR developer, market.yandex.ru

Re: [Haskell-cafe] Greetings! 2D Graphics?

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.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] From function over expression (+, *) derive function over expression (+)

introduce Mul to the expression which had no Mul. Thanks in advance Radek Micek ___ 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] What is the rank of a polymorphic type?

many instantiations (for example, Int - Int is an instantiation of forall a . a - a, and String - String also is), and this type doesn't have any instantiations at all. Which is correct? Is there really a contradiction? What is the definition of rank of a polymorphic type? -- Eugene Kirpichov Web

Re: [Haskell-cafe] What is the rank of a polymorphic type?

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

Re: [Haskell-cafe] What is the rank of a polymorphic type?

of the standard Hindley-Milner typing discipline. OK, thanks. However, isn't the type (forall a . a) - String impredicative because it instantiates a type variable of the type constructor (-) p q with p = forall a . a? Cheers,  Stefan -- Eugene Kirpichov Web IR developer, market.yandex.ru

Re: [Haskell-cafe] Re: Why?

@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.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] Re: Why?

. -- From: Eugene Kirpichov ekirpic...@gmail.com Sent: 10 Thursday December 2009 0838 To: John D. Earle johndea...@cox.net Cc: Haskell Cafe haskell-cafe@haskell.org Subject: Re: [Haskell-cafe] Re: Why? 2009/12/10 John D. Earle johndea...@cox.net: My intuition says

Re: [Haskell-cafe] Performance of functional priority queues

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

Re: [Haskell-cafe] Re: FASTER primes (was: Re: Code and Perf. Data for Prime Finders (was: Genuine Eratosthenes sieve))

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

Re: [Haskell-cafe] Invertible functions list

@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.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] Invertible functions list

forward Id a = a forward (ICons f _ r) a = forward r (f a) backward Id a = a backward (ICons _ f r) a = f (backward r a) 2009/12/29 Eugene Kirpichov ekirpic...@gmail.com: data IList a b where    Id :: IList a a    ICons :: (a - b) - (b - a) - IList b c - IList a c 2009/12/29 Jonathan

Re: [Haskell-cafe] Invertible functions list

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.org http://www.haskell.org/mailman/listinfo/haskell

Re: [Haskell-cafe] sorting and merging in haskell

-tp27222668p27222668.html Sent from the Haskell - Haskell-Cafe mailing list archive at Nabble.com. ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe -- Eugene Kirpichov Web IR developer

[Haskell-cafe] #haskell stopped being logged on tunes.org

those with sufficient power for that to do it :) -- Eugene Kirpichov Web IR developer, market.yandex.ru ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] Is Haskell capable of matching C in string processing performance?

___ 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.org http

Re: [Haskell-cafe] If monads are single/linearly threaded, doesn't that reduce parallelism?

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

Re: [Haskell-cafe] Lists of Existential DT

___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe -- Eugene Kirpichov Senior Developer, JetBrains ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo

[Haskell-cafe] Higher-order algorithms

. -- Eugene Kirpichov Senior Software Engineer, Grid Dynamics http://www.griddynamics.com/ ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] bitmap examples

mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe -- Regards, Kashyap ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe -- Eugene Kirpichov

Re: [Haskell-cafe] Set of Haskell programs

/haskell-cafe -- Eugene Kirpichov Senior Software Engineer, Grid Dynamics http://www.griddynamics.com/ ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] Finite but not fixed length...

://www.haskell.org/mailman/listinfo/haskell-cafe -- Eugene Kirpichov Senior Software Engineer, Grid Dynamics http://www.griddynamics.com/ ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] Finite but not fixed length...

a _) = Just a hd :: FiniteList a - Maybe a hd (FL as) = hdList as *Finite hd ones this hangs, so, my guess is that ones = _|_ 13.10.2010 12:13, Eugene Kirpichov пишет: {-# LANGUAGE ExistentialQuantification, GADTs, EmptyDataDecls #-} module Finite where data Zero data Succ a class Finite

Re: [Haskell-cafe] Finite but not fixed length...

not to typecheck? Guess that's impossible, since it's nothing but fix application... 13.10.2010 12:33, Eugene Kirpichov пишет: Well, it's easy to make it so that lists are either finite or bottom, but it's not so easy to make infinite lists fail to typecheck... That's what I'm wondering about. 2010

Re: [Haskell-cafe] All binary strings of a given length

[000,001,010,011,100,101,110,111] etc.. thanks.. ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe -- Eugene Kirpichov Senior Software Engineer, Grid Dynamics http://www.griddynamics.com

Re: [Haskell-cafe] All binary strings of a given length

Here's why it works: genbin 3 = replicateM 3 01 = (unfold replicateM) do x1 - 01; x2 - 01 ; x3 - 01; return [x1,x2,x3] = your desired result (enumerate all combinations of x1,x2,x3 with each being 0 or 1). 2010/10/15 Eugene Kirpichov ekirpic...@gmail.com: genbin = flip replicateM 01 2010/10

Re: [Haskell-cafe] Re: All binary strings of a given length

. bytes) would be much better. You could generate them, and only translate into strings when needed. HTH, Aleks ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe -- Eugene Kirpichov

[Haskell-cafe] Announce: splot-0.1.1

a separate tool. -- Eugene Kirpichov Senior Software Engineer, Grid Dynamics http://www.griddynamics.com/ ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

[Haskell-cafe] Re: ANN: Chart v0.14

dynamic     resizing, and mapping from device coordinates back to source     values. The library is available on hackage. Additional information including details of the mailing list can be found here:    http://dockerz.net/software/chart.html Thanks to Malcolm Wallace, Eugene Kirpichov

[Haskell-cafe] ANN: timeplot-0.2.1, a tool for visualizing time series from log files.

be colored, representing several states of a subsystem or subprocess. Please use the program and provide feedback :) I have a hope that it could become a reasonably widely used tool for the kinds of tasks that I use it for. -- Eugene Kirpichov Senior Software Engineer, Grid Dynamics http

[Haskell-cafe] Most images broken on haskellwiki pages

it have to do with the wiki redesign? What should, say, I personally do about my images regarding this? -- Eugene Kirpichov Senior Software Engineer, Grid Dynamics http://www.griddynamics.com/ ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http

Re: [Haskell-cafe] Most images broken on haskellwiki pages

Hello, Any news on this one? 01.12.2010, в 11:53, Yitzchak Gale g...@sefer.org написал(а): Eugene Kirpichov wrote: I looked at a couple pages of mine... and looks like the vast majority of images are not displaying. This probably has to do with moving the wiki to the new server during

Re: [Haskell-cafe] Most images broken on haskellwiki pages

2010/12/3 Thomas Schilling nomin...@googlemail.com: Should be fixed.  PDF previews are currently broken, but images should be fine. Unfortunately they aren't. Please take a look at http://www.haskell.org/haskellwiki/Timeplot . 2010/12/3 Eugene Kirpichov ekirpic...@gmail.com: Hello, Any

Re: [Haskell-cafe] Most images broken on haskellwiki pages

Thanks to Edward Z Yang - the problem has gone. The point is that I used raw URLs to include these images, but I should have used [[Image:MyImage.png]]. 3 декабря 2010 г. 15:22 пользователь Eugene Kirpichov ekirpic...@gmail.com написал: 2010/12/3 Thomas Schilling nomin...@googlemail.com

[Haskell-cafe] tplot and splot - analyst's swiss army knifes for visualizing log files

-tools [attention attractor: the presentation has *really a lot* of pictures] hackage: http://hackage.haskell.org/package/timeplot http://hackage.haskell.org/package/splot other docs: http://www.haskell.org/haskellwiki/Timeplot http://www.haskell.org/haskellwiki/Splot -- Eugene Kirpichov

[Haskell-cafe] DNS problems at haskell.org?

-gw.hetzner.de [80.81.193.164] 1260 ms60 ms60 ms hos-bb1.juniper1.fs.hetzner.de [213.239.240.242] 1364 ms61 ms63 ms hos-tr1.ex3k10.rz12.hetzner.de [213.239.228.139] 1460 ms60 ms62 ms lambda.haskell.org [78.46.100.180] Trace finished -- Eugene Kirpichov Senior

Re: [Haskell-cafe] unable to load package `regex-posix-0.94.2' (On Vista x64)

___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe -- Eugene Kirpichov Senior Software Engineer, Grid Dynamics http://www.griddynamics.com/ ___ Haskell-Cafe mailing

[Haskell-cafe] ANNOUNCE: storable-endian

protocols with fixed endianness. Hope you find it useful. -- Eugene Kirpichov Senior Software Engineer, Grid Dynamics http://www.griddynamics.com/ ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] ANNOUNCE: storable-endian

...I mean, storable-endian 0.2.1 actually - 0.2.0 had a stupid bug. 2010/12/24 Eugene Kirpichov ekirpic...@gmail.com: Hello Hennig, Thanks for the suggestions! I've released storable-endian 0.2.0, which does not use TH and bases on your suggestion (though it has a bit of boilerplate because

Re: [Haskell-cafe] ANNOUNCE: storable-endian

/master/Data/Storable/Endian.hs 2010/12/23 Henning Thielemann lemm...@henning-thielemann.de: On Thu, 23 Dec 2010, Henning Thielemann wrote: On Wed, 22 Dec 2010, Eugene Kirpichov wrote: It defines types like {{Int,Word}{16,32,64},Double,Float}{LE,BE} (for example Int32BE) etc

Re: [Haskell-cafe] ANNOUNCE: storable-endian

Hello, 2010/12/24 Henning Thielemann lemm...@henning-thielemann.de: On Fri, 24 Dec 2010, Eugene Kirpichov wrote: I've released storable-endian 0.2.0, which does not use TH and bases on your suggestion (though it has a bit of boilerplate because of abandoning TH, but I don't think that's

Re: [Haskell-cafe] ANNOUNCE: storable-endian

apparently it was just a mistake. -- Work is punishment for failing to procrastinate effectively. -- Eugene Kirpichov Senior Software Engineer, Grid Dynamics http://www.griddynamics.com/ ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http

Re: [Haskell-cafe] ANNOUNCE: storable-endian

With pretty much the same technique. Take care, Antoine -- Eugene Kirpichov Senior Software Engineer, Grid Dynamics http://www.griddynamics.com/ ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo

Re: [Haskell-cafe] ANNOUNCE: storable-endian

Thanks! Now I'll use it in storable-endian as soon as I get around to it :) 2010/12/25 Antoine Latter aslat...@gmail.com: On Sat, Dec 25, 2010 at 1:31 AM, Eugene Kirpichov ekirpic...@gmail.com wrote: Great! Antoine, would you perhaps then update the cabal description of the package

Re: [Haskell-cafe] ANNOUNCE: storable-endian

So I got around to it. storable-endian 0.2.3 released, see code: https://github.com/jkff/storable-endian/blob/master/Data/Storable/Endian.hs There's some boilerplate there, but I think it's tractable. 2010/12/25 Eugene Kirpichov ekirpic...@gmail.com: Thanks! Now I'll use it in storable-endian

[Haskell-cafe] ANNOUNCE: greg-client - a scalable distributed logger with a high-precision global time axis

here http://slideshare.net/jkff/two-visualization-tools . P.S. How to use it (while hackage hasn't yet rebuilt the docs): import System.Log.Greg main = withGregDo defaultConfiguration $ do ...logMessage Something happened... -- Eugene Kirpichov Senior Software Engineer, Grid Dynamics http

Re: [Haskell-cafe] tplot and splot - analyst's swiss army knifes for visualizing log files

on inbox... On 12/17/10 04:08 , Eugene Kirpichov wrote: Just in case, I'm also attaching a PDF of the current version to this email, but visiting the link is preferable, since I'll be updating the contents. So lessee, I need to get *yet another* account to be able to get updated versions

Re: [Haskell-cafe] tplot and splot - analyst's swiss army knifes for visualizing log files

is inconvenient. I will consider archive.to in the future. 03.01.2011, в 13:08, Lars Viklund z...@acc.umu.se написал(а): On Fri, Dec 17, 2010 at 12:08:53PM +0300, Eugene Kirpichov wrote: Hello! Actually the presentation was created in PowerPoint, not in TeX :) You can download the PDF here

Re: [Haskell-cafe] tplot and splot - analyst's swiss army knifes for visualizing log files

Thanks Hennig, this sounds very good indeed! I haven't thought of this. 04.01.2011, в 22:51, Henning Thielemann schlepp...@henning-thielemann.de написал(а): Eugene Kirpichov schrieb: I would happily use a better online presentation sharing tool if I knew of one - I am a novice

Re: [Haskell-cafe] Ratification for my understanding of functors

It's covariant if the parameter is to the left of an even number of arrows. For instance (- a) is co, (a -) is contra, (a - b) - b is co wrt a and neither co nor contra wrt b, etc. Read the c#-related stuff on variance, I am sure it is completely relevant. 08.01.2011, в 13:23, C K Kashyap

Re: [Haskell-cafe] General function to count list elements?

___ 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.org http://www.haskell.org/mailman/listinfo

Re: [Haskell-cafe] General function to count list elements?

. So my guess at an answer would be zero. Michael --- On Sat, 4/18/09, Eugene Kirpichov ekirpic...@gmail.com wrote: From: Eugene Kirpichov ekirpic...@gmail.com Subject: Re: [Haskell-cafe] General function to count list elements? To: michael rice nowg...@yahoo.com Cc: haskell-cafe

Re: [Haskell-cafe] General function to count list elements?

   |    877-376-2724 x 101 On Apr 18, 2009, at 9:39 AM, Eugene Kirpichov wrote: Could you then provide an example of two functions that *are* equal, or, even better, a definition of equality for arbitrary functions? Since Haskell may be compiled into C, this must be a definition

Re: [Haskell-cafe] General function to count list elements?

? Michael --- On Sat, 4/18/09, Eugene Kirpichov ekirpic...@gmail.com wrote: From: Eugene Kirpichov ekirpic...@gmail.com Subject: Re: [Haskell-cafe] General function to count list elements? To: michael rice nowg...@yahoo.com Cc: haskell-cafe@haskell.org Date: Saturday, April 18, 2009, 11:39 AM

Re: [Haskell-cafe] General function to count list elements?

for functions would certainly include comparing them. To compare two functions in C, I would compare their machine addresses. Michael --- On Sat, 4/18/09, Eugene Kirpichov ekirpic...@gmail.com wrote: From: Eugene Kirpichov ekirpic...@gmail.com Subject: Re: [Haskell-cafe] General function to count

Re: [Haskell-cafe] General function to count list elements?

. over members of the Eq class. This is perfectly correct and does not cause any mathematical unsoundness. Michael --- On Sat, 4/18/09, Eugene Kirpichov ekirpic...@gmail.com wrote: From: Eugene Kirpichov ekirpic...@gmail.com Subject: Re: [Haskell-cafe] General function

Re: [Haskell-cafe] CPS and the product function

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

Re: [Haskell-cafe] Being impure within a 'pure' function

the function. Is that possible? If not, wouldn't that be desirable? If not, why not? Thanks   Daniel ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe -- Eugene Kirpichov Web IR

  1   2   3   4   >