Re: [Haskell-cafe] Poll plea: State of GUI graphics libraries in Haskell

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

Re: [Haskell-cafe] Alternative name for return

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

Re: [Haskell-cafe] memoization

[0 ..] not recalculated every time I call memoized_fib? ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe -- -- Regards, KC ___ Haskell-Cafe

[Haskell-cafe] There was someone here going to use REPA and a functional way to find eigenvalues :)

Have you succeeded? In general, is there a functional way to do matrix manipulations? Linear algebra? Linear programming? Integer Programming? Numerical Analysis? Casey -- -- Regards, KC ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http

[Haskell-cafe] Do combinatorial algorithms have a matroid strucutre XOR non-matroid structure?

I ask this on this mailing list because there are quite a few mathematically oriented people here. Casey -- -- Regards, KC ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] Is the following implemented by a sparse matrix representation? type Graph n w = Array (n, n) (Maybe w)

like IntMap (IntMap w) or Map (n,n) w or Array n (IntMap w). Each of these representations is slightly different, and there will be different trade-offs. Twan On 09/07/13 23:26, KC wrote: Is the following implemented by a sparse matrix representation? type Graph n w = Array (n,n) (Maybe w

[Haskell-cafe] Is the following implemented by a sparse matrix representation? type Graph n w = Array (n, n) (Maybe w)

type Graph n w = Array (n,n) (Maybe w) -- -- Regards, KC ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

[Haskell-cafe] Will Haskell Platform 2012.4.0.0 uninstall cleanly for the installation of 2013.2.0.0

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

Re: [Haskell-cafe] Mobile app development?

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

Re: [Haskell-cafe] Mobile app development?

Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe -- -- Regards, KC -- Cheers, Andrew Pennebaker www.yellosoft.us -- -- Regards, KC ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http

[Haskell-cafe] Is http://hackage.haskell.org/packages/hackage.html having a challenging serving up archive.tar?

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

[Haskell-cafe] Are there REPA linear algebra routines? e.g. Eigenvalues?

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

Re: [Haskell-cafe] Why is boxed mutable array so slow?

data' :: [Int32] data' = [k + k `div` 3 | k - [0..] ] sum' = scanl1 (+) ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe -- -- Regards, KC

Re: [Haskell-cafe] How to incrementally update list

common? ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe -- -- Regards, KC ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http

Re: [Haskell-cafe] Compilers: Why do we need a core language?

I believe the question you are asking is why do large software systems need to be designed in terms of levels or some other software engineering construct(s). To manage their complexity as opposed to getting mangled in their complexity. :D -- -- Regards, KC

[Haskell-cafe] To cabal install cabal-install on Windows ...

the install process (or hanging it) is the thrashing of your hard drive to find all the little file fragments it needs during the install Casey -- -- Regards, KC ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo

Re: [Haskell-cafe] code length in Haskell, a comparison

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

[Haskell-cafe] Instead of Haskell running on the JVM is there a way for Haskell to call a JVM language ...

Instead of Haskell running on the JVM is there a way for Haskell to call a JVM language (or generate bytecode) to access the Java class libraries when needed? Or Is there a way for a JVM language or bytecode to call Haskell when needed? -- -- Regards, KC

Re: [Haskell-cafe] Tutorial: Haskell for the Evil Genius

The latest Haskell Platform is 2012.2.0.0 You are apparently running a much older version. #!c:/Program Files/Haskell Platform/2010.2.0.0/bin/ runhaskell -- -- Regards, KC ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http

[Haskell-cafe] What is a functional approach to linear algebra routines? I see REPA warns that one must use fusion or risk slow routines.

Apparently using STUarrays in an imperative fashion is fraught with peril (and the performance of molasses). Casey -- -- Regards, KC ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

[Haskell-cafe] One of the new buzz phrases is Event-Sourcing; is Haskell suitable for this?

http://martinfowler.com/eaaDev/EventSourcing.html http://martinfowler.com/articles/lmax.html -- -- Regards, KC ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

[Haskell-cafe] If I want to make a pure Haskell eigenvalue, etc. package without calling to LAPACK, etc ...

What are some good basis (pun intended) to start from? e.g. REPA? or ? -- -- Regards, KC ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] Monads

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

[Haskell-cafe] Haskell seems setup for iterative numerics; i.e. a standard example is Newton's method where lazy evaluation ...

separates control from computation. It seems as if Haskell would be better for iterative matrix methods rather than direct calculation. -- -- Regards, KC ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo

Re: [Haskell-cafe] Haskell seems setup for iterative numerics; i.e. a standard example is Newton's method where lazy evaluation ...

The REPA package/library doesn't have LU factorization, eigenvalues, etc. On Wed, Sep 5, 2012 at 12:59 PM, Carter Schonwald carter.schonw...@gmail.com wrote: Hello KC, you should check out the Repa library then and see how it works for you. Cheers -Carter On Wed, Sep 5, 2012 at 12:46 PM

Re: [Haskell-cafe] hstats median algorithm

/1/12 3:26 PM, David Feuer wrote: The median function in the hstats package uses a naive O(n log n) algorithm. Is there another package providing an O(n) option? If not, what would it take to get the package upgraded? -- -- Regards, KC ___ Haskell

[Haskell-cafe] Is it worth adding Gaussian elimination and eigenvalues to REPA?

I realize if one wants speed you probably want to use the hMatrix interface to GSL, BLAS and LAPACK. Worth it in the sense of have a purely functional implementation. -- -- Regards, KC ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http

Re: [Haskell-cafe] Does someone have a compiled binary of the LLVM for Windows 7 or must one compile the source?

:21, KC kc1...@gmail.com wrote: I just want to get started on some matrix operations with REPA. Or is there a library (package?) like REPA without using the LLVM? If you're referring to your recent problems with repa-algorithms, you can try this: cabal unpack repa-algorithms # Not sure

[Haskell-cafe] Does someone have a compiled binary of the LLVM for Windows 7 or must one compile the source?

I just want to get started on some matrix operations with REPA. Or is there a library (package?) like REPA without using the LLVM? -- -- Regards, KC ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo

[Haskell-cafe] For consistency; it would be better if the import statement matched the cabal install statement or :m form.

:m +Data.Array.Repa.Algorithms.Randomish cabal install repa.algrothms would be more consistent. -- -- Regards, KC ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] I use cabal install repa but then WinGHCi says module Data.Array.Rep.Algorithms.Ramdomish not found.

: I think you need to install repa-algorithms. On 13 August 2012 04:18, KC kc1...@gmail.com wrote: -- -- Regards, KC ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe -- Ivan Lazar

[Haskell-cafe] I use cabal install repa but then WinGHCi says module Data.Array.Rep.Algorithms.Ramdomish not found.

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

Re: [Haskell-cafe] [Haskell-beginners] vector indexing time

to create only up to the element that you actually demand. The linear time you're seeing is not the result of an inefficiency of vector indexing, but the result of an efficiency in vector creation. Best regards, Heinrich Apfelmus -- http://apfelmus.nfshost.com -- -- Regards, KC

[Haskell-cafe] Why is the the transpose function in Data.List more complicated?

]] transp ([]:_) = [] transp rows = map head rows : transp (map tail rows) Why is the the transpose function in Data.List more complicated? -- -- Regards, KC ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo

[Haskell-cafe] The following is supposed to be initializing a 2D array but it doesn't seem to work.

),1.0)] Maybe the behaviour of ghc was changed since the article was written. -- -- Regards, KC ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] The following is supposed to be initializing a 2D array but it doesn't seem to work.

That was it! On Tue, Jul 31, 2012 at 3:34 PM, Jan-Willem Maessen jmaes...@alum.mit.eduwrote: On Tue, Jul 31, 2012 at 5:52 PM, KC kc1...@gmail.com wrote: All I am getting is this: array ((1,5),(1,5)) [((1,5),1.0)] Maybe the behaviour of ghc was changed since the article was written. I

[Haskell-cafe] I can see lists working for matrix algorithms if the access patterns are mostly from the start or end of rows and columns.

Are there any such matrix algorithms that operate mainly from the start or end or rows and columns? Note: If the access pattern starts from the end of a row then one stores the row in reverse order in a list. -- -- Regards, KC ___ Haskell-Cafe mailing

Re: [Haskell-cafe] [Haskell-beginners] Graph Coloring Library?

(this is research code). The graphs are pretty small in general, all my test cases will have 10 nodes, but have high connectivity. They don't have any special properties. On Jul 14, 2012 2:50 PM, KC kc1...@gmail.com wrote: Are you looking for an exact or approximate solution. How many nodes and edges

Re: [Haskell-cafe] [Haskell-beginners] Graph Coloring Library?

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

[Haskell-cafe] There is some article mentioning that FP is mainly good for mathematical and list programming.

instead of 18 wheels I have only 17 wheels. :D -- -- Regards, KC ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] Best way to build a GHC backend?

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

[Haskell-cafe] Is there a GHC flag that will allow mutable top level state while you are debugging and then ...

you can turn the flag off when you are ready to do the computational heavy lifting so that you don't have to modify your code base? That is, GHC can then apply its algebraic transformation optimizations to the code algebra of the pure functions. -- -- Regards, KC

Re: [Haskell-cafe] [Haskell-beginners] Function application versus function composition performance

:-) But it's nice to wonder. Many thanks for any pointers, Matt. ___ Beginners mailing list beginn...@haskell.org http://www.haskell.org/mailman/listinfo/beginners -- -- Regards, KC ___ Haskell-Cafe

Re: [Haskell-cafe] How to select n random words from a file ...

An interesting related problem is if you are only allowed one pass through the data how would you randomly choose one word. -- -- Regards, KC ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell

[Haskell-cafe] Found quote: One of the ineradicable illusions about C++ is that the compiler should be able to see through ...

of Haskell; they should be comparable. :) Casey -- -- Regards, KC ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

[Haskell-cafe] Most C++ compilers will not optimize x^2.0 as x*x but instead will do an expensive ...

exponentiation and logarithm. So, I believe this C++ versus Haskell versus (your language of choice) is a Penn Teller misdirection. Whereas, another level of indirection solves everything. -- -- Regards, KC ___ Haskell-Cafe mailing list Haskell-Cafe

[Haskell-cafe] From some High-Performance Computing book; It is hard to eradicate from C++'ers the need for objects, classes, etc. ...

. C++ without most of the software engineering abstractions). Still, I remember that quote that, Another level of indirection solves everything. Or If you're Penn Teller, Another level of misdirection solves everything. Casey -- -- Regards, KC

[Haskell-cafe] I am having trouble with the type declaration for creating an identity matrix.

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

Re: [Haskell-cafe] I am having trouble with the type declaration for creating an identity matrix.

Thank you. One is ONLY supposed to supply the list elements for newListArray which fill the array in increasing order. On Tue, Apr 24, 2012 at 3:21 PM, Kevin Charter kchar...@gmail.com wrote: On Tue, Apr 24, 2012 at 3:20 PM, KC kc1...@gmail.com wrote: initIdentityMat :: Int - ST s (STUArray

[Haskell-cafe] Is it only one data structure per ST monad?

Is it only one data structure per ST monad? -- -- Regards, KC ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

[Haskell-cafe] (no subject)

buildPair = do arr - newArray ((1,1),(1,10)) 37 :: ST s (STArray s (Int,Int) Int) a - readArray arr (1,1) writeArray arr (1,1) 64 b - readArray arr (1,1) return (a,b) main = print $ runST buildPair -- -- Regards, KC

[Haskell-cafe] The last statement in a 'do' construct must be an expression: a - readArray arr (1, 1)

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

Re: [Haskell-cafe] The last statement in a 'do' construct must be an expression: a - readArray arr (1, 1)

Thank you, that was it. I was mixing up and tabs and spaces. I expected new versions of NotePad++ to keep my old settings. On Mon, Apr 23, 2012 at 1:54 PM, Ryan Yates fryguy...@gmail.com wrote: Perhaps you are mixing tabs and spaces? On Mon, Apr 23, 2012 at 4:52 PM, KC kc1...@gmail.com

Re: [Haskell-cafe] why are applicative functors (often) faster than monads? (WAS Google Summer of Code - Lock-free data structures)

Think of the differences (and similarities) of Applicative Functors and Monads and the extra context that monads carry around. -- -- Regards, KC ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell

Re: [Haskell-cafe] why are applicative functors (often) faster than monads? (WAS Google Summer of Code - Lock-free data structures)

, but that is probably hard in general. b On Apr 20, 2012, at 2:54 PM, KC wrote: Think of the differences (and similarities) of Applicative Functors and Monads and the extra context that monads carry around. -- -- Regards, KC -- -- Regards, KC

Re: [Haskell-cafe] I Need a Better Functional Language!

by Stephen Tse. -- -- Regards, KC ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] Theoretical question: are side effects necessary?

Apparently on such solid ground that you hinder their critical thinking skills by answering for them. On Fri, Mar 16, 2012 at 9:24 PM, Donn Cave d...@avvanta.com wrote: Quoth KC kc1...@gmail.com, On Fri, Mar 16, 2012 at 7:44 PM, Jerzy Karczmarczuk jerzy.karczmarc...@unicaen.fr wrote

[Haskell-cafe] In Haskell, because of the fine layers of abstraction that are possible, it pays to hone one's critical thinking skills.

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

[Haskell-cafe] In an imperative language, commands fulling memory cells is easy, but gives the false impression that S/W engineering is easy.

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

[Haskell-cafe] Are side effects necessary is a non question; you compute so as to change the state of the world.

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

[Haskell-cafe] The Theoretical Question would be; are side effects necessary for computational heavy lifting.

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

Re: [Haskell-cafe] Theoretical question: are side effects necessary?

the referential transparency, or does it? Jerzy Karczmarczuk What does referential transparency mean to you? -- -- Regards, KC ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

[Haskell-cafe] I've just heard of a neat security measure that when you compile the code it generates different object code...

... with the same functionality. Thus, your program would be a moving target to hackers. Would this be challenging with ghc? -- -- Regards, KC ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell

Re: [Haskell-cafe] Quicksort in Haskell

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

Re: [Haskell-cafe] Best bit LIST data structure

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

Re: [Haskell-cafe] Project Euler: request for comments

- [Int] - Int helper t u v (w:ws)  | ws == []  = t*u*v*w  | otherwise = max (t*u*v*w) (f (u:v:w:ws)) I tend to overlook mutual recursion in my toolbox. Thanks for the nnlightenment. On Sun, Aug 28, 2011 at 4:54 PM, KC kc1...@gmail.com wrote: Try something like the following: -- Project

Re: [Haskell-cafe] Off-topic: Mathematics and modesty

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

Re: [Haskell-cafe] Project Euler: request for comments

(w:ws)  | ws == []  = t*u*v*w  | otherwise = max (t*u*v*w) (f (u:v:w:ws)) I tend to overlook mutual recursion in my toolbox. Good going! :) Thanks for the enlightenment. On Sun, Aug 28, 2011 at 4:54 PM, KC kc1...@gmail.com wrote: Try something like the following: -- Project Euler 11

Re: [Haskell-cafe] Project Euler: request for comments

= a                   then f (b:c:d:e:ys)                   else f (a:b:c:d:ys) On Sat, Aug 27, 2011 at 8:26 PM, KC kc1...@gmail.com wrote: Think of the simplest version of the problem that isn't totally trivial. e.g. A one dimensional list of numbers. What would you do? Note: you only want to touch each

Re: [Haskell-cafe] Project Euler: request for comments

I just noticed that the 20x20 grid has some 00 entries; thus, time could be saved by not touching any of the grid entries 3 cells away. Same for the 01 entries. The challenge, of course, is in finding these entries in the first place. :) On Sun, Aug 28, 2011 at 1:58 PM, KC kc1...@gmail.com

Re: [Haskell-cafe] Project Euler: request for comments

for the hint. On Fri, Aug 26, 2011 at 8:55 PM, KC kc1...@gmail.com wrote: Is Problem 11 the 4 consecutive #'s problem? If so what must be true for 4 #'s to have a large product? Hint: x * y * z * 2 is that going to be larger? -- -- Regards, KC -- -- Regards, KC

Re: [Haskell-cafe] Project Euler: request for comments

Is Problem 11 the 4 consecutive #'s problem? If so what must be true for 4 #'s to have a large product? Hint: x * y * z * 2 is that going to be larger? -- -- Regards, KC ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org

Re: [Haskell-cafe] why the name lambda calculus?

See Serge Lang's Algebra. 2011/8/23 Rajesh S R srrajesh1...@gmail.com: Slight digression. Why not Lambda Algebra? In particular, what is the criteria for a system to be calculus and how's it different from algebra? -- -- Regards, KC ___ Haskell

Re: [Haskell-cafe] why the name lambda calculus?

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

Re: [Haskell-cafe] why the name lambda calculus?

I had thyroid cancer a few years ago; now I've lost my sense of tumour. :) -- -- Regards, KC ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] [Haskell-beginners] Conciseness question

their problem is. -- -- Regards, KC ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] For class Monoid; better names than mempty mappend might have been: mid (mident) mbinop

As pointed out earlier in this list, the name of the class and the methods are inconsistent. Monoid refers to a general algebraic structure, whereas mempty and mappend refer to certain instances like lists. Thank you for articulating what I was trying to get at. -- -- Regards, KC

[Haskell-cafe] Is there a program to check if a matrix is totally unimodular?

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

[Haskell-cafe] A language that runs on the JVM or .NET has the advantage of Oracle Microsoft making those layers more parallelizable.

Are there plans a foot (or under fingers) to make a version of Haskell that runs on the JVM? -- -- Regards, KC ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] For class Monoid; better names than mempty mappend might have been: mid (mident) mbinop

expressing valid mathematical concepts. In order to find similarities between apparently different operations data one wants to reason abstractly; similar to mathematics. -- -- Regards, KC ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http

[Haskell-cafe] For class Monoid; better names than mempty mappend might have been: mid (mident) mbinop

It would be easier for beginners to grok. -- -- Regards, KC ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] Call for GUI examples - Functional Reactive Programming

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

[Haskell-cafe] Can one drop GHC 7.0.4 into the Haskell Platform or does the platform need to be updated?

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

[Haskell-cafe] Haskell: The Craft of Functional Programming 3rd ed is out.

http://www.haskellcraft.com/craft3e/Home.html -- -- Regards, KC ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] Dead else branch does influence runtime?

? And what can I do to circumvent the problem? (Perhaps write some RULES magic?) Thanks - J.W. ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe -- -- Regards, KC

Re: [Haskell-cafe] Dead else branch does influence runtime?

                v2 = work cap' e s2                 v = g v1 v2             in par v1 $ pseq v2 $ v ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe -- -- Regards, KC

[Haskell-cafe] In ML books; functors only consume produce structures; whereas, functions CP values.

I've never seen such an easy description in Haskell books. Is there more going on with Haskell functors? -- -- Regards, KC ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] Can it be proven there are no intermediate useful type classes between Applicative Functors Monads?

On Mon, Jun 6, 2011 at 9:19 AM, Brent Yorgey byor...@seas.upenn.edu wrote: On Sun, Jun 05, 2011 at 12:51:47PM -0700, KC wrote: If new intermediate classes crop up then there would be no point in fixing class (Applicative m) = Monad m where since it would have to be changed if new

[Haskell-cafe] Can it be proven there are no intermediate useful type classes between Applicative Functors Monads?

If new intermediate classes crop up then there would be no point in fixing class (Applicative m) = Monad m where since it would have to be changed if new intermediate classes are found. I realize non-existence proofs are hard. -- -- Regards, KC

[Haskell-cafe] I'm trying to install the Haskell Platform on a Mac and ...

I'm trying to install the Haskell Platform on a Mac and I've already installed Xcode 3.2.6 but the platform says that the tools are not installed. Do I need to reboot? -- -- Regards, KC ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http

Re: [Haskell-cafe] I'm trying to install the Haskell Platform on a Mac and ...

Never mind. I didn't realize there were two steps: - clicking on the dmg file - then actualling installing the software On Sun, Jun 5, 2011 at 1:20 PM, KC kc1...@gmail.com wrote: I'm trying to install the Haskell Platform on a Mac and I've already installed Xcode 3.2.6 but the platform says

[Haskell-cafe] OK! I have a Mac with Snow Leopard 10.6.7?, Xcode 3.2.6, Haskell Platform 2011.2.0.1; What are 2or 3 ways so far to get a GUI graphics?

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

Re: [Haskell-cafe] The Lisp Curse

Librarians have been struggling for years with classifying topics; I don't imagine classifying coding libraries as any easier. :) -- -- Regards, KC ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo

Re: [Haskell-cafe] Is there an efficient way to generate Euler's totient function for [2, 3..n]?

It's declarative and may help to verify more efficient implementations. WOW! Good insight. :) On Sun, May 22, 2011 at 9:27 AM, Henning Thielemann schlepp...@henning-thielemann.de wrote: Daniel Fischer schrieb: On Saturday 14 May 2011 19:38:03, KC wrote: Instead of finding the totient

[Haskell-cafe] Is there a place where we can have a discussion on the merits of various GUI's various graphics? And then vote?

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

Re: [Haskell-cafe] Is there a place where we can have a discussion on the merits of various GUI's various graphics? And then vote?

So we can get this show on the road. Pun intended. :D On Fri, May 20, 2011 at 12:20 PM, KC kc1...@gmail.com wrote: :) -- -- Regards, KC ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

[Haskell-cafe] In several chapters there is a penetrating conceptual analysis of the matter at hand, on which a superstructure of code is erected.

Interesting comment on the book The Fun of Programming in JOOP. In several chapters there is a penetrating conceptual analysis of the matter at hand, on which a superstructure of code is erected. -- -- Regards, KC ___ Haskell-Cafe mailing list

[Haskell-cafe] Extension for Pearls of Functional Algorithm Design by Richard Bird, 2010, page 25 #Haskell

) of (True)- search3 k (xa,ya,za) (lx,rx) (ly,ry) (lz,mz) (False) - search3 (k-(mx-lx)-1) (xa,ya,za) (mx+1,rx) (ly,ry) (lz,rz) -- -- Regards, KC ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo

[Haskell-cafe] For Euler 25; What is the first term in the Fibonacci sequence to contain 1000 digits?; the following seems to work.

:: Double phi = (1 + sq5) / 2 -- -- Regards, KC ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] Status of Haskell + Mac + GUIs graphics

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

  1   2   >