later they may be different?
In any case, the name is still silly. unsafeCoerce and unsafePerformIO
can both lead to RTS crashes... but we seem to be saying they aren't as
unsafe as this one? Right.
--
Chris Smith
___
Haskell-Cafe mailing list
the first pointer yet. But if that's the case, and
it's executing arbitrary user code that may refer to that memory, then
the garbage collector contains race conditions! Then this false
positives issue is no different from any of the many other problems
such a bug might trigger.
--
Chris Smith
just say each move to a new window ends or pauses one network
of events and behaviors, and starts a new one?
--
Chris Smith
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On Thu, 2011-07-07 at 13:21 +0400, Dmitri O.Kondratiev wrote:
1) What to use for the Archive? Though input data is in JSON format,
data generated from it is binary vectors. Not sure that CouchDB is a
good choice in this case.
What simple (Haskell lib + DB) combination one may advise that
all
the memory.
--
Chris Smith
On Jul 4, 2011 9:46 AM, Logo Logo sarasl...@gmail.com wrote:
Hi,
For the following error:
Stack space overflow: current size 8388608 bytes.
Use `+RTS -Ksize -RTS' to increase it.
I want to find out the culprit function and rewrite it tail-recursively
to use
sensibly on iDevices is definitely pushing the ridiculous side of
things), but I also wouldn't expect their rather specific environment to
carry over to general purpose computing, or especially to Haskell.
--
Chris Smith
___
Haskell-Cafe mailing
no hint of success.
Any ideas?
--
Chris Smith
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
look like this is
related to the Windows code page issue (I'm using Ubuntu 11.4), and just
to be sure I've tried with the latest GLUT from git, and there is no
change here.
--
Chris Smith
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http
, and things will be fine. I'm still waiting to test on
a Mac; I know there'll be a lot of struggle to figure out the XCode
thing, but I imagine it'll be doable.
--
Chris Smith
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org
into this problem a
week ago; but after a few hours of hacking at it, it became clear that
it's too large a job, and I'm far too unfamiliar with GLUT, GLFW, or
OpenGL, for that to be feasible as yet another side project for me.)
--
Chris Smith
___
Haskell
evaluation will take care
of it. It looks like GHC is even throwing in a specialization for
Double when I give the global name a polymorphic type.
--
Chris Smith
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman
libraries, hashing version configurations,
and so on -- that apt/dpkg just doesn't have the Haskell-specific
knowledge to deal with.
--
Chris Smith
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
description there
is also inadequate, and there's also a kind of structure-preserving
property that needs to be stated there as well.
--
Chris Smith
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Ae you looking to do this in a web application, or client-side? Since one
of your requirements is to display a typeset equation, that makes a bit of
difference. In a web-based setting, the best way to do that is probably
MathML, whereas a GUI will be a bit harder.
On Jun 9, 2011 8:24 AM, Jacek
for my class.
--
Chris Smith
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
I got asked a question today about why Control.Applicative is labeled as
experimental on Hackage. Perhaps that field is something of a failed
experiment, and it remaining there is likely to confuse people.
Just a thought... not sure of the best place to mention it.
--
Chris Smith
software which can neither be bundled in the install kit nor downloaded
freely from elsewhere.
The part of this that is actually needed is the GCC build system, right?
Can't that be bundled on its own in a freely downloadable location?
Spoken as a non Mac user...
--
Chris Smith
On Sun, 2011-06-05 at 17:35 -0700, Donn Cave wrote:
Exactly. If you don't use MacOS, let alone develop on it, I guess
it's possible that this looks like an formidable obstacle, but then
wouldn't that pose some limits to how much you're going to be able
to enjoy GHC anyway?
Well, I explained
Sure... see quotRem in the prelude.
On May 6, 2011 10:49 AM, cas...@istar.ca wrote:
:)
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
___
On Wed, 2011-05-04 at 07:13 -0600, Barbara Shirtcliff wrote:
In the following solution to problem 24, why is nub ignored?
I.e. if you do lexOrder of 0012, you get twice as many permutations as with
012, even though I have used nub.
lexOrder :: [Char] - [[Char]]
lexOrder s
| length s == 1
will lead (has led, in more systems than I can count) to an
unusable result in the end.
--
Chris Smith
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
There seems to be some misunderstanding here. I didn't suggest you share a
separate build directory between repositories... I suggested you have a
single repository that is the one you are currently building in, and that
you synchronize it with various other repositories as you swap branches.
, particularly in GHCi. I don't mind if Haskell refuses to build a
binary, but having to comment out coded in order to load bits in GHCi is
definitely a pain.
--
Chris Smith
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org
I'm a great fan of darcs, and also have never run into the performance and
reliability issues that GHC has. That said, it's clear that they *have* run
into them, and if something else makes GHC development go more smoothly,
then I'm 100% supportive of their using it.
It is disappointing, though
I've noticed a lot of packages recently missing documentation links on
Hackage. It looks like the job to build these hasn't been running since
perhaps about Saturday. Are appropriate people aware of this?
--
Chris Smith
___
Haskell-Cafe mailing
Haskell has Cairo bindings as part of gtk2hs. The package on Hackage is
called 'cairo'. You can certainly preview on the screen, but I'm less sure
about exporting to PDF, since the bindings were intended for GUI
programming. At least PNG output is possible, though; PDF may be, as well.
To answer my own email, yes, PDF support is there.
On Apr 15, 2011 8:17 AM, Chris Smith cdsm...@gmail.com wrote:
Haskell has Cairo bindings as part of gtk2hs. The package on Hackage is
called 'cairo'. You can certainly preview on the screen, but I'm less sure
about exporting to PDF, since
)
and then introduce another function composition:
let h = (g 0 .) . f
Whether that's clearer than the pointed definition is up for debate, but
there it is. Just keep in mind that sections of (.) are very confusing
to some people.
--
Chris Smith
___
Haskell-Cafe
On Sun, 2011-03-06 at 09:46 +0300, Nikitiskiy Dmitriy wrote:
As I see, some examples compilled with similar flags:
/usr/local/src/ghc-7.0.2/bin/ghc --make -O2 -fglasgow-exts -rtsopts
-funbox-strict-fields -fexcess-precision -fvia-c -optc-O3
spectralnorm.ghc-4.hs -o spectralnorm.ghc-4.ghc_run
On Mar 4, 2011 2:49 AM, Karthick Gururaj karthick.guru...@gmail.com
wrote:
Ord has to be compatible with Eq, and none of these are.
Hmm.. not true. Can you explain what do you mean by compatibility?
Compatibility would mean that x == y if and only if compare x y == EQ. This
is not a
infix operator fixes the second argument?
Sections can be either left sections or right sections, so you can pick
which argument is provided.
Prelude let y = (/ 20.0)
Prelude y 10
0.5
Prelude let y = (20.0 /)
Prelude y 10
2.0
Hope that helps,
--
Chris Smith
this is
designed), you'll have to find the LINE directive in the .hs file
nearest to (but before) 49, and count lines from there.
--
Chris Smith
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On Wed, 2011-02-23 at 08:42 -0600, Kurt Stutsman wrote:
When I was reviewing the Haskell language specification on haskell.org,
it certainly looked like what I was doing was supported by the language.
I found some comments on GHC's site about the reasoning behind these
flags, but I couldn't
used. Gtk2Hs isn't particularly functional in
style, but as imperative approaches go, it is probably the most widely
used general purpose GUI toolkit in the Haskell community, and very good
quality.
--
Chris Smith
___
Haskell-Cafe mailing list
Haskell
from lazy evaluation rather than
garbage collection.
--
Chris Smith
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
is
that they'll probably statically link; and you should read licenses of
your dependencies, and carefully choose dependencies, accordingly.
--
Chris Smith
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo
.
--
Chris Smith
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
, and removes the need to do per-module license
considerations.
--
Chris Smith
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On Tue, 2011-02-08 at 18:15 +0300, Permjacov Evgeniy wrote:
Is there any way to get current position from System.IO.Handle as
Integer?
Have you looked at hTell in System.IO?
--
Chris Smith
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
style, with a clean interface consisting entirely of
high-level ideas, and which easily switches over to the game interface
later. Awesome!
Thank you so much for pointing it out.
--
Chris Smith
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
On Sun, 2011-01-30 at 12:04 -0500, JETkoten wrote:
I'm looking for a way to clear the screen in ghci within emacs. I saw a
feature request from a couple of years back for :clear, but it was
deleted saying something along the lines of Ctrl-L works fine for me.
This is true in my system
Jason, thanks for the comments. Unfortunately, I probably won't do blogs
about it. Hate to say it, but anyone who has read much outside of
/r/haskell will surely agree it's irresponsible to write about children on
Reddit. And things I write on my blog are likely to end up on Reddit.
I'll find
would need to be lifted through the use of either `lift` or
`liftIO`.
--
Chris Smith
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
patterns you can just discover and then say Huh, why do you think
that happens? Can you write it down precisely? ...)
--
Chris Smith
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On Thu, 2011-01-27 at 15:26 +, Stephen Tetley wrote:
John Peterson had some nice work using Haskore and Fran for elementary
teaching on the old Haskell.org website. Google's cache says the old
URL was here but its now vanished:
www.haskell.org/edsl/campy/campy-2003-music.ppt
That sounds
for a real language. Not
after they've already played with Haskell and GHCi for mathematics!
--
Chris Smith
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On Thu, 2011-01-27 at 09:28 -0600, aditya siram wrote:
Ye gods! A B D [1] language for kids?
I do share those concerns. Like I said in the original post, my initial
reaction was to push for something like Python. But the kids are very
clear; if I'm at all willing, they want to learn Haskell!
dumping lists of multiple
licenses on them.
--
Chris Smith
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
libraries and
might be open to relicensing the native stuff. Seems like a good
question to me.
--
Chris Smith
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
for
other libraries' licensing, it would be reasonable to suggest splitting
it up to better express the intent. If the author did intend those
restrictions, then of course they will remain.
--
Chris Smith
___
Haskell-Cafe mailing list
Haskell-Cafe
On Tue, 2011-01-25 at 20:53 -0800, John Millikin wrote:
What are you talking about? Of course BSD3 libraries/applications can
depend on GPL'd code.
Not being a lawyer, I'll avoid claiming any definitive answers, and just
mention that that's definitely a minority opinion, and at odds with the
and dependent
library/application.
I'm fairly sure I'm not mixed up. I think it may have caused some
confusion that I'm talking about the entire program, and you seem to be
(sometimes, at least) talking about individual pieces of source code.
--
Chris Smith
about symbol resolution and
relocation stuff).
--
Chris Smith
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
the direct and indirect
dependencies of their project, looking for additional restrictions that
might be hiding there. That's a pretty ridiculous requirement, and
makes it unreasonably difficult to comply with the wishes of library
authors.
--
Chris Smith
On Mon, 2011-01-17 at 18:25 +0100, Corentin Dupont wrote:
Thanks a lot for your response Jeremy.
I can see a lot of site that does update infos without the user to
have to click refresh (I think Facebook does?).
Do they do polling?
While I'm not familiar with Facebook, I'd guess that today,
to convert between them, there is:
L.toChunks :: L.ByteString - [S.ByteString]
L.fromChunks :: [S.ByteString] - L.ByteString
S.concat :: [S.ByteString] - S.ByteString
Keep in mind that concatenating very large, or a very large number of,
strict ByteStrings can be expensive.
--
Chris
Chaddaï Fouché wrote:
Given that this structure isn't lazy enough, I really don't see a
problem with using Int (any random access list with a size that needs an
Integer would blow the memory anyway...).
Bad way to think about things. The implications of using Int as the
result type of a
have modified it,
and if so take the current value as a parameter instead of reading it
like normal.
Or am I misunderstanding something?
--
Chris Smith
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo
. That would
involve considerably less bookkeeping, at the expense of replaying some
transactions unnecessarily. Then readTVarWhen would basically be special
only if it's the first access to the TVar within the transaction.
--
Chris Smith
?
--
Chris Smith
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
I'm running into this in some code I wrote. What does it mean? It says
to look at -fspec-constr-count, but that flag doesn't seem to be in the
GHC documentation.
This isn't critical; the code still seems to work fine. It just makes
the build uglier.
Thanks. Message below.
SpecConstr:
result in an inferred type of Int
for half the numbers in the program. The problem is likely to be in a
piece of code completely unrelated to where the symptoms occur.
--
Chris Smith
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http
Hans Aberg wrote:
This problem is not caused by defining f+g, but by defining numerals as
constants.
Yup. So the current (Num thing) is basically:
1. The type thing is a ring
2. ... with signs and absolute values
3. ... along with a natural homomorphism from Z into thing
4. ... and with Eq
. There, instead of hanging for about a minute before printing
out the list, it would hang for about 4 billion minutes.
--
Chris Smith
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
PR Stanley wrote:
Just a meta-point.
The dash-dash-space sequence introduces a signature. If you write your
reply after the dash-dash-space, as you did here, a lot of us won't see
your reply because we have our mail/news clients set up to ignore
signatures. I had to view the original
Just random thoughts here.
Andrew Bagdanov wrote:
Well, if I don't have side effects (and don't mind extra, unneeded
evaluations), I can write my conditionals as functions in Scheme too.
Heck, now that I think of it I can even avoid those extra evaluations
and side-effect woes if i require
it, that it is in fact better than the
current parsing rules.
--
Chris Smith
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
application works best.
I'm beginning to wonder if I fully understand the right associativity
rule for the - operator.
It just means that if I have a string of things separated by -, I can
put parentheses around all but the leftmost one, and it doesn't change
the meaning.
--
Chris Smith
, but I trust someone will
correct me if that confidence is misplaced.
--
Chris Smith
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
meanings for map, and I don't see which one
you mean.
--
Chris Smith
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
been my first introduction to
the Haskell community.
--
Chris Smith
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
time.
Hope this is of interest.
--
Chris Smith
Lead Software Developer, MindIQ Corporation
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
to be polymorphic. The rank n type does that,
but it loses the ability to get the most general possible result type.
--
Chris Smith
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
mean you think it's good enough, then yes, I pretty much have
conluded it's at least the best that's going to happen; I'm just not
entirely comfortable with it.
--
Chris Smith
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org
it in compiler/iface/BinIface.hs in any GHC source tree.
--
Chris Smith
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
- b
diffNum f x= let AD y dy = f (AD x 1) in dy
diffFractional f x = let AD y dy = f (AD x 1) in dy
diffFloating f x = let AD y dy = f (AD x 1) in dy
--
Chris Smith
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http
, and entirely
unworkable since (:) is a user-definable contructor name... but that's
the intuition anyway.
--
Chris Smith
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
) else x
redefines the absolute value function, which is not differentiable at 0,
but this implementation will claim f'(0) = 1, and there's no obvious way
to avoid it without changing a lot.
--
Chris Smith
___
Haskell-Cafe mailing list
Haskell-Cafe
*merely* intervals, because the type given for diffNum, for example,
requires that the first parameter be no more specific than
Num a = a - a... so one may not actually pass in a function of type
Int - Int and expect the code to compile.
--
Chris Smith
6.8. For example, it's why I had to sneakily
add a module declaration to the top of a source file when I wrote
http://www.haskell.org/haskellwiki/Learn_Haskell_in_10_minutes#Function_definitions
--
Chris Smith
___
Haskell-Cafe mailing list
Haskell
if there are other
components that could be used instead in a Gtk2Hs application.
--
Chris Smith
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
, and then using that to try to embed the Mozilla editor
component. Given my serious lack of knowledge in XP-COM or the Mozilla
project or GTK, that looks sort of scary.
Any other ideas?
--
Chris Smith
___
Haskell-Cafe mailing list
Haskell-Cafe
, applying to graduate schools, and some volunteer work that
I'm not willing to give up, I simply have no remaining time, and won't
until about December or later.
If someone else wants to pick up this project, please go for it.
Otherwise, I'll get to it when I do.
Sorry!
--
Chris Smith
[t] a) b c
--
Chris Smith
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
.
--
Chris Smith
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
), or something like that. In other words, the syntax
lies to me.
At the moment, though, I can't think of anything better.
--
Chris Smith
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
of their closing parentheses.
--
Chris Smith
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
.
--
Chris Smith
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
find the innermost
containing do block than make up new rules for each piece of syntax.
Granted, a special case of it's an error is far more appealing than
the corresponding special case for if; but I don't yet see a reason for
this exception to the rule either.
--
Chris Smith
I understand the point here. The monad laws are
defined in terms of = and return. They have never had anything to do
with do, let, or -. All of the monad laws still hold.
--
Chris Smith
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http
page about this; but
it should probably be on the Haskell prime wiki, no? I'm not entirely
clear on how to get an account there. I could add it to HaskellWiki,
but I think that would be the wrong place for it.
--
Chris Smith
___
Haskell-Cafe mailing
is, in turn:
let x = return 12 in x = (\t1 - let x = t1 in ...)
--
Chris Smith
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
trying to discuss the
best way to solve this problem.
--
Chris Smith
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
) -- makes sense, and I think it's unambiguous
Other ideas:
``expr`` -- back-ticks make sense for UNIX shell scripters
(| expr |)-- I don't think anything uses this yet
Thoughts?
--
Chris Smith
___
Haskell-Cafe mailing list
Haskell
?
--
Chris Smith
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
.
--
Chris Smith
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
in the short term, and
then try to develop the technological structures to make it obsolete.
--
Chris Smith
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
\/\2/' \
| sudo /bin/sh
cd /usr/local/share/ghc/doc/html
sudo ./gen_contents_index
--
Chris Smith
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
-and-so's GUI
library hasn't actually been touched since they finished their class
project in 1998 and doesn't build with the latest version of Qt or
whatever.
--
Chris Smith
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org
Andrew Coppin [EMAIL PROTECTED] wrote:
Chris Smith wrote:
Well, it doesn't have to go over anywhere. I'm reading and posting
just fine with NNTP right now. It works great.
How'd you manage that?
Andrew, sorry for the delay. Just point a news reader at
news.gmane.org.
--
Chris
101 - 200 of 203 matches
Mail list logo
