-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
I have written iteratees on the JVM, which does not include tail-call
in its instruction set. They incur a stack frame per iteratee input,
which can be expensive and unable to scale beyond a few thousand. Is
there some trick to permitting this? Some
On 30 May 2011 05:27, Anupam Jain ajn...@gmail.com wrote:
Why doesn't Haskell have built in syntactic sugar for atoms?
Because they don't have a functional interpretation? (i.e. they're
really a hack)
___
Haskell-Cafe mailing list
On 28/05/2011, at 3:37 PM, Brandon Allbery wrote:
On Fri, May 27, 2011 at 23:10, Tom Murphy amin...@gmail.com wrote:
I sure love Hackage, but there's a very interesting discussion
going on, on the Erlang mailing list, about completely restructuring
the module-model.
Sounds like one of
On 28/05/2011, at 11:47 PM, Dmitri O.Kondratiev wrote:
Hello,
I am trying to solve a simple task, but got stuck with double recursion - for
some reason not all list elements get processed.
Please advice on a simple solution, using plane old recursion :)
*** Task:
From a sequence of
2011-05-28 11:35, Heinrich Apfelmus skrev:
Emil Axelsson wrote:
Hello!
Lacking a proper blog, I've written some notes about Data.Unique here:
http://community.haskell.org/~emax/darcs/MoreUnique/
This describes a real problem that makes Data.Unique unsuitable for
implementing observable
Henk-Jan van Tuyl commenting Andrew Coppin
... (about HOpenGL and H.Platform) ...
Uh... yes, you might be right about that. However, AFAIK you still
need something with which to create a rendering surface in the first
place. (Not sure if HP includes GLUT...)
As you can see in the HP
On 30 May 2011 00:14, Alexey Khudyakov alexey.sklad...@gmail.com wrote:
It always puzzled me why there are no packages for for testing general
type classes laws. (Monoid laws, monad laws etc). It looks like ideal
case for quickcheck and smallcheck.
How about 'checkers' by Conal Elliott:
On 30.05.2011 12:26, Bas van Dijk wrote:
On 30 May 2011 00:14, Alexey Khudyakovalexey.sklad...@gmail.com wrote:
It always puzzled me why there are no packages for for testing general
type classes laws. (Monoid laws, monad laws etc). It looks like ideal
case for quickcheck and smallcheck.
How
The dtd-types package provides types for processing XML DTDs in Haskell.
These types are intended to be compatible with and extend the set of types
provided by John Millikin's xml-types package.
This is a very preliminary first version, pending discussion by the
community on the web-devel list
Alexey Khudyakov schrieb:
On 30.05.2011 12:26, Bas van Dijk wrote:
How about 'checkers' by Conal Elliott:
http://hackage.haskell.org/package/checkers
We really need better search on hackage than C-f in browser. I didn't
find them. Thank you for pointers.
google with
On Mon, May 30, 2011 at 11:26 AM, Richard O'Keefe o...@cs.otago.ac.nz wrote:
On 28/05/2011, at 11:47 PM, Dmitri O.Kondratiev wrote:
Hello,
I am trying to solve a simple task, but got stuck with double recursion -
for some reason not all list elements get processed.
Please advice on a
From: michael rice nowg...@yahoo.com
I think this is fixed in the gtk2hs source tree, have you tried building
from the repo?
cabal install gtk2hs-buildtools
darcs get --lazy http://code.haskell.org/gtk2hs/
cd gtk2hs
chmod +x bootstrap.sh
./bootstrap.sh
John Lato
Is this worth chasing
Hi all,
I'm trying to learn about enumerators by reading this
paperhttps://john-millikin.com/downloads/enumerator_0.4.10.pdfand
came across some code on page 2 that I found hard to digest, but I
think
I finally got it:
import Data.Monoid
data Stream a
= Chunks [a]
| EOF
deriving (Show, Eq)
Hello,
I am trying to detect signal patterns in a system with numerous signals
overlaying each other in time. I am aware that there is a whole class of
problem solving methods for this task, yet trying my own algorithm, that may
be wrong of course :)
Next I use a simple example to describe the
On 30.05.2011 14:45, Henning Thielemann wrote:
Alexey Khudyakov schrieb:
On 30.05.2011 12:26, Bas van Dijk wrote:
How about 'checkers' by Conal Elliott:
http://hackage.haskell.org/package/checkers
We really need better search on hackage than C-f in browser. I didn't
find them. Thank you for
and then
cabal install soegtk?
Michael
--- On Mon, 5/30/11, John Lato jwl...@gmail.com wrote:
From: John Lato jwl...@gmail.com
Subject: Re: [Haskell-cafe] Haskell School of Expression (graphics)
To: michael rice nowg...@yahoo.com
Cc: haskell-cafe@haskell.org, Andrew Coppin
Emil Axelsson wrote:
Heinrich Apfelmus wrote:
Since every module of my DSL depends on the same
global variable, only two things should happen:
* Reloading a module does not reload the global counter. Everything is
fine.
* Reloading a module does reload the global counter. This forces *all*
Yves Parès wrote:
For the purposes of a simple strategy game, I'd like to build an EDSL that
expresses missions. A mission could be represented as a state machine.
With basic bricks such as actions (MoveTo, ShootAt...) or tests
(EnemiesAround, LowHealth...), I could (ideally dynamically) build
Hi all,
I've just uploaded Clipboard-2.2.0 to Hackage [1].
Clipboard [2] is a library that provides an interface for the system
clipboard. The API is very simple, so anyone can use it without knowing of
low-level Win32 API. Currently, this library only works on a Windows OS, due
to its
Because they are more general functions that work on all monads rather
than just lists.
This allows Stream to be defined more flexibly.
On Mon, May 30, 2011 at 9:01 PM, John Ky newho...@gmail.com wrote:
Hi all,
I'm trying to learn about enumerators by reading this paper and came across
some
From: John Ky newho...@gmail.com
Sent: Monday, May 30, 2011 8:01 AM
Hi all,
I'm trying to learn about enumerators by reading this paper and came across
some code on page 2 that I found hard to digest, but I think I finally got it:
Hi John. These programs should behave identically, and I think
On Mon, May 30, 2011 at 9:01 AM, John Ky newho...@gmail.com wrote:
instance Monoid (Stream a) where
mempty = Chunks mempty
mappend (Chunks xs) (Chunks ys) = Chunks (xs ++ ys)
mappend _ _ = EOF
I guess, it shows my lack of experience in Haskell, but my question is, why
is writing
Firstly a big thanks to Neil Mix for this threading library...
http://www.neilmix.com/2007/02/07/threading-in-javascript-17/
It is just what GHCJS needs for threading support (at least in Firefox).
Here is what I did to get it working in GHCJS...
* Added Jump so that tail calls don't grow the
A quick follow-up:
1) I had a typo: it should say N4 is like N1 with a phantom type variable.
2) In my larger code base, the constructor that is visible to TH when
I think it shouldn't be is part of a type that is alpha-equivalent to
N3. It's odd that N3 doesn't exhibit the leakiness here but an
This message motivates adding support to Template Haskell for code
that can be spliced but can no longer be intensionally analyzed.
I'm trying to use the well-known technique of a hidden constructor in
order to represent values that satisfy a particular predicate.
module Safe (Safe(), safe,
Hi Michael,
You've used quite a few entirely redundant brackets. The tool HLint (
http://community.haskell.org/~ndm/hlint) will tell you which ones.
Thanks, Neil
On Wed, May 25, 2011 at 12:09 AM, michael rice nowg...@yahoo.com wrote:
The input file: http://dl.dropbox.com/u/27842656/psalms
Nice tool. I'll be using it a lot from now on, I'm sure. Thanks, Neil.
Michael
--- On Mon, 5/30/11, Neil Mitchell ndmitch...@gmail.com wrote:
From: Neil Mitchell ndmitch...@gmail.com
Subject: Re: [Haskell-cafe] Code critique - Was [Maybe Int] sans Nothings
To: michael rice nowg...@yahoo.com
Cc:
Hello,
I'm playing around a bit with the hmatrix package
(http://hackage.haskell.org/package/hmatrix) but can't quite figure out how to
make the cmap function in Numeric.Container work.
An example:
ghci import Numeric.LinearAlgebra
ghci let v = fromList [1.0,2.0,3.0]
ghci v
fromList
Hi John,
While I'm on the topic, I recently wrote a tool that wanted to
traverse deep data structures as produced by haskell-src-exts. ?I
wound up with about 50 lines of case expressions and around the time
my hands were literally beginning to hurt decided that enough was
enough and I
this is actually a bug in the type of cmap, a fix is due in the next release
(at least thats what Alberto indicated to me when I asked about this a
monthish ago) (note how you have the container type c e, but we want c a and
c b ). Instead use the vector map or matrix map ops directly
cheers
Hi Neil, thanks for the response.
On Mon, May 30, 2011 at 8:48 PM, Neil Mitchell ndmitch...@gmail.com wrote:
Hi John,
While I'm on the topic, I recently wrote a tool that wanted to
traverse deep data structures as produced by haskell-src-exts. ?I
wound up with about 50 lines of case
Hi Brandon,
Thanks for your suggestion. I'm a little stuck as adding Monad and
MonadPlus in my instance declaration doesn't seem sufficient. I know
mconcat comes from Monoid, but I don't know how to put that in.
data Stream m a
= Chunks (m a)
| EOF
deriving (Show, Eq)
instance (Monad m,
I felt I should probably mention that ultimately what was done is I moved
NonEmpty all the way down into semigroups and chose
sconcat :: NonEmpty a - a
at it was the closest analogue to the current mconcat behavior.
So, request accomodated. ;)
-Edward
On Tue, May 3, 2011 at 7:23 PM, Edward
sorry, `m a` as an instance of Monoid, not `m'
On Tue, May 31, 2011 at 9:30 AM, Canhua dreamerat...@gmail.com wrote:
I think you should declare `m' as an instance of Monoid,
rather than as instnaces of Monad and MonadPlus
On Tue, May 31, 2011 at 8:33 AM, John Ky newho...@gmail.com wrote:
Hi
I've been busy making major changes to my time library:
http://hackage.haskell.org/package/time-recurrence
Things are still under heavy development. This release is to show the
direction the library is heading in.
A major shift in the design has been made, and the current work is an
attempt
When building the Haskell Objective C bindings tool from
http://code.google.com/p/hoc
Using GHC 7.0.3 for Haskell Platform 2011.2.0.1, OS X 64 bit
HOC compiles HOC_cbits.o before trying to build it into the rest of
the program (I don't say link because this came up while trying to
compile:
[18
Hello!
I'm studying repa package and trying to implement O(N^2) n-body code. I'm using
Array DIM2 Double to represent the collection of particles.
I've managed to write a function which calculates the energy of one particle in
the field of others but I'm struggling to write a code to calculate
As part of my research fellowship at the National Institute of
Informatics in Tokyo, I announce the availability of student
internships for up to three months between July and September 2011.
Qualified applicants are enrolled in a Masters or Phd program, have a
firm grasp of the Haskell
On 5/28/11 10:11 AM, Alex Rozenshteyn wrote:
Since no-one has yet mentioned it, and I think it might be relevant,
http://types.bu.edu/seminar-modularity/first-class-modules-for-haskell.pdf
I haven't read it with any degree of understanding, but I don't think
it's tractable to remove modules
instance (Monad m, MonadPlus m) = Monoid (Stream m a) where
mempty = Chunks mempty
mappend (Chunks xs) (Chunks ys) = Chunks (xs `mappend` ys)
mappend _ _ = EOF
Iteratee.hs:28:25:
No instance for (Monoid (m a))
arising from a use of `mempty'
There is a clue
40 matches
Mail list logo
