On 28/09/2009, at 7:38 AM, Peter Verswyvelen wrote:
That's not really true. Just use CAL from the Open Quark
framework... It's almost Haskell 98, with some extras, and compiles
to fast JVM code.
http://openquark.org/Open_Quark/Welcome.html
They even seem to do all kinds of advanced
2009/9/28 Casey Hawthorne cas...@istar.ca:
On Mon, 28 Sep 2009 12:06:47 +1300, you wrote:
On Sep 28, 2009, at 9:40 AM, Olex P wrote:
Hi,
Yes, I mean sizeOf 2. It's useful not only on GPUs but also in
normal software. Think of huge data sets in computer graphics
(particle clouds,
Hello Curt,
Sunday, September 27, 2009, 8:16:53 PM, you wrote:
http://www.starling-software.com/en/blog/drafts/2009/09/27.succ-java-summary.html
what are the types of balance and interest in balance * interest
expression? ;)
--
Best regards,
Bulat
On 2009-09-28 11:13 +0400 (Mon), Bulat Ziganshin wrote:
http://www.starling-software.com/en/blog/drafts/2009/09/27.succ-java-summary.html
what are the types of balance and interest in balance * interest
expression? ;)
I dunno, but I think it's not really relevant to the point of the
Ross Mellgren wrote:
What about the built-in Float type?
Prelude Foreign.Storable sizeOf (undefined :: Float)
4
Prelude Foreign.Storable sizeOf (undefined :: Double)
8
While we're on the subject... I understand that certain FPUs support
80-bit precision. Is there any way to get at that? Or
wren ng thornton wrote:
Another nice
thing this suggests is the ability to use underscore as a pattern for
when you know the compiler will infer the type but it's too complex to
want to write out (e.g. while experimenting).
I'd love this!
M.
___
Martijn van Steenbergen wrote:
wren ng thornton wrote:
Another nice
thing this suggests is the ability to use underscore as a pattern for
when you know the compiler will infer the type but it's too complex
to want to write out (e.g. while experimenting).
I'd love this!
F# has this and I
Hello Martijn,
Monday, September 28, 2009, 1:42:10 PM, you wrote:
Another nice
thing this suggests is the ability to use underscore as a pattern for
when you know the compiler will infer the type but it's too complex to
want to write out (e.g. while experimenting).
in case you not seen
JSONb is a ByteString parser for JSON, yielding a simple JSON
type composed of Rationals, ByteString tries and strict
ByteStrings.
http://hackage.haskell.org/package/json-b-0.0.2
An example application program, `json-schema`, is provided. It
derives schema for JSON input. When
Bulat Ziganshin wrote:
in case you not seen this and may be interested:
http://okmij.org/ftp/Haskell/types.html#partial-sigs
Yes, I know there are workarounds (and I use them sometimes). It'd be
nice if there was direct support for them. :-)
Thanks,
Martijn.
wren ng thornton wrote:
Andrew Coppin wrote:
While we're on the subject... I understand that certain FPUs support
80-bit precision. Is there any way to get at that? Or is this going
to require FFI too?
Perhaps you want Foreign.C.Types.CLDouble ?
-- Forwarded message --
From: selahaddin gerdan selahattin.ger...@gmail.com
Date: 2009/9/28
Subject: Re: [Haskell-cafe] frag game-compiling error
To: Lyndon Maydwell maydw...@gmail.com
Sorry I'm just learning haskell, so I don't get your suggestion. Could you
explain to me what
On Mon, Sep 28, 2009 at 01:57:03PM +0300, selahaddin gerdan wrote:
Sorry I'm just learning haskell, so I don't get your suggestion. Could you
explain to me what exactly I have to do?
According to
On Mon, Sep 28, 2009 at 5:52 AM, Andrew Coppin
andrewcop...@btinternet.com wrote:
wren ng thornton wrote:
Andrew Coppin wrote:
While we're on the subject... I understand that certain FPUs support
80-bit precision. Is there any way to get at that? Or is this going to
require FFI too?
2009/9/28 Ben Franksen ben.frank...@online.de:
To expose an impure function (!) in an API, I don't know... I mean, couldn't
one just wrap the value like this
data Attributed a -- opaque
(=) :: a - Attrib - Attributed a
mode :: Data a = Attributed a - Mode a
and thus retain a purely
src/Quaternion.hs:22:27
This would probably be the place to start.
On Mon, Sep 28, 2009 at 7:28 PM, Felipe Lessa felipe.le...@gmail.com wrote:
On Mon, Sep 28, 2009 at 01:57:03PM +0300, selahaddin gerdan wrote:
Sorry I'm just learning haskell, so I don't get your suggestion. Could you
explain
In the last months, I made the experience it seems difficult to find
commercial Haskell developer teams to take responsibility for projects
in the range of $ 10.000 - 100.000. The Industrial Haskell Group does
not seem to be the appropriate place for this, while harvesting Haskell
team at
Interop between Haskell and Java is too difficult to be practical. And
I stand by my statement that no Java shop is going to switch over to
Haskell, precisely because they cannot afford to abandon either their
existing investment, or the _billions of dollars_ worth of commercial-
friendly
CAL is interesting, but unfortunately dead, and has no community.
Regards,
John A. De Goes
N-Brain, Inc.
The Evolution of Collaboration
http://www.n-brain.net|877-376-2724 x 101
On Sep 27, 2009, at 3:38 PM, Peter Verswyvelen wrote:
That's not really true. Just use CAL from the Open
Hi,
I am looking for an unicode strings library, I found on hackage:
http://hackage.haskell.org/package/compact-string
http://hackage.haskell.org/package/text
They both look solid and functionally complete so ... I don't know which
one to use :-)
As I am sure I am not the first one facing
It's very difficult to find information on:
1. How many Haskell developers are out there;
2. What a typical salary is for a Haskell developer;
3. Whether or not the skills of a typical Haskell developer scale to
large applications (most Haskell developers are hobby Haskellers and
have only
On 2009-09-28 07:01 -0600 (Mon), John A. De Goes wrote:
And I stand by my statement that no Java shop is going to switch over
to Haskell
I have counterexamples. So pt!
...or the _billions of dollars_ worth of commercial-
friendly open source libraries available for the Java
If you have counterexamples, then perhaps you can name them. I'm
looking for Java shops with 5+ developers and code bases of 100k
converting over to Haskell. I don't know _any such shop_ that has
switched to Haskell, and I doubt any exist, but I'd be delighted to
learn I'm wrong.
Let
Hi, I haven't seen that paper.
I certainly agree with their point that Haskell easily allows to
separate the code of the search and pruning algorithms from the code
of the search-space etc.
It seems that my package and their paper focus on different
algorithms. They mostly focus on pruning
John A. De Goes wrote:
If you have counterexamples, then perhaps you can name them. I'm looking
for Java shops with 5+ developers and code bases of 100k converting
over to Haskell. I don't know _any such shop_ that has switched to
Haskell, and I doubt any exist, but I'd be delighted to
From: haskell-cafe-boun...@haskell.org
[mailto:haskell-cafe-boun...@haskell.org] On Behalf Of Edward
Middleton
If you have counterexamples, then perhaps you can name
them. I'm looking
for Java shops with 5+ developers and code bases of 100k
converting
over to Haskell. I don't
After a few more investigations, I can say
QuickCheck does:
- make easy to finding couter-cases and refactoring codes
- make easy to test some functions if they have good mathematical properties
- generate random test cases
But QuickCheck does *not*:
- help us to find good properties
So what I
Hello Edward,
Monday, September 28, 2009, 6:26:12 PM, you wrote:
If you have counterexamples, then perhaps you can name them. I'm looking
for Java shops with 5+ developers and code bases of 100k converting
over to Haskell. I don't know _any such shop_ that has switched to
Haskell, and I
On Mon, Sep 28, 2009 at 10:59 AM, Yusaku Hashimoto nonow...@gmail.com wrote:
After a few more investigations, I can say
QuickCheck does:
- make easy to finding couter-cases and refactoring codes
- make easy to test some functions if they have good mathematical properties
- generate random test
Not sure this is what you want, but I thought I'd mention Formal
Specifications for Free:
http://www.erlang.org/euc/08/1005Hughes2.pdf
(I wasn't able to find a better link. That talk is for Erlang, but
people are working on this for Haskell QuickCheck.)
/ Emil
Yusaku Hashimoto skrev:
Lyndon Maydwell wrote:
src/Quaternion.hs:22:27
This would probably be the place to start.
Ok,I managed to get past the error like this:
newMatrix ColumnMajor [realToFrac r00,realToFrac r01,realToFrac
r02,realToFrac r03,
realToFrac r10,realToFrac
titto:
Hi,
I am looking for an unicode strings library, I found on hackage:
http://hackage.haskell.org/package/compact-string
http://hackage.haskell.org/package/text
They both look solid and functionally complete so ... I don't know which
one to use :-)
As I am sure I am not the
That's a really shame. Any idea why?
On Mon, Sep 28, 2009 at 3:02 PM, John A. De Goes j...@n-brain.net wrote:
CAL is interesting, but unfortunately dead, and has no community.
Regards,
John A. De Goes
N-Brain, Inc.
The Evolution of Collaboration
http://www.n-brain.net|
tittoassini:
2009/9/28 Don Stewart d...@galois.com:
titto:
Hi,
I am looking for an unicode strings library, I found on hackage:
http://hackage.haskell.org/package/compact-string
http://hackage.haskell.org/package/text
They both look solid and functionally complete so ... I
On Mon, Sep 28, 2009 at 6:15 PM, Don Stewart d...@galois.com wrote:
tittoassini:
2009/9/28 Don Stewart d...@galois.com:
titto:
Hi,
I am looking for an unicode strings library, I found on hackage:
http://hackage.haskell.org/package/compact-string
On Sun, 2009-09-27 at 21:06 +0100, John Millikin wrote:
According to http://www.haskell.org/haskellwiki/Literate_programming,
the following should compile properly because the second block of code
will be ignored by GHC:
\begin{code}
main = putStrLn Hello world!
\end{code}
\begin{code}%
On Mon, 2009-09-28 at 23:59 +0900, Yusaku Hashimoto wrote:
After a few more investigations, I can say
QuickCheck does:
- make easy to finding couter-cases and refactoring codes
- make easy to test some functions if they have good mathematical properties
- generate random test cases
But
On Mon, 2009-09-28 at 14:16 +0100, Titto Assini wrote:
Hi,
I am looking for an unicode strings library, I found on hackage:
http://hackage.haskell.org/package/compact-string
http://hackage.haskell.org/package/text
They both look solid and functionally complete so ... I don't know
Fantastic.
If I understand correctly it inductively derives equations that hold
for a set of examples.
I am looking forward to see it in Haskell, who is working on the port?
titto
2009/9/28 Emil Axelsson e...@chalmers.se:
Not sure this is what you want, but I thought I'd mention Formal
Ok, my last post on this for real this time.
On 2009-09-28 08:13 -0600 (Mon), John A. De Goes wrote:
Let me ask you this question: how long would it take you to get an
HTML/CSS, W3 compliant browser in Haskell?
A long time. On the other hand, by grabbing a copy of Mozilla, I'll have
one far
2009/09/28 John A. De Goes j...@n-brain.net:
Libraries are _everything_...
Not exactly. Python would never have gotten a foothold over
Perl, nor Java over C, if cleaner language semantics weren't
enough for some shops or certain applications.
--
Jason Dusek
I think they made a mistake choosing a syntax so close to Haskell:
1. It's close enough to Haskell to attract Haskellers;
2. It's far enough away from Haskell to push Haskellers away;
3. It's not the language one would design if one were prioritizing
easy interop with Java in
On Mon, 2009-09-28 at 18:32 +0200, Johan Tibell wrote:
On Mon, Sep 28, 2009 at 6:15 PM, Don Stewart d...@galois.com wrote:
tittoassini:
2009/9/28 Don Stewart d...@galois.com:
titto:
Hi,
I am looking for an unicode strings library, I found on hackage:
On Sep 28, 2009, at 12:21 , Duncan Coutts wrote:
On Sun, 2009-09-27 at 21:06 +0100, John Millikin wrote:
According to http://www.haskell.org/haskellwiki/
Literate_programming,
the following should compile properly because the second block of
code
will be ignored by GHC:
\begin{code}
main =
Hi,
Does anyone know where there are any Haskell implementations of the the
River Crossing puzzle (AKA Farmer/Fox/Goose/Grain).
There are several variations but the general ideas are explained at:
http://en.wikipedia.org/wiki/River_crossing_puzzle
Pasqualino Titto Assini skrev:
Fantastic.
If I understand correctly it inductively derives equations that hold
for a set of examples.
AFAIU, it enumerates a set of terms and uses random testing to
approximate an equivalence relation for these. The real trick,
apparently, is in filtering out
In that case, I'll update my code and the wiki to use an alternative code style.
On Mon, Sep 28, 2009 at 09:21, Duncan Coutts
duncan.cou...@googlemail.com wrote:
Your local Cabal version is older than the one Hackage is using and that
older version lets haddock (ie ghc) do the pre-processing
Yusaku Hashimoto wrote:
So what I want to know is how to find good properties. Please let me
know how do you find QuickCheck properties. There are so many
tutorials or papers for using QuickCheck, but when I try to apply them
to my programming, I often miss properties in my codes.
Dijkstra
On Sat, 26 Sep 2009, Michael Mossey wrote:
I have a combinatorial search problem that requires a
running lower bound to be tracked in order to prune the search. I have enough
Haskell experience to know how to do a combinatorial search, for example with
list compresions or the list monad, but I
Ben Franksen wrote:
If it turns out that a
precise spec is unwieldy (too complex) then this is a hint that maybe it is
not a good abstraction.
Or your specification language is insufficient to describe it...
(I don't know about anybody else, but I find that when I use QC, about
75% of the
Hi,
Excuse me if that is out of subject here, but does anyone know which
tool/writing framework was used to write the Real world Haskell book
?
I'm wondering, in particular, about the capability to
write/edit/publish it online while allowing people to leave comments,
then have a paperback/PDF
On Sun, 27 Sep 2009, Olex P wrote:
Hi guys,
Do we have anything like half precision floats in Haskell? Maybe in some non
standard
libraries? Or I have to use FFI + OpenEXR library to achieve this?
If you only want to save storage, you may define
newtype Float16 = Float16 Int16
and write
Dear all,
The following is a (I'm afraid too large!) fragment of a program
implementing a GADT-based generic zipper:
**
data Zipper path where
Zipper :: hole - Context (Up (left, hole, right) up) - Zipper
(Up (left, hole, right) up)
data
On Sep 28, 2009, at 17:56 , João Paulo wrote:
GADT pattern match in non-rigid context for `LeftCons'
Solution: add a type signature
In the pattern: LeftCons l' h_down[marked with #
in the code]
The suggestion is quite clear :D (in fact, I think this compiler
On Mon, Sep 28, 2009 at 9:15 AM, Don Stewart d...@galois.com wrote:
tittoassini:
2009/9/28 Don Stewart d...@galois.com:
titto:
Hi,
I am looking for an unicode strings library, I found on hackage:
http://hackage.haskell.org/package/compact-string
On Mon, Sep 28, 2009 at 3:00 PM, Alexander Dunlap
alexander.dun...@gmail.com wrote:
I just have a question out of curiosity - why was the decision made to
have Data.Text, uvector, and ByteString all separate data structures,
rather than defining the string types in terms of uvector?
On Mon, Sep 28, 2009 at 3:28 PM, Andrew Coppin
andrewcop...@btinternet.com wrote:
Ben Franksen wrote:
If it turns out that a
precise spec is unwieldy (too complex) then this is a hint that maybe it
is
not a good abstraction.
Or your specification language is insufficient to describe it...
Hi Bryan and others,
On Mon, Sep 28, 2009 at 5:29 PM, Bryan O'Sullivan b...@serpentine.com wrote:
bytestring predates the other two libraries by several years. The underlying
stream type for uvector and text are almost the same, so they could in
principle be merged. There's a fair amount of
pat browne wrote:
Hi,
Does anyone know where there are any Haskell implementations of the the
River Crossing puzzle (AKA Farmer/Fox/Goose/Grain).
I wrote some code to generate a map of some version of the game:
https://code.goto10.org/svn/maximus/2009/boatman/BoatMan.hs
ghc -O2 --make
I'm not really hip to the culture here so this is just an observation, but some
of the recent questions posted to this list (and beginn...@haskell.org) look a
lot like someone's homework. Is anyone here concerned about avoiding giving the
full answer, or maybe it's really none of our business
On 29/09/2009, at 1:59 AM, Peter Verswyvelen wrote:
That's a really shame. Any idea why?
On Mon, Sep 28, 2009 at 3:02 PM, John A. De Goes j...@n-brain.net
wrote:
CAL is interesting, but unfortunately dead, and has no community.
I think Haskell users would miss too many of the post 98
I think the consensus is Help, not do when it comes to homework
(esp. on -beginners). At least, thats what I try to do. I've always
got the sense that that is what the community expects.
On Sep 28, 2009, at 7:40 PM, Michael P Mossey wrote:
I'm not really hip to the culture here so this is
I think the consensus is Help, not do when it comes to homework (esp. on
-beginners). At least, thats what I try to do. I've always got the sense
that that is what the community expects.
Yep, there's a whole policy on this.
http://www.haskell.org/haskellwiki/Homework_help
TomMD
Am Dienstag 29 September 2009 01:40:02 schrieb Michael P Mossey:
I'm not really hip to the culture here so this is just an observation, but
some of the recent questions posted to this list (and
beginn...@haskell.org) look a lot like someone's homework. Is anyone here
concerned about avoiding
I'm not really hip to the culture here so this is just an
observation, but some of the recent questions posted to this
list (and beginn...@haskell.org) look a lot like someone's
homework.
Well, if homework looks like homework, the teacher is guilty
of cheating.
Best,
Maurício
If you do a student's homework, you are cheating that student out of
an education.
He/She may realize that t late in the future.
--
Regards,
Casey
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
I think a language needs the following to exist:
- a community
- good library
- a package manager
Thoughts?
--
Regards,
Casey
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
I think one must distinguish what it means for a language to exist and
be practical. Counter-example: Java fails catastrophically at all
three and it most certainly exists; boy do I know it.
Casey Hawthorne wrote:
I think a language needs the following to exist:
- a community
- good library
On Tue, 29 Sep 2009 12:25:30 +1000, you wrote:
I think one must distinguish what it means for a language to exist and
be practical. Counter-example: Java fails catastrophically at all
three and it most certainly exists; boy do I know it.
QOTM!
Casey Hawthorne wrote:
I think a language needs
Good libraries are not enough for a language to go beyond mere existence.
There must exist good documents, i.e., good tutorials, good books, and good
explanations and examples in the libraries, etc, that are easy for people to
learn and use. In my humble opinion, Haskell has a lot of libraries,
On Mon, 28 Sep 2009 21:50:14 -0500, you wrote:
Good libraries are not enough for a language to go beyond mere existence.
There must exist good documents, i.e., good tutorials, good books, and good
explanations and examples in the libraries, etc, that are easy for people to
learn and use. In my
On Sun, Sep 27, 2009 at 3:50 PM, Paul Moore p.f.mo...@gmail.com wrote:
The problem is that I have *no idea* how to begin debugging this.
I've had great success debugging a large program by loading the Main
module into ghci after setting GHC extensions, changing the search
path, and setting
On Mon, 28 Sep 2009 21:50:14 -0500, you wrote:
Good libraries are not enough for a language to go beyond mere existence.
There must exist good documents, i.e., good tutorials, good books, and good
explanations and examples in the libraries, etc, that are easy for people to
learn and use. In my
A Cook Book is good but relies on people specifically working on it. I think
most of the package authors submit their packages because they themselves
need the modules in his real world.
I think package authors adding examples in the Descriptions section is a
good start when they submit their
On Mon, Sep 28, 2009 at 11:11 PM, Hong Yang hyang...@gmail.com wrote:
[...]
Maybe later on we can add an Example section to Description, Synopsis, and
Documentation sections produced by Haddock.
Also, having a section for comments is helpful. This is the case especially
when there are several
brad.larsen:
On Mon, Sep 28, 2009 at 11:11 PM, Hong Yang hyang...@gmail.com wrote:
[...]
Maybe later on we can add an Example section to Description, Synopsis, and
Documentation sections produced by Haddock.
Also, having a section for comments is helpful. This is the case especially
Michael Mossey m...@alumni.caltech.edu wrote in article
3942.75.50.175.130.1253997756.squir...@mail.alumni.caltech.edu in
gmane.comp.lang.haskell.cafe:
The problem is to determine how closely the groups can be brought together
without any boxes intersection.
The basic algorithm is to
On 2009-09-28 22:53 -0400 (Mon), John D. Ramsdell wrote:
I've had great success debugging a large program by loading the Main
module into ghci after setting GHC extensions, changing the search
path, and setting break on errors. If you then place calls to the
error function at the right
Hi Chung-chieh,
When you ask for a pair of boxes, How closely can they be brought together
without intersection? that provides a lower bound on the question How
closely can the groups be brought together? (I.e. for that pair of boxes,
bring them any closer and they intersect, so it is a lower
Curt Sampson wrote:
I've been hearing that having lots of libraries is an insurmountable
advantage, and you're doomed if you give them up, since long before I
took up Haskell. It's mostly myth promulgated by people driven by fear.
I'm sure it's the case in some shops that they have lots of
If there's an Example section, it might actually be a good idea to
include it on the package's hackage page, too.
From a usability point of view, CPAN is much more helpful than the
relatively spartan hackage description - if you're looking for a
particular set of functionality, being able to
Hi,
In other weak-type language, `round i == i` would work. But in
haskell, what should I do? Thanks.
--
竹密岂妨流水过
山高哪阻野云飞
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
82 matches
Mail list logo
