On Sat, 13 Mar 2010 Daniel McAllansmith wrote:
Hello.
Short story:
$ cabal install --global --constraint=old-time=1.0.0.3.1 --reinstall -v
darcs
/tmp/hashed-storage-0.4.71127/hashed-storage-0.4.7/Setup.hs:13:7:
Could not find module `System':
Use -v to see a list
Hello.
Short story:
$ cabal install --global --constraint=old-time=1.0.0.3.1 --reinstall -v
darcs
/tmp/hashed-storage-0.4.71127/hashed-storage-0.4.7/Setup.hs:13:7:
Could not find module `System':
Use -v to see a list of the files searched for.
This is using GHC 6.12.1,
On Wed, 23 Sep 2009 15:06:25 Daniel Fischer wrote:
Am Mittwoch 23 September 2009 04:06:11 schrieb Jimmy Hartzell:
Daniel Fischer wrote:
Or, what I do:
concat
[ (
, str
, )
]
This is a lot better, true, but it still takes a lot of typing, and the
Huh?
On Fri, 08 May 2009 00:30:34 Claus Reinke wrote:
seq something like size map that will force a traversal of the entire
tree, and ensure that the result is actually demanded, ..
(Not tested)
and not recommended, either, I'm afraid!-)
| Actually, I'm unsure how to fix this. For an
On Sat, 24 Jan 2009 14:18:24 Tristan Seligmann wrote:
* Alex Ott alex...@gmail.com [2009-01-22 20:32:26 +0100]:
PUT http://127.0.0.1:5984/test1/Users_ott_tmp_1_tst HTTP/1.1
Content-Type: ...
...
Host: 127.0.0.1:5984
...
Note that this is a valid HTTP request, according to my reading
On Wed, 19 Nov 2008 21:27:36 Duncan Coutts wrote:
It's even easier than that! Someone has done it already :-)
http://hackage.haskell.org/trac/hackage/ticket/261
Thu Aug 28 16:55:16 CEST 2008 Chry Cheng [EMAIL PROTECTED]
* Marking packages deprecated
Fixes ticket no. 261 as discussed in
On Fri, 22 Aug 2008 11:12:08 Arjun Guha wrote:
Aha, I knew I wasn't dreaming!
http://mult.ifario.us/p/a-short-adventure-with-simplehttp
Paul Brown posted this discussion back in February. It looks like the
same thing. Has there been an update of HTTP since then?
Nope, it hasn't been
On Fri, 22 Aug 2008 14:15:48 Duncan Coutts wrote:
On Thu, 2008-08-21 at 19:12 -0400, Arjun Guha wrote:
Aha, I knew I wasn't dreaming!
http://mult.ifario.us/p/a-short-adventure-with-simplehttp
Paul Brown posted this discussion back in February. It looks like the
same thing. Has
On Mon, 14 Apr 2008 11:06:43 Adam Langley wrote:
On Sun, Apr 13, 2008 at 4:59 AM, Johan Tibell [EMAIL PROTECTED]
wrote:
* Using a different set of data types would work better.
Give that this is Haskell, I'd suggest more types ;)
HTTP headers aren't just strings and, at the risk of
On Mon, 14 Apr 2008 13:32:07 Chris Smith wrote:
On Sun, 13 Apr 2008 16:06:43 -0700, Adam Langley wrote:
On Sun, Apr 13, 2008 at 4:59 AM, Johan Tibell [EMAIL PROTECTED]
wrote:
* Using a different set of data types would work better.
Give that this is Haskell, I'd suggest more types ;)
against the darcs version of http that cures my test
programs leak.
Cheers
Daniel
New patches:
[Make browse close pooled connections to prevent them leaking.
'Daniel McAllansmith [EMAIL PROTECTED]'**20080411025515
The closing of the connections needs to be made exception safe. Should try
On Thursday 18 October 2007 21:15, you wrote:
Daniel McAllansmith [EMAIL PROTECTED] writes:
3. Otherwise, major.minor MUST remain the same (other version components
MAY change).
Is it an option to say SHOULD rather than MUST here?
Of course, SHOULD is an option just like MAY is. But both
I was wondering if anyone had done work on tagging functions at the type level
with their time or space complexity and, if it's even feasible, calculating
the complexity of compound functions.
Any pointers?
Cheers
Daniel
___
Haskell-Cafe mailing list
On Thursday 18 October 2007 00:54, Simon Marlow wrote:
I've written down the proposed policy for versioning here:
http://haskell.org/haskellwiki/Package_versioning_policy
Is there technical reason for the major version number to consist of 2
components? Why not 3, 17 or (my preference)
Following is a summary of my thoughts on the matter, in large part so I can
figure out what I'm thinking... apologies if it's a bit of a ramble. All
comments welcome.
Basically
- version numbering which differs from Simon's proposal
- precise dependencies, I think the same as Simon is
On Wednesday 17 October 2007 01:32, ChrisK wrote:
Simon Marlow wrote:
Several good points have been raised in this thread, and while I might
not agree with everything, I think we can all agree on the goal: things
shouldn't break so often.
I have another concrete proposal to avoid things
On Tuesday 16 October 2007 11:45, Claus Reinke wrote:
how about using a provides/expects system instead of betting on
version numbers? if a package X expects the functionality of base-1.0,
cabal would go looking not for packages that happen to share the name,
but for packages that provide
On Tuesday 04 September 2007 08:29, Neil Mitchell wrote:
Hi
There are two entirely separate issues in this thread - let's not confuse
them.
1) The old HaWiki content is good and unavailable. I want it made
available, in whatever form is appropriate. Please :-)
2) Licensing - the old
On Wednesday 01 August 2007 17:44, Thomas Conway wrote:
This sounds like a common problem type. Is there a well known solution
to this sort of problem?
Have you looked into Tying the Knot?
http://www.haskell.org/haskellwiki/Tying_the_Knot
A simple example:
module Knot where
import Data.Char
On Wednesday 18 July 2007 21:16, Johan Tibell wrote:
It would be nice if it was possible to capture this kind of behavior in a
high order function just like map though. I guess the problem is that the
function to map will take different number of arguments depending on the
use case.
On Saturday 14 July 2007 11:29, Michael Vanier wrote:
Albert,
Thanks for the very detailed reply! That's the great thing about this
mailing list.
I find your description of seq somewhat disturbing. Is this behavior
documented in the API? I can't find it there.
As I understand it seq
On Monday 09 July 2007 17:42, Thomas Conway wrote:
I don't know if you saw the following linked off /.
http://www.itwire.com.au/content/view/13339/53/
An amazon link for the book is here:
http://www.amazon.com/Computer-Science-Reconsidered-Invocation-Expression/d
p/0471798142
The basic
On Thursday 05 July 2007 11:20, Michael Vanier wrote:
Again, I'm sure this has been done before (and no doubt better); I'd
appreciate any pointers to previous work along these lines.
Takusen is, if I recall correctly, based around a generalised fold supporting
accumulation and early
Thanks for the responses everyone.
On Thursday 07 June 2007 00:37, [EMAIL PROTECTED] wrote:
Simon Brenner wrote:
Do you simply want the set of coordinates, or do you want to do
something smart with the them (i.e. optimize a function value etc)?
Ultimately optimise several functions over the
Hello.
I've got a system of linear inequalities representing half-spaces. The
half-spaces may or may not form a convex hull.
I need to find the integral coordinates that are contained within the convex
hull, if there is one.
For example, given
0 = x = 4
0 = y = 3
0 = 2x - y
0 = 1.2y - x
I
On Tuesday 29 May 2007 13:20, PR Stanley wrote:
Hi
What is the C equivalent of the inequality operator in Haskell?
/=
You can answer these sorts of questions yourself using Hoogle:
And what makes you think I haven't tried Google already?
Unlike you I only write to the list when I have
On Friday 25 May 2007 06:50, Grzegorz wrote:
Hi all,
I have a simple piece of code which is giving me stack overflow. I guess I
need to make it stricter sowhere but I can't figure out extactly where. So
I thought I'd ask the experts.
I'm not sure. A real expert from the list will probably
On Wednesday 23 May 2007 19:01, Donald Bruce Stewart wrote:
Bryan O'Sullivan, Don Stewart and John Goerzen are pleased, and frankly,
very excited to announce that were developing a new book for O'Reilly, on
practical Haskell programming. The working title is Real-World Haskell.
That's good
On Sunday 06 May 2007 21:15, Andrew Coppin wrote:
OK, this is hacking me off now... Does ANYBODY know how I can convince
Thunderbird to send replies to Haskell Cafe rather than sending them to
the original poster? This is really becoming tiresome...
Looks like you're on windows so maybe this
http://www.google.com/search?hl=enq=fedora+haskell+libreadline.so.4btnG=Searchmeta=
gives:
http://www.nabble.com/-Haskell--Re:-kernel-2.6.11-and-readline.so-t577156.html
as the first result, which appears to give a solution
and, in fact, if I look at:
On Wednesday 07 March 2007 10:22, D.V. wrote:
On 3/6/07, mm [EMAIL PROTECTED] wrote:
I cannot help you with your question more than pointing you to
http://bugs.darcs.net/issue391
where Simon Marlow explains how to avoid IO.bracket.
I'm using Control.Exception's bracket.
Also,
On Wednesday 07 March 2007 10:56, D.V. wrote:
The problem is that hGetContents only reads the contents of the file on
demand and, without the 'return $!' you don't demand the value until
somewhere outside of rechf. By this point the hClose has happened and
hGetContents has no access to
On Wednesday 07 March 2007 17:16, cornmouse wrote:
I have a txt file, which contains a paragraph. I am trying to read the
file, and pass the contents of the file as a string to another function
called createIndex. createIndex is a function to generate index of the
input string.
Below is my
On Saturday 24 February 2007 21:22, Johan Tibell wrote:
So my question is. How can I write the function
'extractElementsIntoRecords' below. Or, perhaps HXT is the wrong tool
for the job and I should be trying to walk the DOM tree instead?
module HCard where
import Text.XML.HXT.Arrow
Hello.
Given:
newtype Dist a = D {unD :: [(a,Int)]}
instance Monad Dist where
return x = D [(x,1)]
d = f = D [(y,q*p) | (x,p) - unD d, (y,q) - unD (f x)]
fail _ = D []
How would one change Dist to wrap an instance of the (Data.Edison.Set c a)
typeclass so that the Monad instance
On Wednesday 31 January 2007 22:36, Robert Dockins wrote:
On Tuesday 30 January 2007 20:06, Bryan Donlan wrote:
If you instead want to replace your list with one of the Edison sequence
implementations, that should be possible. However, I'm not really sure
that it's going to buy you a lot.
I've fallen off the pace on this thread so this is a composite reply, mainly
to Bjorn, Brad and Yitzchak...
I would also like to express my gratitude for the work that Bjorn, and all the
others involved, have done on the http library. I certainly appreciated
having it available for use.
I
On Sunday 28 January 2007 09:14, Neil Mitchell wrote:
Hi Alistair,
Is there a simple way to get the contents of a webpage using Haskell on
a Windows box?
This isn't exactly what you want, but it gets you partway there. Not
sure if LineBuffering or NoBuffering is the best option. Line
On Sunday 28 January 2007 10:53, Neil Mitchell wrote:
Thanks, it certainly gets more things, but has a nasty habit of taking
a very long time in Hugs on certain URLs:
research.microsoft.com/,
Looks like IIS is waiting until it receives a Connection header, a bit of a
variation from spec I
On Saturday 23 December 2006 14:21, Stefan O'Rear wrote:
On Fri, Dec 22, 2006 at 08:05:08PM -0500, Steve Downey wrote:
Although terse, the subject really says it all.
If i've a partial function, like a parser, what is considered good
style for a library. The tradeoffs that I can see are
On Saturday 16 December 2006 15:08, Aditya Siram wrote:
Hi all,
I am trying to install Hare but I cannot build it. GHC complains that
package lang is not found. Here is the output:
[snip]
ghc-6.6: unknown package: lang
I think that what use to be provided by lang is now part of ghc 6.6's
On Tuesday 12 December 2006 08:57, Nicola Paolucci wrote:
- How do I know - or how does the interpreter know - that the m of
this example is an instance of type ((-) e) ?
- Is it always like that for liftM2 ? Or is it like that only because
I used the function (-) ?
It's the snd that forces
On Thursday 07 December 2006 09:44, S. Alexander Jacobson wrote:
I guess I'm also not sure what belongs in a GADT and what belongs in a
typeclass e.g. here is an Arrow GADT
data Arrow b c where
Arr::(b-c) - Arrow b c
Compose::Arrow b c - Arrow c d - Arrow b d
First::Arrow
On Tuesday 28 November 2006 20:50, Alexis Hazell wrote:
let contact = mkelem stream:stream [ sattr xmlns:stream
http://etherx.jabber.org/streams;, sattr xmlns jabber:client, sattr
to livejournal.com ] [] :: ArrowXml a = a XmlTree XmlTree
And got:
interactive:1:14:
On Saturday 18 November 2006 00:37, Neil Mitchell wrote:
Hi
How controversial would a proposal to {-# DEPRECATE fromJust #-} be, in
favour of:
Just _ = x -- which will give you the precise line number
It seems to me this is one cause of mysterious newbie errors we
could
Hi.
I've just installed GHC 6.6 on an amd64 running a gentoo linux distribution.
With GHCi from 6.4.2 I could run ghci then do
Prelude :l Foo/Bar.hs
by hitting tab after Foo to complete the path to Bar.hs
This no longer works, hitting tab only shows what's in the pwd.
If I run ghci
On Wednesday 08 November 2006 05:41, DavidA wrote:
To get the result you want, take the list of (letter, probability) pairs,
and generate the Cartesian product of k copies of itself.
cartProd 0 xs = [[]]
cartProd k xs = [x:ys | x - xs, ys - cartProd (k-1) xs]
The result is all sequences of
On Wednesday 08 November 2006 08:23, Daniel McAllansmith wrote:
Ahhh, whoops. It seems that lack of compilation errors is not a universal
sign that a haskell program is correct.
permute 0 d = mkD []
mkD doesn't allow distributions with 0 sum probabilities, so you'd need to
restrict
Apologies if this is a duplicate, the original appears to have gone astray.
On Wednesday 01 November 2006 10:57, Albert Lai wrote:
Daniel McAllansmith [EMAIL PROTECTED] writes:
Hello.
I have some html from which I want to extract records.
Each record is represented within a number of tr
On Wednesday 01 November 2006 10:57, Albert Lai wrote:
Daniel McAllansmith [EMAIL PROTECTED] writes:
Hello.
I have some html from which I want to extract records.
Each record is represented within a number of tr nodes, and all records
tr nodes are contained by the same parent node
On Monday 30 October 2006 22:18, Einar Karttunen wrote:
On 29.10 19:56, John Meacham wrote:
Since DrIFT can only understand haskell source code, it can't derive
instances for anything you don't have the original source to.
Ahhh, ok.
such as
things in the pre-compiled libraries that
Hello.
I have some html from which I want to extract records.
Each record is represented within a number of tr nodes, and all records tr
nodes are contained by the same parent node.
The things I've tried so far end up giving me the cartesian product of record
fields, so for the html fragment
Hi.
I'm trying to derive some instances using DrIFT, but it will only work for me
when I'm deriving for types in the current file or in the prelude.
For example,
this works:
module Test where
{-! for Maybe derive : Haskell2Xml !-}
this works:
module Test where
data Foo = Foo
{-! for Foo
Hello,
I have a graph of function applications which I would like to 'compile' into
an Arrow, specifically the SF Arrow from Yampa.
I'd appreciate any advice on how I might go about this.
The graphs, of which there will be many, will be constructed at runtime and
will be executed for
On Wednesday 12 July 2006 21:11, Henning Thielemann wrote:
On Wed, 12 Jul 2006, Daniel McAllansmith wrote:
Hello.
I'm currently using Data.Graph.Inductive to represent a directed graph.
I want to detect all cycles within the graph and 'break' them by
inserting a minimal number
Hello.
I'm currently using Data.Graph.Inductive to represent a directed graph.
I want to detect all cycles within the graph and 'break' them by inserting a
minimal number of nodes that are labelled with a special cycle-breaker label.
Can anyone give me advice on a good algorithm for finding
On Wednesday 31 May 2006 11:32, George Beshers wrote:
Well, my thesis (many moons ago I assure you) was on syntax
directed editors. I came to the conclusion that letting the user
do what they want is a requirement, but that heuristics and
other smarts were to be avoided on the grounds that at
On Wednesday 17 May 2006 19:55, [EMAIL PROTECTED] wrote:
Daniel McAllansmith wrote:
I'm trying to control the scope within which functions can be used by
putting them in a type class. Unfortunately I can't seem to figure
out how to get it done. Any advice would be much appreciated
On Wednesday 12 April 2006 02:09, David F. Place wrote:
If you'd like to give it a whirl on your fancy modern computers,
Averages of user time for three runs on an Athlon64 running 64bit linux:
kern0.29700
ones32 0.30733
table32 0.37333
table 0.38400
I ran a whole lot more of kern and
On Thursday 13 April 2006 08:55, David F. Place wrote:
On Apr 12, 2006, at 3:30 PM, Daniel McAllansmith wrote:
Averages of user time for three runs on an Athlon64 running 64bit
linux:
kern0.29700
ones32 0.30733
table32 0.37333
table 0.38400
I ran a whole
On Wednesday 12 April 2006 22:52, Graham Klyne wrote:
I'm interested, but I don't have the time to look right now (or in the next
couple of months, as far as I can see).
What would really interest me is a system that can provide the
functionality of the Python packages I currently use
Following is a message I sent yesterday, sans attachment. Looks like the code
was too bloated to get through under the list size limit.
As I say in the original message , I'm keen for any feedback. So let me know
if anyone wants the actual code (20 KB, compressed) to have a look through.
On Monday 03 April 2006 08:09, David Menendez wrote:
If you look at it in terms of folds over pairs,
cata () (x,y) = x y -- corresponds to uncurry
ana f g x = (f x, g x) -- corresponds to ()
Then you can de-forest:
hylo () f g x = f x g x
-- hylo () f g == cata
On Tuesday 28 March 2006 07:29, Andrew Pimlott wrote:
MonadError is not up to this task as far as I can tell.
Why not? All that needs to be done is write the missing instances, eg
instance MonadError () Maybe where
throwError x = Nothing
Nothing `catchError` f =
On Wednesday 29 March 2006 09:49, Andrew Pimlott wrote:
If you want to write a MonadError operation that can be used with Maybe
or Either, it would look like
f :: (MonadError e m, Error e) = Bool - m Int
f b = if b
then return 42
else throwError (strMsg The boolean
Hi, folks.
I've got a working class and instances thereof. I would now like to change
the class such that error behaviour is specified by MonadError, for the
moment throwing String errors. When I try to add MonadError into the types I
eventually hit the requirement for
On Tuesday 28 March 2006 11:12, Daniel McAllansmith wrote:
Hi, folks.
I've got a working class and instances thereof. I would now like to change
the class such that error behaviour is specified by MonadError, for the
moment throwing String errors. When I try to add MonadError into the types
On Friday 24 March 2006 14:37, you wrote:
An additive torsor is?
Surprisingly, there is a page on MathWorld about Torsors but it is
empty. Google turned up the following page with a good explanation.
http://math.ucr.edu/home/baez/torsors.html
Nice clear explanation that. Thanks for the
On Friday 24 March 2006 16:16, Ben Rudiak-Gould wrote:
Daniel McAllansmith wrote:
I can see the domain bounds check would be a problem in theory, but in
practice doesn't the type enforce that? Keeping Word positive costs
nothing because it just overflows. Wouldn't it be much the same
On Friday 24 March 2006 23:29, Malcolm Wallace wrote:
Daniel McAllansmith [EMAIL PROTECTED] wrote:
Unless I've missed it, there is no typeclass for positive integers in
GHC. Is there any particular reason it doesn't exist?
Also, it seems Word would be a far better type in the likes
On Friday 24 March 2006 16:42, Cale Gibbard wrote:
Excellent help thanks, Cale.
A lot of my misunderstandings stemmed from not finding any 'instance
MonadState ReaderT' when reading the code in Reader.hs, not realising that
there was an instance defined in State.hs, and yet being able to use
Is there a consensus on how anticipatable failure situations should be
handled?
There was a thread, haskell programming guidelines, from 2006-02-25 where
John Meacham and Cale Gibbard had a bit of back-and-forth about using
Monad.fail or a purpose specific MonadFail class.
I believe a
Hi, I've got a few (9) random questions, mainly about monads and building
monads from existing monads, partly trying to confirm conclusions I've come
to through experimentation.
Any, and all, attempts to enlighten me will be much appreciated.
Thanks
Daniel
First, terminology. In
StateT s
Unless I've missed it, there is no typeclass for positive integers in GHC.
Is there any particular reason it doesn't exist?
Also, it seems Word would be a far better type in the likes of (!!), length,
etc. Is it just tradition that resulted in the use of Int?
Daniel
On Friday 24 March 2006 13:14, Aaron Denney wrote:
On 2006-03-24, Daniel McAllansmith [EMAIL PROTECTED] wrote:
Unless I've missed it, there is no typeclass for positive integers in
GHC. Is there any particular reason it doesn't exist?
The number of useable operations is small, and checks
Hi
I've been having a look at zippers over homogenous tree data types, and was
wondering how best to represent a heterogeneous graph for manipulation with a
zipper.
The main example of zippers I've been looking at is
http://okmij.org/ftp/Computation/Continuations.html#zipper-fs
and
! :)
Thanks
Daniel
On Friday 17 February 2006 19:18, Daniel McAllansmith wrote:
Hello,
I have a recursive type
data Foo = A | B [Foo] | C [Foo]
that I would like to restrict so that a C can only contain Bs, and a B can
only contain As.
If I use a GADT as follows the bar function, understandably
Hello,
I have a recursive type
data Foo = A | B [Foo] | C [Foo]
that I would like to restrict so that a C can only contain Bs, and a B can
only contain As.
If I use a GADT as follows the bar function, understandably, will not type
check.
data AType
data BType
data CType
data Foo a
On Tuesday 31 January 2006 16:32, Andrew Pimlott wrote:
On Tue, Jan 31, 2006 at 03:00:41PM +1300, Daniel wrote:
I've got some functions in MonadError with different Error types. I
would like to map errors of one Error type onto the other Error type.
It seems that the only facility for
79 matches
Mail list logo
