@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
--
Ozgur Akgun
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
between
these approaches is whether you want to have an open or a closed family of
types.
Tillmann
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
--
Ozgur Akgun
add,
I want to use this *disjunction of constructors* thingy in data type
declerations as well.
A little bit brainstorming maybe?
Thanks in advance,
--
Ozgur Akgun
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman
Thank you all very much for the pointers.
Best,
On 22 March 2010 09:32, Gleb Alexeyev gleb.alex...@gmail.com wrote:
Ozgur Akgun wrote:
Is there any way to limit a functions type, not by a data type but by a
group of constructors of a data type? If not, what would be the *right*
thing to do
Can a user define a derivable type class of her own? If yes, how?
Cheers,
--
Ozgur Akgun
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
of bracketings and orderings but no luck...
Best,
--
Ozgur Akgun
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Thanks for the pointers again - you are of great help every time!
On 23 March 2010 17:44, Josef Svenningsson josef.svennings...@gmail.comwrote:
On Tue, Mar 23, 2010 at 11:52 AM, Ozgur Akgun ozgurak...@gmail.com
wrote:
Can a user define a derivable type class of her own? If yes, how?
GHC
Thank you very much - and for the quick response as well!
I tried putting a comma in between them, but no luck. What was I thinking?
:)
On 24 March 2010 17:25, Stephen Tetley stephen.tet...@gmail.com wrote:
Hi Ozgur - try
data Binary' = forall a b. Binary' a b
--
Ozgur Akgun
at 6:31 PM, Ozgur Akgun ozgurak...@gmail.com wrote:
What was I thinking?
A sensible thought if you asked me.
It's certainly a surprise to me that this isn't allowed. Because in
any other context binders, like lambdas and foralls, may be freely
nested. For example:
{-# LANGUAGE RankNTypes
. (not that haskelly way of doing
things, I know.)
Any suggestions better than the following are very welcome:
(==) = (==) `on` show
Regards,
--
Ozgur Akgun
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman
4 == Baz 5
False
ghci Baz 4 == Baz 'a'
False
On 25 March 2010 15:07, Ozgur Akgun ozgurak...@gmail.com wrote:
Dear Cafe,
I need to use a language feature which is explicitly documented to be a
restriction, and -even worse- I think I reasonably need to use it.
f2 (Baz1 a b) (Baz1 p
'
Nothing - False
ghci Baz 4 == Baz 4
True
ghci Baz 4 == Baz 5
False
ghci Baz 4 == Baz 'a'
False
On 25 March 2010 15:07, Ozgur Akgun ozgurak...@gmail.com wrote:
Dear Cafe,
I need to use a language feature which is explicitly documented to be a
restriction, and -even worse- I think I
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
--
Ozgur Akgun
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
]
If this is a design choice, I think it should explicitly be stated.
Regards,
[1] http://hackage.haskell.org/package/hmatrix-glpk
[2]
http://hackage.haskell.org/packages/archive/hmatrix-glpk/0.1.0/doc/html/Numeric-LinearProgramming.html#t%3ABound
--
Ozgur Akgun
are right, the operators are misleading. I will change them to :=:
and :=:. And perhaps the symbol :: for the interval bound should also
be improved...
Thanks for your suggestion!
Alberto
Ozgur Akgun wrote:
Hi everyone and Alberto,
Numeric.LinearProgramming[1] provides a very nice interface
/mailman/listinfo/haskell-cafe
--
Ozgur Akgun
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
- Simulation ()
unfortunately, now you cannot use pattern matching while defining
moveVehicle.
...
Jason
--
Ozgur Akgun
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
(catching the error from
func1)? Is it the only way?
Best,
--
Ozgur Akgun
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Miljenovic
ivan.miljeno...@gmail.com wrote:
Why not use Maybe for func1 in the first place? Or are you wanting to
automagically make all uses of head, tail, etc. safe?
In which case there is already the 'safe' package:
http://hackage.haskell.org/package/safe
--
Ozgur Akgun
Cafe,
How can I provide a Data instance for a GADT? I am trying to TH on it, and
Uniplate requires Data.
I tried StandaloneDeriving, but it seems not to work.
Best,
--
Ozgur Akgun
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http
answering to myself: I guess this is related:
http://hackage.haskell.org/trac/ghc/ticket/3497
On 14 April 2010 10:13, Ozgur Akgun ozgurak...@gmail.com wrote:
Cafe,
How can I provide a Data instance for a GADT? I am trying to TH on it, and
Uniplate requires Data.
I tried StandaloneDeriving
Seeing this old thread[1], I hope something happened towards enabling this.
Does anybody know the current status about using TH on GADTs?
[1]
http://www.haskell.org/pipermail/template-haskell/2006-August/000567.html
On 14 April 2010 10:32, Ozgur Akgun ozgurak...@gmail.com wrote:
answering
.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
--
Ozgur Akgun
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
simple lack this feature?
Best,
--
Ozgur Akgun
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
So, how can we make use of this fix?
On 26 April 2010 19:47, David Waern david.wa...@gmail.com wrote:
2010/4/26 Daniel Fischer daniel.is.fisc...@web.de:
Am Montag 26 April 2010 18:15:02 schrieb Ozgur Akgun:
Hi all,
If I have the following data type:
data Expr = Num Int | Expr
, Ivan Miljenovic ivan.miljeno...@gmail.com wrote:
On 27 April 2010 02:15, Ozgur Akgun ozgurak...@gmail.com wrote:
data Expr = Num Int | Expr :+: Expr | Expr :-: Expr
[snip]
-- | If the input is 'Num' does magic, if it is ':+:' does even more
magic!
someFunc :: Expr - Expr
.
Exactly. For the former
cabal install --reinstall --enable-library-profiling uniplate
should do the trick.
To avoid having to manually install profiling versions of libraries in the
future you can enable profiling support in your ~/.cabal file.
-- Johan
--
Ozgur Akgun
?
Thanks,
Tim
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
--
Ozgur Akgun
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http
or not:
sample (arbitrary :: Gen (Maybe Double, Maybe Double) )
On 5 May 2010 09:01, Ozgur Akgun ozgurak...@gmail.com wrote:
your quick check property (in a different way of writing) is the following:
prop_1 :: Maybe Double - Bool
prop_1 v = v == v
but what you want is actually the following
On 5 May 2010 11:38, Tim Docker t...@dockerz.net wrote:
On 5 May 2010 09:01, Ozgur Akgun ozgurak...@gmail.com wrote:
your quick check property (in a different way of writing) is
the following:
prop_1 :: Maybe Double - Bool
prop_1 v = v == v
I think you
path, there really is no lhs2TeX.fmt file.
Should I download it separately or something like that?
PS: Thanks for the great package to the authors!
Best,
Ozgur Akgun
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman
On 6 May 2010 01:23, Ivan Miljenovic ivan.miljeno...@gmail.com wrote:
El 05/05/2010, a las 12:42, Ozgur Akgun escribió:
OK, I've found them!
They were under /Users/username/.cabal/share/lhs2tex-1.15 and this path
was not in the search path of lhs2TeX.
I'm using Snow Leoprad
the following:
data Expr = Sum Expr Expr | Mult Expr Expr | Single Int
e = Sum (Single 2) (Mult (Single 3) (Single 4))
And it orients the tree in such a way that Mult looks like the root node,
instead of Sum, as I would expect.
Thanks,
Ozgur Akgun
process?
Best,
Ozgur
* Nothing is magic.
On 12 May 2010 12:11, Gleb Alexeyev gleb.alex...@gmail.com wrote:
Ozgur Akgun wrote:
Hi all,
I am using vacuum-opengl and vacuum-ubigraph to visualise and analyse some
of my data structures. They are quite helpful most of the time, however
Thanks! It looks better now!
PS: I actually knew about the oriented attribute, but I thought this might
be something else. Anyway..
On 13 May 2010 09:23, Gleb Alexeyev gleb.alex...@gmail.com wrote:
Ozgur Akgun wrote:
Thanks for the answer.
I see your point, that Ubigraph does some magic
, there is another wrapper for Ubigraph in Haskell,
Hubigraph[1], but it's not on hackage. (licensing issues?) Your module
contains all the basics, and should be enough in general.
[1] http://ooxo.org/hubigraph/index.html
Best,
Ozgur
On 13 May 2010 10:32, Ozgur Akgun ozgurak...@gmail.com wrote
:
Ozgur Akgun wrote:
A little bit of topic, but why is the module Graphics.Ubigraph hidden in
your package? I've been trying to use Ubigraph directly, and your module
helped me a lot. (I just patched the cabal file to expose
Graphics.Ubigraph
as well)
Is there a specific reason
://www.haskell.org/mailman/listinfo/haskell-cafe
--
Ozgur Akgun
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
@(Nil {})
--
Ozgur Akgun
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
betwen two Expr's
| Expr :2 Expr -- a different implementation of the
same thing maybe
| Expr :veryfast Expr-- and the veryfast implementation of it
(just a silly example I could think of now.)
Best,
Ozgur Akgun
___
Haskell
On 4 June 2010 12:33, Ivan Lazar Miljenovic ivan.miljeno...@gmail.comwrote:
Ozgur Akgun ozgurak...@gmail.com writes:
[...]
What stops us from allowing alphanum characters appear in the Infix
version
(after the colon)? Can't it be relaxed to only start woth a colon?
The definition. I
OK I back up. I justed wanted it to happen for a moment :)
You're right, ambiguity in parsing and a lot of whitespace-dependency are
things to avoid.
Best,
On 4 June 2010 14:25, Ketil Malde ke...@malde.org wrote:
Ozgur Akgun ozgurak...@gmail.com writes:
Then people would need to put spaces
feed them all into my problem solver
and it finds that (x*y) is right, how can I print that string?
--
Martin
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
--
Ozgur Akgun
--
Ozgur Akgun
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
or, since you don't need to give a name to the second element of the list:
f :: [a] - [a]
f (x:_:xs) = x : f xs
f x = x
On 7 June 2010 20:11, Ozgur Akgun ozgurak...@gmail.com wrote:
i think explicit recursion is quite clean?
f :: [a] - [a]
f (x:y:zs) = x : f zs
f x = x
On 7 June
])
On Monday, June 7, 2010, Ozgur Akgun ozgurak...@gmail.com wrote:
or, since you don't need to give a name to the second element of the
list:
f :: [a] - [a]
f (x:_:xs) = x : f xsf x = x
On 7 June 2010 20:11, Ozgur Akgun ozgurak...@gmail.com wrote:
i think explicit recursion
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
--
Ozgur Akgun
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman
'
Nothing - False
...or indeed:
eqTypeable x y = cast x == Just y
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
--
Ozgur Akgun
___
Haskell
://www.haskell.org/mailman/listinfo/haskell-cafe
--
Ozgur Akgun
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
-cafe
--
Ozgur Akgun
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
://www.haskell.org/mailman/listinfo/haskell-cafe
--
Ozgur Akgun
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
-cafe
--
Ozgur Akgun
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
and write a recursion with this base condition.
Any suggestions?
PS: Actually I'm a little bit uncomfortable since there may be such a
function in the library already :)
--
Ozgur Akgun
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
be such a
function in the library already :)
--
Ozgur Akgun
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
And of course thanks for all the other replies and versions.
This mailing list is *really* active!
2009/10/28 Ozgur Akgun ozgurak...@gmail.com
Even though it was nice to see how it can be implemented, I'll be using the
PS version :)
I was really close in implementing it myself.
Anyway
to accept a list of lists of arbitrary length, and produce the
required result.
I hope I managed to make my point clear enough. Waiting for suggestions.
Regards,
--
Ozgur Akgun
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http
,
I'll definitely have a look at the implementation of sequence.
Cheers!
2009/11/19 Neil Brown nc...@kent.ac.uk
Ozgur Akgun wrote:
Anyway, just forget the fact that these funstions do not do a check on the
length of the input list for a moment. My question is, how can I generalize
Hoogle gives the sequence function as its second result
for the query [[a]] - [[a]]:
Data.List transpose :: [[a]] - [[a]]
Prelude sequence :: Monad m = [m a] - m [a]
See: http://haskell.org/hoogle/?hoogle=%5B%5Ba%5D%5D+-%3E+%5B%5Ba%5D%5D
On Nov 19, 3:58 pm, Ozgur Akgun ozgurak...@gmail.com
Is there possibly a way of getting source code, given a *.hi file?
Yes you're right I deleted all my *.hs files, while trying to remove *.hi
ones!!
Desperately,
--
Ozgur Akgun
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http
system or at
least good backups.
.hi files actually do contain some code, specifically what ghc decides
can be inlined (see ghc --show-iface), but it's not the sort of code
you'd get any use from. Have a look, you'll see.
--
Svein Ove Aas
--
Ozgur Akgun
http://www.haskell.org/mailman/listinfo/haskell-cafe
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
--
Ozgur Akgun
___
Haskell-Cafe mailing
to represent functions and solved the problem. But this doesn't
seem very *cute* to me and requires some bolier-plate (if you have a lot of
this structure everywhere) , that's why I am asking for your precious
suggestions.
Best,
--
Ozgur Akgun
___
Haskell-Cafe
Sorry, no good.
I don't want to guess the first paramater, I really want to access it.
2009/11/28 Steffen Schuldenzucker sschuldenzuc...@uni-bonn.de
Ozgur Akgun wrote:
Hi cafe,
Is such a thing possible,
add :: Int - Int - Int
add x y = x + y
-- a list of partially applied
is still open though, if somebody has some magic to extract the
prameter from an applied function...
2009/11/28 Ozgur Akgun ozgurak...@gmail.com
Sorry, no good.
I don't want to guess the first paramater, I really want to access it.
2009/11/28 Steffen Schuldenzucker sschuldenzuc...@uni-bonn.de
me to the download link of this
tool; so that I can try it out.
Cheers,
--
Ozgur Akgun
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Dear Cafe,
Is there a way of splitting the definition of a module into multiple files?
Cheers,
--
Ozgur Akgun
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
, 2009 at 5:15 PM, Ozgur Akgun ozgurak...@gmail.com wrote:
Is there a way of splitting the definition of a module into multiple
files?
Let's say you have some module A which introduces 3 symbols:
module A (a, b, c) where
a = 1
b = 2
c = 3
Now we will split it in 3 modules:
module B ( b
--
Ozgur Akgun
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Sorry for the last mail, I now tried it and it returns the next value every
time I call it.
I was using an unsafeperformIO trick somewhere, and that fas the one
resulting in the previously described behaviour.
You can just ignore the previous mail.
2009/12/17 Ozgur Akgun ozgurak...@gmail.com
the building phase. The exception was:
exit: ExitFailure 1
I have zlib-0.5.0.0 installed now. The OS is Snow Leopard.
I couldn't find anything related to this error, that's why I'm asking
community's opinion.
Best,
--
Ozgur Akgun
___
Haskell-Cafe mailing list
the building phase. The exception was:
exit: ExitFailure 1
2009/12/19 Duncan Coutts duncan.cou...@googlemail.com
On Fri, 2009-12-18 at 23:01 +, Ozgur Akgun wrote:
Hi,
When I run cabal install zlib or cabal upgrade zlib I get the
following error:
Resolving dependencies
-0.5.0.0 failed during the building phase. The exception was:
exit: ExitFailure 1
2009/12/20 Duncan Coutts duncan.cou...@googlemail.com
On Sat, 2009-12-19 at 09:39 +, Ozgur Akgun wrote:
I guess the following part is the problematic part: (But I've no idea
how to resolve
That's verrry correct. Sorry for the confusion again.
Any more suggestions by the way?
2009/12/22 Tom Tobin korp...@korpios.com
On Mon, Dec 21, 2009 at 5:08 PM, Ozgur Akgun ozgurak...@gmail.com wrote:
Oh sorry for that character. I wanted to make that part underlined in
gmail
which uses
What about this part:
-o dist/build/Codec/Compression/
Zlib/Stream.hs Codec/Compression/Zlib/Stream.hsc
Isn't it passing multiple (two in this case) output parameters? Or am I
missing sth?
2009/12/22 Duncan Coutts duncan.cou...@googlemail.com
On Mon, 2009-12-21 at 23:08 +, Ozgur Akgun
, Ozgur Akgun wrote:
What about this part:
-o dist/build/Codec/Compression/
Zlib/Stream.hs Codec/Compression/Zlib/Stream.hsc
Isn't it passing multiple (two in this case) output parameters? Or am
I missing sth?
No, that's one -o flag and a single additional non-flag argument which
Oh!
I was pretty sure that I made these patches correctly. But guess what, the
added flags to hsc2hs are different from the others. And I did a bling
copy/paste.
Thanks for reminding it Gregory.
Best,
2010/1/6 Gregory Collins g...@gregorycollins.net
Ozgur Akgun ozgurak...@gmail.com writes
.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
--
Ozgur Akgun
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
is a time-honored tradition.
(D.G.)
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
--
Ozgur Akgun
___
Haskell-Cafe mailing list
Haskell-Cafe
Cafe,
I've been trying to install vacuum-cairo using cabal but I couldn't have it
installed because of the missing packages cairo, svg and gtkcairo.
What should I do to install vacuum-cairo?
Thanks for any help in advance,
--
Ozgur Akgun
glfw/lib/macosx/macosx_enable.c:1:0:
error: bad value (apple) for -mtune= switch
cabal: Error: some packages failed to install:
GLFW-0.4.1 failed during the building phase. The exception was:
exit: ExitFailure 1
Regards,
--
Ozgur Akgun
. Here is a detail description of why
prior versions of GHC fails to work:
http://hackage.haskell.org/trac/ghc/ticket/3522
I've just made a new release and bumped GLFW to 0.4.2, you may try it
with GHC 6.12 on Snow Leopard and see if it now works.
On 1/19/10, Ozgur Akgun ozgurak...@gmail.com
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
--
Ozgur Akgun
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman
`(f c)'
In the expression: NumHolder (f c)
Regards,
--
Ozgur Akgun
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
. What is the
purpose of this type?
Bob
On Fri, Jan 22, 2010 at 11:31 AM, Ozgur Akgun ozgurak...@gmail.comwrote:
Dear Cafe,
I can write and use the following,
data IntHolder = IntHolder Integer
instance Show IntHolder where
show (IntHolder n) = show n
liftInt :: (Integer
/haskell-cafe
--
Ozgur Akgun
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
library
Thanks for any help.
Best,
--
Ozgur Akgun
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
--
Ozgur Akgun
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
I, of course, do not claim that it is more efficient or better. But I don't
think it'd be rubbish :)
--
Ozgur Akgun
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Ooops I thought the inner lists are possibly of infinite size.
On 17 February 2010 17:16, Daniel Fischer daniel.is.fisc...@web.de wrote:
Am Mittwoch 17 Februar 2010 17:46:38 schrieb Ozgur Akgun:
The easiest solution is simply to define
unionAll = nub . mergeAll
where
, and it takes O(n)
time, too.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
--
Ozgur Akgun
___
Haskell-Cafe mailing list
Haskell-Cafe
://www.haskell.org/mailman/listinfo/haskell-cafe
--
Ozgur Akgun
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
://trac.haskell.org/haskell-platform/wiki/ReleaseTimetable
And you can expect 2010.2 during ZuriHac.
Thanks for checking in!
-- Don
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
--
Ozgur
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
--
Ozgur Akgun
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
mailto:m...@andres-loeh.de
http://www.andres-loeh.de
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
--
Ozgur Akgun
___
Haskell-Cafe mailing
Dear Cafe,
I wonder who is maintaining the ghc package in macports, and what the
current stategy of doing things is?
http://www.macports.org/ports.php?by=namesubstr=ghc (ghc 6.10.4)
Personally, I'd like to use the macports version, if the ghc version there
was resonably recent (having 2
sounds good to me. where can I find the list of packages (or whatever they
call them in homebrew, formula?) available?
On 12 August 2010 11:49, Benedict Eastaugh ionf...@gmail.com wrote:
On 11 August 2010 15:49, Ozgur Akgun ozgurak...@gmail.com wrote:
Personally, I'd like to use the macports
.
--
Ozgur Akgun
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
--
Ozgur Akgun
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
://www.haskell.org/mailman/listinfo/haskell-cafe
--
Ozgur Akgun
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
:
On 28 sep 2010, at 17:33, Ozgur Akgun wrote:
How do you define relationships between data types?
Well, why is it any different from other fields? From one of your
examples [1], I'd expect you to have a list of questions in the Quiz data
type, and if necessary, a quiz field in the Question data
1 - 100 of 189 matches
Mail list logo