properFraction segfaults on negative
doubles, too.
Compiled code doesn't have this defect. I'm going to try the 64 bit
version to see if it resolves this problem.
-Ron Alford
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http
termination.
-Ron Alford
ghcloop.hs
Description: Binary data
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
the
previous simplifier bug):
https://github.com/ronwalf/Planning
With GHC 7.4.[12], it exhausts all the RAM on my machine (4GB).
Compiling with -O0 fixes the problem. I can start bisecting my code
to find the problem if nothing comes to mind.
-Ron Alford
(who seems to be good at killing
-fcontext-stack)?
-Ron Alford
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
not. The only time I use funcEq in the code in question
is the instance declaration.
-Ron Alford
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
in general. This only shows
that my task isn't well suited to Haskell's current static typing.
-Ron Alford
* Note that this was my first and only real haskell project, and all
that this entails.
[1] http://en.wikipedia.org/wiki/Planning_Domain_Definition_Language
[2] http://lambda-the-ultimate.org
the whole thing against the parallel
Boost Graph Library (a C++ library), since that library provides the
abstractions that you would want. If you go this path, it will probably end up
being 10-100 times faster.
--
Best Regards,
Ron de Bruijn,
___
Haskell
with various
extensions to the language. I'm currently updating it for another
project, so if you're interested, please let me know!
-Ron
[1] http://www.cs.umd.edu/projects/planning/data/alford09translating/
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
I was getting a similar error with standalone deriving (already
attached to that bug), but I didn't try it through-out. I'll let you
know how it goes.
-Ron
On Mon, Apr 12, 2010 at 6:01 AM, Simon Peyton-Jones
simo...@microsoft.com wrote:
It's really a bug. I've fixed it in my tree, but I'm
Just for fun, I tried it on 6.12.1.20100330 with the same result.
Does anyone have a workaround? Otherwise I need to revert to 6.10.
-Ron
On Thu, Apr 8, 2010 at 10:35 AM, Ron Alford ronw...@volus.net wrote:
At Igloo's suggestion, it's now a ticket:
http://hackage.haskell.org/trac/ghc/ticket
At Igloo's suggestion, it's now a ticket:
http://hackage.haskell.org/trac/ghc/ticket/3965
-Ron
On Thu, Apr 8, 2010 at 1:39 AM, Ron Alford ronw...@volus.net wrote:
I've attached the simplest example of my code that used to compile in
GHC 6.10 now gives the error in GHC 6.12.1
(Const :+: Var))
deriving (Data, Typeable)
with:
data Domain e g = Domain
(Expr (Const))
deriving (Data, Typeable)
then everything compiles. If nothing else, the error message is misleading.
-Ron
baddata.hs
Description: Binary data
stack size (default 8M)
Egs: -K32k -K512k. ghci is just another Haskell program which uses the GHC
RTS.
Is it also possible to set this stack-size via pragma in the source code?
Via an OPTIONS_GHC pragma, if possible.
--
Best Regards,
Ron de Bruijn,
Developer, Gamr7
already, by using the
best features of both hsc2hs and c2hs, but it is hardly elegant.
I suppose the real solution would be to extend c2hs with an offsetof function
(for which patches already exist, btw), but it might be that I have missed some
other solution.
--
Best Regards,
Ron de Bruijn
(Pixel packet: ++ show red_component)
return red_component)
[0.. number_of_pixels - 1]
some_png_file = foo.png
t = do
initialize_image_library
image_file_name_to_2d_array some_png_file
initialize_image_library = initializeMagick
Best regards,
Ron de Bruijn
)
(\png -
putStrLn (show (dimensions png))
)
either_error_string_or_png
and then calling it gives:
*** Exception: (png_file_to_2d_array) failed to parse chunk IHDR, (line 1,
column 1):
unexpected 0x0
expecting valid colorType: supported Ct2,Ct6
Best regards, Ron
Hi,
A few days ago we published an article (http://gamr7.com/blog/?p=66) on
using the FFI to marshal recursive data structures between Haskell and C
(or Python if you use ctypes).
Best regards,
Ron de Bruijn
___
Haskell-Cafe mailing list
Haskell
Hi,
We have just published a small article on how one can initialize GHC
from Python, with only optional use of C. You can read it at
http://gamr7.com/blog/?p=65 .
Best regards,
Ron de Bruijn
___
Haskell-Cafe mailing list
Haskell-Cafe
I reopened the bug, since I found slight changes to the file were able
to reproduce the bug in recent versions of ghc-6.9.
I also can't get the -S compilation step to work with the new file,
unless I'm missing a step.
-Ron Alford
On Mon, Jul 21, 2008 at 3:32 AM, Ron Alford [EMAIL PROTECTED
, DerivingError.o )
/var/folders/C0/C0SledGV2RaxbU+8ZLDnVU+++TI/-Tmp-//ghc27223_0/ghc27223_0.s:6080:0:
FATAL:Symbol _XxG_srt already defined.
-Ron Alford
DerivingError.hs
Description: Binary data
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users
-//ghc27223_0/ghc27223_0.s:6080:0:
FATAL:Symbol _XxG_srt already defined.
-Ron Alford
DerivingError.hs
Description: Binary data
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Hey all,
I've reduced my previous problem to a small example. Anyone know why
typeOf (...) would work, but typeOf [...] would not? Is the
derivation for lists funky?
data Expr f = In (f (Expr f))
instance Typeable1 f = Typeable (Expr f) where
typeOf (In x) = mkTyConApp (mkTyCon
On Fri, Jul 11, 2008 at 12:50 PM, Antoine Latter [EMAIL PROTECTED] wrote:
Now we never do pattern matching on our input.
This has been pretty educational.
Mightily! I'll have to do the same trick for Expr.
Thank you very much!
-Ron
___
Haskell
,
I've attached the file. The trailing comments show what I'm trying to
accomplish (getName, setName, and so forth).
-Ron
WouterTest.hs
Description: Binary data
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman
Or, if people have easy-enough extensible records that /will/ work
with funky types, I'd be happy to use those!
-Ron
On Thu, Jul 10, 2008 at 10:29 AM, Ron Alford [EMAIL PROTECTED] wrote:
On Wed, Jul 9, 2008 at 11:01 PM, Antoine Latter [EMAIL PROTECTED] wrote:
It isn't immediately obvious
'.
-Ron
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Data.Trie.General.ListGT) [typeOf1 x]
I don't think I can use this for ':+:', because the typeOf instance
only has access to a member of one type at a time.
This may be similar to a definition of Typeable2 for Either, but I
can't find an example to follow for that.
Thanks,
-Ron
On Wed, Jul 9, 2008 at 10:40 PM
On Thu, Jul 10, 2008 at 3:18 PM, Neil Mitchell [EMAIL PROTECTED] wrote:
Hi Ron,
I'm using GHC 6.8.3 with $ cabal --version
cabal-install version 0.5.1
using version 1.4.0.1 of the Cabal library
I installed Data.Derive from hackage, only to be unable to find the
'derive' binary!
Did
values to type - ick!
-Ron Alford
On Thu, Jul 10, 2008 at 4:16 PM, Antoine Latter [EMAIL PROTECTED] wrote:
On Thu, Jul 10, 2008 at 2:15 PM, Ron Alford [EMAIL PROTECTED] wrote:
I'm making progress, but how would I make the following a Typeable instance:
data (f :+: g) e = Inl (f e) | Inr (g e
This is a bit similar to Either. Is there a way to see the generated
instance code for
deriving instance Data Either ?
On Thu, Jul 10, 2008 at 6:38 PM, Ron Alford [EMAIL PROTECTED] wrote:
Close - it compiles now! I made a minor change, going to Typeable1
instead of Typeable:
instance
deriving instance Data (Expr (Const :+: Var))
-Ron Alford
WouterTest.hs
Description: Binary data
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Any hints?
Thanks,
-Ron
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
sense, maybe it doesn't.
A side benefit:
Record access functions are reusable between record types (as long as
they have the same type).
Anyway, thanks again, Wouter!
-Ron
WouterRecords.hs
Description: Binary data
___
Haskell-Cafe mailing list
Haskell
order logic (or an extension there-of). Is this done?
Doable?
-Ron
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
and inspect with:
$ ghci -fglasgow-exts -fallow-overlapping-instances WouterTest.hs
test1 works great (other than needing some redundant typing, any hints?).
test2 needs the definition of 'Printable And' to print, but I haven't
gotten that to work yet. It also needs the redundant typing.
-Ron
, it could be that this is just an ugly way to represent things
(it does require a huge number of constructors). Any suggestions?
-Ron
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
2007/1/14, Kirsten Chevalier [EMAIL PROTECTED]:
[redirecting to ghc-users]
On 1/13/07, Ron [EMAIL PROTECTED] wrote:
Dear,
I made a profile[1] of a test program:
Where can I find documentation for the meaning of everything mentioned
below? Or alternatively, can anyone explain them?
Where
Dear,
I made a profile[1] of a test program:
Where can I find documentation for the meaning of everything mentioned
below? Or alternatively, can anyone explain them?
Where can I see the effect of using the -xt option in this profile?
Ron
[1]
/Main +RTS -p -s -xt -hc
1,372,408,024 bytes
the question is: how do I tell ghc to find OpenAL?
Regards, Ron
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
,
but then there wasn't a real solution. Now, 3 years
later, I can imagine there's *something*.
What's that *something*?
Regards,
Ron
__
Do you Yahoo!?
New and Improved Yahoo! Mail - Send 10MB messages!
http://promotions.yahoo.com/new_mail
, with various information, etc., is available
at:
http://www.isi.edu/~hdaume/haskell/NewBinary/
Hmmm, I'm not sure if that is what Ron asked for.
What I guess is needed is
support for things like:
read the next 4 bytes as a low-endian unsigned
integer
read the next 8 bytes
--- Tomasz Zielonka [EMAIL PROTECTED]
wrote:
On Thu, Sep 02, 2004 at 08:47:51AM -0700, Ron de
Bruijn wrote:
I heard of the +RTS option. I used:
ghci SomeModule.hs -someoptions +RTS -K150,
but
this doesn't seem to have any effect.
Try +RTS -K150M.
-K150 means 150 bytes
but you still have to explicitly add the relation via
Obj (and that's bad).
Regards, Ron
P.S. If it already exist in this exact way, how is it
called?
___
Do you Yahoo!?
Express yourself with Y! Messenger! Free. Download now.
http
of the fptools
successfully?
Regards,
Ron
__
Do you Yahoo!?
New and Improved Yahoo! Mail - Send 10MB messages!
http://promotions.yahoo.com/new_mail
___
Haskell-Cafe mailing list
[EMAIL PROTECTED]
http
}_\mathcal{C}= mu o (eta o T)
I also don't understand why I can't create the
following law out of the assocaitive law:
(mu o T) == (T o mu)
, bacause the first part of the expression is the
same.
Please, enlighten me :)
Regards, Ron
__
Do you
is just a name for an operation that
is defined or not defined for each mathematical
construction in terms of to which laws the operation
should comply. The laws are then things like
communativity and so on.
Regards, Ron
__
Do You Yahoo!?
Tired of spam
--- Iavor S. Diatchki [EMAIL PROTECTED] wrote:
hi ron,
here are the relations between the two formulations
of monads:
(using haskell notation)
map f m = m = (return . f)
join m = m = id
m = f = join (fmap f m)
there are quite a few general concepts that you need
you can give
some feedback on the above.
Ragards, Ron
P.S. The question about multiplication still stands.
Probably multiplication is a set of laws defined on a
mathematical object that must hold. And for each
mathematical object there is such definition. Is this
correct
I am pretty sure, that = is to monads what * is to
for example natural numbers, but I don't know what the
inverse of = is. And I can't really find it anywhere
on the web(papers, websites, not a single sole does
mention it.
It should have type, at least that's what I think:
inv::M a-M b
I say
me (with a lot of detail) how
this works?
Regards,
Ron
__
Do You Yahoo!?
Tired of spam? Yahoo! Mail has the best spam protection around
http://mail.yahoo.com
___
Haskell-Cafe mailing list
[EMAIL
or functional language (not to far off when
compared to Haskell), a clear pseudo-code description,
either written by yourself or a URL to a webpage/paper
with that information would also be very welcome.
Thanks in advance,
Ron de Bruijn
P.S. This is really offtopic, but I would like to hear
some opinions
available, so I thought: Let's ask, and
don't reinvent the wheel.
Greets Ron
P.S. Thanks to those who answered my previous
question, although I have found another way of
expressing my problem.
__
Do you Yahoo!?
Yahoo! Finance: Get your refund fast by filing
) [1..], but this
next-function is almost identical to what the
built-in listcomprehension does.
I just don't like my solution.
Then I can probably use Template Haskell(which I have
never used), but that seems overkill.
So does anyone has a better solution?
Greets Ron
the same way?
Greets Ron
__
Do you Yahoo!?
SBC Yahoo! DSL - Now only $29.95 per month!
http://sbc.yahoo.com
___
Haskell-Cafe mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell-cafe
of some subject O(1)), so it would do.
I am almost sure there exist some nice way of doing
this, because otherwise Haskell would be completely
useless IMHO, but I don't know it.
Do you have any idea?
Greets Ron
__
Do you Yahoo!?
SBC Yahoo! DSL - Now only $29.95
Jón Fairbairn wrote (to the Haskell mailing list):
pi1_3 or proj1_3 or select_1_3 or sel_1_3, even s_1_3 -- omitting the
"_" means sel is ambiguous (!). We should choose a scheme that can
cope with such things even if they are unlikely.
I don't think pi_m_n looks right unless you
Fergus Henderson wrote (to the Haskell Mailing List):
[..]
But it is difficult to track the ongoing discussion, because
- the interface is slowww (they don't call it the "World Wide Wait"
for nothing)
I tried it yesterday and had no complaints about the performance.
- it is
Carl R. Witty wrote (to the Haskell mailing list):
[..]
The Report could give up and say that column numbers in the
presence of \u escapes are explicitly implementation-defined.
[..]
[This] sounds pretty bad (effectively prohibiting layout in portable
programs using Unicode
Marnix Klooster wrote (to the Haskell Mailing List):
(1) a `type' declaration introduces a new type + two anonymous
coercions;
[...]
(4) if an expression is of type A when type B is expected, and a
coercion function is defined of type A - B, then it is
automatically inserted
Lennart Augustsson wrote:
It looks ugly, but we could say that a data declaration does not
have to have any constructors:
data Empty =
Philip Wadler responded:
I'm not keen on the syntax you propose. How about if we allow the
rhs of a data declaration to be just `empty', where
REMINDER - REMINDER - REMINDER - REMINDER - REMINDER - REMINDER - REMINDER
CALL FOR PARTICIPATION
The First International Symposium
on
Functional Programming Languages
in
Education
61 matches
Mail list logo
