Albert Y. C. Lai tre...@vex.net writes:
On 11-06-04 02:20 AM, Roman Cheplyaka wrote:
It is, for my taste, a good comment marker, because of its resemblance
to a dash. It makes the code look like real text:
let y = x + 1 -- increment x
COBOL is real text, if that is what you want.
MOVE
Hi,
I have uploaded a module to hackage in the package hmatrix-repa.
It provides conversion functions between hmatrix vectors/matrices and repa
arrays. I don't know whether it will be of much use, but even the Repa
documentation suggests using LAPACK for performance critical tasks, such as
I think there are two reasons to browse the hackage database.
First reason reflects the common need to find a library that suites one's
needs. In this case it's very easy to find it with google adding hackage
haskell to the submitted word list.
Second reason is to have a nice landscape of
Are the following two functions equivalent? (i.e. do they describe the
same computation)
let add1 a = a + 2
let add2 = \ a - a + 2
:t add1
add1 :: forall a. (Num a) = a - a
:t add2
add2 :: forall a. (Num a) = a - a
Does Haskell interpreter convert all functions in the form of add1 to
the
On 05/06/2011 06:55 AM, Evan Laforge wrote:
I don't think a hierarchy would have helped in this case, but tags
would be appropriate. Actually, I wound up using the categories like
tags. I think we just need better search, e.g. +tag +tag or
something.
+1 to all of the above.
Also, I don't
Well, yes add1 and add2 are equivalent. You can use either one or the other.
The type annotation can be read:
for all type 'a' such as 'a' is an instance of class Num, there exists a
function add1 that takes an 'a' and returns an 'a'.
2011/6/5 Patrick Browne patrick.bro...@dit.ie
Are the
-- Forwarded message --
From: 吴兴博 wux...@gmail.com
Date: 2011/6/5
Subject: Abnormal behaviors when Using ghci
To: cvs-...@haskell.org
1) I'm using Haskell platform 2011.2 on windows (7). Every several
days, ghci will crash with no messages. even when I'm just typing with
text
On 5/06/2011, at 13:12, 吴兴博 wux...@gmail.com wrote:
1) I'm using Haskell platform 2011.2 on windows (7). Every several
days, ghci will crash with no messages. even when I'm just typing with
text buffer, without an 'enter'. I got nothing after the crash, not
even an exception code, don't even
On 6 May 2011 15:19, Hakim Cassimally hakim.cassima...@gmail.com wrote:
If anyone's in Northwest UK on Tuesday 31st May, why not come to
Geekup's first ever Functional Programming Night?
http://lanyrd.com/2011/geekup-liverpool-may/
Just to let you know that the Haskell talk now has slides
Yes, this is expected. 'throwErr' is only meant to be used when the error
should be non-recoverable, and the stream would often be invalid then, so
throwErr doesn't take any steps to preserve it. You could retain the rest
of the stream with getChunk and use throwRecoverableErr though.
Wrapping
Do you have a single sign-on application installed (possibly TAM ESSO)?
Weird though it sounds, we have experience of this Windows app randomly
killing other processes, such that they just disappear with no apparent cause.
No, I never used this app(TAM ESSO), and ghci just kill itself,
On 04/06/2011 08:25 PM, Tom Hawkins wrote:
What is the easiest way to generate polygon meshes from constructive
solid geometry? Marching cubes [4] seems pretty involved.
As I understand it, this is a Very Hard Problem. This is (one of the
reasons) why there are so few converters from
The dtd-text package[1] provides a parser for XML DTDs. It implements
most of the parts of the W3C XML specification relating to DTDs,
and is compatible with versions 1.0 and 1.1 of the specification.[2]
The result of the parse is a Haskell DTD object from the
dtd-types[3] package. This first
The dtd-types[1] package provides types for processing
XML DTDs in Haskell. These types are intended to be
compatible with and extend the set of types provided by
John Millikin's xml-types package[2].
This version, 0.3.0.1, was released in support of the dtd-text
package[3]. It includes some
On Sun, Jun 5, 2011 at 19:13, Yitzchak Gale g...@sefer.org wrote:
I really should have edited the Cabal description of this package
before I uploaded it. It promises an attoparsec-text parser
and blaze-builder renderer for DTDs. First of all, the renderer
is vaporware - I haven't written it
the algorithms in the CGAL library might be a good starting point in terms
of looking into other algorithmic approaches
http://www.cgal.org/
it has a excellent set of references for its component parts
On Sun, Jun 5, 2011 at 11:41 AM, Andrew Coppin
andrewcop...@btinternet.comwrote:
On
On Sun, Jun 5, 2011 at 07:45, Patrick Browne patrick.bro...@dit.ie wrote:
Are the following two functions equivalent? (i.e. do they describe the
same computation)
let add1 a = a + 2
let add2 = \ a - a + 2
Mostly. The monomorphism restriction can cause Haskell to restrict
the type of the
On Sun, Jun 5, 2011 at 07:51, Andrew Coppin andrewcop...@btinternet.com wrote:
Also, I don't think listing every package on all of Hackage in one giant
page is very useful any more. (I gather it was only meant to be a temporary
interface in the first place...)
+1 (really +(foldl' (+) (repeat
I wrote:
I was thinking of even lower level: allocating a moderate chunk of
memory and writing the results directly into it consecutively as a
special case.
Bryan O'Sullivan wrote:
Surely that would save only one copy compared to creating a list of results
and then concatenating them, no?
On Sun, Jun 5, 2011 at 10:41 AM, Andrew Coppin
andrewcop...@btinternet.com wrote:
On 04/06/2011 08:25 PM, Tom Hawkins wrote:
What is the easiest way to generate polygon meshes from constructive
solid geometry? Marching cubes [4] seems pretty involved.
As I understand it, this is a Very Hard
On Sun, Jun 5, 2011 at 1:36 PM, Brandon Allbery allber...@gmail.com wrote:
On Sun, Jun 5, 2011 at 07:51, Andrew Coppin andrewcop...@btinternet.com
wrote:
Also, I don't think listing every package on all of Hackage in one giant
page is very useful any more. (I gather it was only meant to be
2011/6/5 Tom Hawkins tomahawk...@gmail.com:
On Sun, Jun 5, 2011 at 10:41 AM, Andrew Coppin
andrewcop...@btinternet.com wrote:
On 04/06/2011 08:25 PM, Tom Hawkins wrote:
What is the easiest way to generate polygon meshes from constructive
solid geometry? Marching cubes [4] seems pretty
But you don't need Xcode 4, do you? The Xcode 3 that comes with
the install DVD will work fine!
I'm still looking for the install DVD that my wife has carefully put
aside for safe keeping. All-in-all, casual use of Haskell seems
much easier on Linux and Windows.
John
If new intermediate classes crop up then there would be no point in fixing
class (Applicative m) = Monad m where
since it would have to be changed if new intermediate classes are found.
I realize non-existence proofs are hard.
--
--
Regards,
KC
___
$5 for XCode is annoying, but apparently Apple had to start charging
for it because of Sarbanes-Oxley and the way they set up their
generally accepted accounting principles.
G
On Sun, Jun 5, 2011 at 9:25 PM, John D. Ramsdell ramsde...@gmail.com wrote:
But you don't need Xcode 4, do you? The
On Sun, 2011-06-05 at 21:58 +0200, Gregory Collins wrote:
$5 for XCode is annoying, but apparently Apple had to start charging
for it because of Sarbanes-Oxley and the way they set up their
generally accepted accounting principles.
That's interesting... whatever the reason, though, I concur
I'm trying to install the Haskell Platform on a Mac and I've already
installed Xcode 3.2.6 but the platform says that the tools are not
installed. Do I need to reboot?
--
--
Regards,
KC
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
Never mind.
I didn't realize there were two steps:
- clicking on the dmg file
- then actualling installing the software
On Sun, Jun 5, 2011 at 1:20 PM, KC kc1...@gmail.com wrote:
I'm trying to install the Haskell Platform on a Mac and I've already
installed Xcode 3.2.6 but the platform says
On 5 June 2011 20:20, Vo Minh Thu not...@gmail.com wrote:
One thing that would be neat for you, but I have no idea if it exists,
would be to turn directly the CSG models to 2d vector graphics.
I don't know if it is CSG, but in the TeX world there is Gene
Ressler's 3D modelling program Sketch
As I understand it, this is a Very Hard Problem. This is (one of the
reasons) why there are so few converters from POV-Ray to mesh-based formats;
it's highly non-trivial to tesselate CSG.
POV-Ray is pretty fast. I had contemplated just rendering a bunch of
POV-Ray images to emulate a realtime
--
--
Regards,
KC
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Answers cached on stackoverlow:
http://stackoverflow.com/questions/5612201/haskell-library-for-2d-drawing/5613788#5613788
for 2D graphics.
http://stackoverflow.com/questions/2860988/haskell-ui-framework
for UIs.
Cheers,
Don
On Sun, Jun 5, 2011 at 8:18 PM, KC kc1...@gmail.com wrote:
--
Quoth Chris Smith cdsm...@gmail.com,
That's interesting... whatever the reason, though, I concur that using
Haskell seems much easier on Linux and Windows. I had to abandon a plan
to introduce Haskell in a class I taught this past semester because of
issues with getting it installed on the
Quoth KC kc1...@gmail.com,
... Xcode3.2.6, Haskell Platform 2011.2.0.1
What are 2or 3 ways so far to get a GUI graphics?
http://www.haskell.org/haskellwiki/Using_Haskell_in_an_Xcode_Cocoa_project
... if you don't mind that there will be some Objective C involved.
I have written only a very
On Sun, 2011-06-05 at 17:35 -0700, Donn Cave wrote:
Exactly. If you don't use MacOS, let alone develop on it, I guess
it's possible that this looks like an formidable obstacle, but then
wouldn't that pose some limits to how much you're going to be able
to enjoy GHC anyway?
Well, I explained
While working on a project of mine recently I realized that a particular HUnit
test should have been failing. After paring things down, I came up with this
shocker:
test_perhaps.hs:
module Main where
import Test.HUnit
main = runTestTT $ TestList [ True ~=? True
On 6/5/11 1:33 PM, Brandon Allbery wrote:
On Sun, Jun 5, 2011 at 07:45, Patrick Brownepatrick.bro...@dit.ie wrote:
Are the following two functions equivalent? (i.e. do they describe the
same computation)
let add1 a = a + 2
let add2 = \ a - a + 2
Mostly. The monomorphism restriction can
On 6/06/2011 3:58 AM, Tom Hawkins wrote:
Another goal of the project is to generate 2D prints from 3D models.
Any idea how hard is this going to be? Basically it needs to identify
features (holes, edges, etc), then project these features to an
orthographic plane, alone with associated
On 06/06/2011, at 5:51 , KC wrote:
If new intermediate classes crop up then there would be no point in fixing
class (Applicative m) = Monad m where
since it would have to be changed if new intermediate classes are found.
I realize non-existence proofs are hard.
Not as hard as
According to the haskell-prime wiki[1], -XUndecidableInstances removes
checks on the form of instance declaration, and just impose a depth
limit to ensure termination (of compilation, I assume?). The listed
Con is that this removes the clear boundary between legal and illegal
programs, and
On Mon, Jun 6, 2011 at 00:26, Scott Lawrence byt...@gmail.com wrote:
According to the haskell-prime wiki[1], -XUndecidableInstances removes
checks on the form of instance declaration, and just impose a depth
limit to ensure termination (of compilation, I assume?). The listed
Con is that this
Scott Lawrence wrote:
More specifically, I have
class Model m a | m - a where ...
class Entropy d where ...
instance (Model m a) = Entropy m where ...
The first line requires MultiParamTypeClasses and
FunctionalDependencies... the third
requires UndecidableInstances...
Is this likely
42 matches
Mail list logo
