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
On Wed, May 5, 2010 at 12:10 PM, Neal Alexander relapse@gmx.com wrote:
- Goal Oriented Behaviors (work in progress)
- Goal Oriented Planning (work in progress)
I have a library for PDDL parsing and representation[1] that I used in
a recent paper. It's heavy complex types to deal with
I don't think
it'll bite too man people
There's a good workaround: use standalone deriving.
You
| -Original Message-
| From: glasgow-haskell-users-boun...@haskell.org [mailto:glasgow-haskell-
| users-boun...@haskell.org] On Behalf Of Ron Alford
| Sent: 10 April 2010 22:33
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
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:
baddata.hs:33:14:
No instances for (Data Const, Data Var)
arising from the 'deriving' clause of a data type declaration
at baddata.hs:33:14-17
Possible
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
___
On Wed, Jul 9, 2008 at 11:01 PM, Antoine Latter [EMAIL PROTECTED] wrote:
It isn't immediately obvious to me that the Typeable family of
classes deal at all with higher-kinded type constructors, but I didn't
look that hard.
Yes, that's what I'm worried about. For people's fun and amusement,
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
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!
Trying it directly from darcs, I get:
$ ghc --make Setup.hs
[1 of 1] Compiling Main (
, Ron Alford [EMAIL PROTECTED] wrote:
Well, my extension of Wouter's datatypes proved to be unweildy
So, I'm trying to use
http://fmapfixreturn.wordpress.com/2008/05/03/simple-extensible-records-now-quick-generic-tricks-pt-1/
for extensible records.
I ran across my first problem rather quickly
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
Well, my extension of Wouter's datatypes proved to be unweildy
So, I'm trying to use
http://fmapfixreturn.wordpress.com/2008/05/03/simple-extensible-records-now-quick-generic-tricks-pt-1/
for extensible records.
I ran across my first problem rather quickly!
data Expr f = In (f (Expr f))
Ok,
Having made over-use of Wouter's expression idioms, I decided to hack
it into extensible records.
It's not documented, it's probably got holes in its usability, but I
thought I'd post it so people can play with it (and give suggestions
before I rewrite my code to use it!).
I know there are other
I'm trying to wrap my head around the theoretical aspects of haskell's
type system. Is there a discussion of the topic separate from the
language itself?
Since I come from a rather logic-y background, I have this
(far-fetched) hope that there is a translation from haskell's type
syntax to first
Here's something that should be an easy extension of Wouter's approach
to extensible datatypes, but I'm failing (possibly since it's 2:20am).
I several classes of expressions I'm trying to represent (thus,
Wouter's approach), and my first operation to implement over them is
printing.
Attached
Here's the setup:
I have a series of problems that use various logical connectives. The
problem is that they're not all the same. So instead of creating one
giant datatype (or duplicating much code), I'd like to assemble them
like toy blocks.
I've boiled down an example here:
data
29 matches
Mail list logo
