Hi.
I'm pleased to announce my new little library, data-dword[1]. It
provides Template Haskell utilities for defining binary word data types
from low and high halves, e.g.
data Word96 = Word96 Word32 Word64 -- strictness is configurable
data Int96 = Int96 Int32 Word64
-- All instances are
On 08/10/2012 20:11, Mikhail Glushenkov wrote:
Hello,
It's a relatively well-known fact that GHC allows for multiple type
class instances for the same type to coexist in a single program. This
can be used, for example, to construct values of the type Data.Set.Set
that violate the data structure
Hello All,
License of term of CloudHaskell[1]. It isn't GNU GPL
public license. I not sure to include it's to my project. Who know MPI
write by haskell pure and not dependent on C/C++ wrapper such as
Haskell-mpi[2]? I need to idea for implement OpenMPI standard by Haskell
On 11 October 2012 21:47, Chatsiri Ratana insider...@gmail.com wrote:
Hello All,
License of term of CloudHaskell[1]. It isn't GNU GPL
public license. I not sure to include it's to my project. Who know MPI
write by haskell pure and not dependent on C/C++ wrapper such as
On Thu, 11 Oct 2012, Mikhail Vorozhtsov wrote:
I'm pleased to announce my new little library, data-dword[1]. It provides
Template Haskell utilities for defining binary word data types from low and
high halves, e.g.
data Word96 = Word96 Word32 Word64 -- strictness is configurable
data Int96
On 10/11/2012 06:09 PM, Henning Thielemann wrote:
On Thu, 11 Oct 2012, Mikhail Vorozhtsov wrote:
I'm pleased to announce my new little library, data-dword[1]. It
provides Template Haskell utilities for defining binary word data
types from low and high halves, e.g.
data Word96 = Word96 Word32
On Thu, Oct 11, 2012 at 5:57 PM, Ivan Lazar Miljenovic
ivan.miljeno...@gmail.com wrote:
On 11 October 2012 21:47, Chatsiri Ratana insider...@gmail.com wrote:
Hello All,
License of term of CloudHaskell[1]. It isn't GNU GPL
public license. I not sure to include it's to
Hello Simon,
On Thu, Oct 11, 2012 at 11:24 AM, Simon Marlow marlo...@gmail.com wrote:
On 08/10/2012 20:11, Mikhail Glushenkov wrote:
I couldn't find anything on the interplay between orphan instances and
Safe Haskell both in the Haskell'12 paper and online. Is this
something that the authors
On Oct 11, 2012, at 5:30 PM, Mikhail Glushenkov the.dead.shall.r...@gmail.com
wrote:
Hello Simon,
On Thu, Oct 11, 2012 at 11:24 AM, Simon Marlow marlo...@gmail.com wrote:
On 08/10/2012 20:11, Mikhail Glushenkov wrote:
I couldn't find anything on the interplay between orphan instances and
Hello,
On Thu, Oct 11, 2012 at 3:54 PM, MigMit miguelim...@yandex.ru wrote:
You have a bigger problem coming. Some extensions make multiple instances OK,
even in Safe Haskell. For example:
{-# LANGUAGE FlexibleInstances, IncoherentInstances, Safe #-}
[...]
Safe Haskell already disallows
On Oct 11, 2012, at 6:23 PM, Mikhail Glushenkov the.dead.shall.r...@gmail.com
wrote:
Hello,
On Thu, Oct 11, 2012 at 3:54 PM, MigMit miguelim...@yandex.ru wrote:
You have a bigger problem coming. Some extensions make multiple instances
OK, even in Safe Haskell. For example:
{-#
Hello,
On Thu, Oct 11, 2012 at 4:33 PM, MigMit miguelim...@yandex.ru wrote:
On Oct 11, 2012, at 6:23 PM, Mikhail Glushenkov
the.dead.shall.r...@gmail.com wrote:
On Thu, Oct 11, 2012 at 3:54 PM, MigMit miguelim...@yandex.ru wrote:
You have a bigger problem coming. Some extensions make
Karamaan Group, a principal investment firm based in Manhattan is looking for
an outstanding software developer to develop tools for financial analysis and
knowledge management.
Candidates should have at least a bachelor's degree in computer science and a
good sense of coding style. This is a
Hi Roman,
On Tue, Oct 9, 2012 at 12:11 PM, Roman Cheplyaka r...@ro-che.info wrote:
I am reading through Oleg's Eliminating translucent existentials[1].
[1]:
http://okmij.org/ftp/Computation/Existentials.html#eliminating-translucent
He draws a distinction between
forall a . [a] - [a]
I hate to admit it, but it seems to me now that one would need dependent types
to guarantee Set's good behavior (so that the dictionary for the Ord instance
is contained within the Set type).
Отправлено с iPhone
Oct 11, 2012, в 18:42, Mikhail Glushenkov the.dead.shall.r...@gmail.com
Hi Mark,
Thank you for the clarification.
I think, then, that we should indeed provide a link to a notice about
native libraries - like, if you're using native libraries, make sure
their architecture is 32-bit or universal as well; in case of
MacPorts you can achieve this by doing port install
[Sorry if you have already seen / heard this already, this really is the
last announcement...]
After 3 years away the London Haskell User Group is back. Our first
meeting is in a couple of weeks.
Wednesday 24-Oct-2012 6-30pm
City University, College Building, St John Street, London. EC1V
On 10/10/2012 01:20 AM, Carter Schonwald wrote:
you should probably file a ticket on the DanBurton repo if he's the one
doing the uploading
:-)
Yep, and he was nice enough to merge the fix and release a new version:
http://hackage.haskell.org/package/numbers-3000.1.0.0
18 matches
Mail list logo
