Hi all,
Haskell, is arguably the best example of a design-by-committee language.
The syntax is clean and most importantly, consistent. The essence of a
purely functional programming is maintained, without disturbing its real
world capacity.
To all the people who revise the Haskell standard,
On Mon, Jun 10, 2013 at 05:41:05PM +0530, Zed Becker wrote:
Haskell, is arguably the best example of a design-by-committee language.
You do realize that design-by-committee is generally understood to
refer to the antipattern where a committee discusses a design to death
and delivers an
On Mon, Jun 10, 2013 at 05:41:05PM +0530, Zed Becker wrote:
Haskell, is arguably the best example of a design-by-committee language.
The syntax is clean and most importantly, consistent. The essence of a
purely functional programming is maintained, without disturbing its real
world capacity.
Zed,
while I don't disagree regarding the clean and consistent syntax of
Haskell, do you realize that some people would argue that camels are horses
designed by committee too? :)
While designing by committee guarantees agreement across a large number of
people, it does not always ensure
Hm...
Haskell was /developed/ by teams, but we had BEFORE: hope, miranda, ML
... The heritage is quite important.
And individuals (say, Mark Jones) contributed to Haskell constructs. So,
the /design/ is not entirely committe based
1.
Promise to me, and the
It really sounds rude, to demand promises from somebody who just gave you a big
present.
Отправлено с iPhone
10.06.2013, в 16:11, Zed Becker zed.bec...@gmail.com написал(а):
Hi all,
Haskell, is arguably the best example of a design-by-committee language. The
syntax is clean and most
On Mon, Jun 10, 2013 at 05:44:26PM +0400, MigMit wrote:
It really sounds rude, to demand promises from somebody who just gave you a
big present.
Without wishing to preempt Zed Becker, I interpreted his email as an
expression of delight at how well Haskell has been designed and of hope that
it
I have ever wondered how a committee could have made Haskell.
My conclusion is the following:
For one side there were many mathematicians involved, the authors of the
most terse language(s) existent: the math notation.
For the other, the lemma avoid success at all costs which kept the
On 11/06/2013, at 1:58 AM, Alberto G. Corona wrote:
I have ever wondered how a committee could have made Haskell.
A committee made Algol 60, described as an improvement on most
of its successors. A committee maintains Scheme.
On the other hand, an individual gave us Perl.
And an individual
Hi Ertugrul,
Thank you for the detailed reply. From what you wrote, partial FFI still
seems like the way to go.
Unfortunately Ogre isn't the only large library I'm using, so difficult
several times over sounds like a good way to handicap the project early on.
I'm perfectly happy to use Haskell
buildPair =
do
arr - newArray ((1,1),(1,10)) 37 :: ST s (STArray s (Int,Int) Int)
a - readArray arr (1,1)
writeArray arr (1,1) 64
b - readArray arr (1,1)
return (a,b)
main = print $ runST buildPair
--
--
Regards,
KC
___
a
href=http://dreadscottart.com/mynewwebsite/wp-content/plugins/extended-comment-options/02efpk.html;
http://dreadscottart.com/mynewwebsite/wp-content/plugins/extended-comment-options/02efpk.html/a___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Hello,
I'm trying to figure out how to handle versioning of my IntervalMap
package. I've just read the package versioning policy:
http://www.haskell.org/haskellwiki/Package_versioning_policy
I don't quite understand all the recommendations in the above document,
though:
a) You are not allowed
On Thu, Jan 5, 2012 at 10:54 AM, Christoph Breitkopf
chbreitk...@googlemail.com wrote:
Hello,
I'm trying to figure out how to handle versioning of my IntervalMap
package. I've just read the package versioning
policy: http://www.haskell.org/haskellwiki/Package_versioning_policy
I don't quite
Hello,
I get this error when I try to derive an instance of the Show typeclass:
Abc.hs:21:60:Couldn't match expected type `Vector' with actual type
`[Point]'In the first argument of `show'', namely `xs'In the second
argument of `(++)', namely `show' xs'In the second argument of
On Mon, Nov 28, 2011 at 4:12 PM, Willem Obbens dub...@hotmail.com wrote:
Hello,
I get this error when I try to derive an instance of the Show typeclass:
Abc.hs:21:60:
Couldn't match expected type `Vector' with actual type `[Point]'
In the first argument of `show'', namely `xs'
In
On Mon, Nov 28, 2011 at 04:20:54PM -0600, Antoine Latter wrote:
On Mon, Nov 28, 2011 at 4:12 PM, Willem Obbens dub...@hotmail.com wrote:
Hello,
I get this error when I try to derive an instance of the Show typeclass:
Abc.hs:21:60:
Couldn't match expected type `Vector' with actual type
).This
was actually more or less a test question as I'm new to haskell-cafe, but I
hope people who will read this message will learn from my mistake.
Thank you.
From: aslat...@gmail.com
Date: Mon, 28 Nov 2011 16:20:54 -0600
Subject: Re: [Haskell-cafe] (no subject)
To: dub...@hotmail.com
CC: haskell-cafe
On Mon, Nov 28, 2011 at 23:55, Willem O dub...@hotmail.com wrote:
And I added this function:
createPoint :: Int - Point
createPoint x = Point x
When I loaded the file containing all this into ghci and executed 'Vector $
map createPoint [1..5]' the result was '(1, 2, 3, 4, 5)' (without the
http://elikat.com/blogs/wp-content/plugins/index1.php
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On Sat, 2011-07-30 at 15:07 -0700, KC wrote:
A language that runs on the JVM or .NET has the advantage of Oracle
Microsoft making those layers more parallelizable.
On top of the answers you've got regarding whether this exists, let me
warn you against making assumptions like the above. There
Suppose I have two terms s and t of type a and b respectively,
and I want to write a function that returns s applied to t if a is
an arrow type of form b - c, and nothing otherwise. How do i
convince the compiler to accept the functional application only in
the correct instance?
Thanks,
Ian,
This requires dynamic typing using Data.Dynamic (for application) and
Data.Typeable (to do the typing). Namely, you are asking for the
dynApply function:
START CODE
import Data.Dynamic
import Data.Typeable
import Control.Monad
maybeApp :: (Typeable a, Typeable b, Typeable c) = a - b
http://maipenarai.com/lindex02.html
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
I'm sorry, somehow my e-mail account got kidnapped. The link is a virus and
should NOT be opened. I apologise for any inconvenience.
Fernando Henrique Sanches
2011/6/13 Fernando Henrique Sanches fernandohsanc...@gmail.com
___
Haskell-Cafe mailing
As you my friend I invite you to visit my own site first!.
http://prospero.ch/friends_links.php?uGIS=45ru4
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
This is another proof-layout question, this time from Bird 1.4.7.
We're asked to define the functions curry2 and uncurry2 for currying and
uncurrying functions with two arguments. Simple enough:
curry2 :: ((a, b) - c) - (a - (b - c))curry2 f x y = f
(x, y)
uncurry2
On Wed, May 19, 2010 at 01:37:49PM +, R J wrote:
This is another proof-layout question, this time from Bird 1.4.7.
We're asked to define the functions curry2 and uncurry2 for currying and
uncurrying functions with two arguments. Simple enough:
curry2 :: ((a, b) - c) - (a -
*
*
*
*
*
*
* More
o BigCharts
o Virtual Stock Exchange
o FiLife.com
o WSJ Asia
o WSJ Europe
o WSJ Portuguese
o WSJ Spanish
o WSJ Chinese
o WSJ Japanese
o WSJ Radio
Jake McArthur wrote:
staafmeister wrote:
Yes I know but there are a lot of problems requiring O(1) array updates
so then you are stuck with IO again
Or use ST. Or use IntMap (which is O(log n), but n is going to max out
on the integer size for your architecture, so it's really just O(32) or
There are also the judy arrays
http://hackage.haskell.org/package/HsJudy
http://hackage.haskell.org/package/judy
dons recently advertised the latter as being 2x faster than IntMap,
but I don't know in what respect these two packages differ and why Don
decided to create 'judy' despite the
At Thu, 15 Oct 2009 10:15:46 +0400,
Eugene Kirpichov wrote:
but I don't know in what respect these two packages differ and why Don
decided to create 'judy' despite the existence of HsJudy.
HsJudy doesn't compile against the latest judy library (as Don knew) -
presumably he had a good reason to
Martin Sulzmann wrote:
Undecidable instances means that there exists a program for which there's
an infinite reduction sequence.
I believe this may be too strong of a statement. There exists patently
terminating type families that still require undecidable
instances in GHC. Here is an example:
On Fri, Aug 21, 2009 at 7:03 PM, Sebastian
Sylvansebastian.syl...@gmail.com wrote:
I think that there must be standard function that can do this. What do
experienced Haskellers use?
I usually just whip up a quick parser using Text.ParserCombinators.Parsec
I usually prefer ReadP for quick
Thank you for the reply.
Thomas ten Cate wrote:
Although you most certainly can use a State monad, in most problems
this isn't necessary. Most algorithms that you need to solve
programming contest problems can be written in a purely functional
style, so you can limit monadic code to just
On Sat, Aug 22, 2009 at 3:20 PM, staafmeister g.c.stave...@uu.nl wrote:
Thank you for the reply.
Thomas ten Cate wrote:
Although you most certainly can use a State monad, in most problems
this isn't necessary. Most algorithms that you need to solve
programming contest problems can
staafmeister wrote:
Yes I know but there are a lot of problems requiring O(1) array updates
so then you are stuck with IO again
Or use ST. Or use IntMap (which is O(log n), but n is going to max out
on the integer size for your architecture, so it's really just O(32) or
O(64), which is
Hi, I'm just started to learn Haskell. Coming from a programming contest
background (where it is important to be able to solve problems in a small
amount of code) I'm wondering what the best way is for simple IO.
A typical input file (in a programming contest) is just a bunch of numbers
which
G.C.Stavenga:
Hi, I'm just started to learn Haskell. Coming from a programming contest
background (where it is important to be able to solve problems in a small
amount of code) I'm wondering what the best way is for simple IO.
A typical input file (in a programming contest) is just a
Don Stewart-2 wrote:
G.C.Stavenga:
Hi, I'm just started to learn Haskell. Coming from a programming contest
background (where it is important to be able to solve problems in a small
amount of code) I'm wondering what the best way is for simple IO.
A typical input file (in a
On Fri, Aug 21, 2009 at 11:42 PM, Stavenga, G.C. g.c.stave...@uu.nl wrote:
Hi, I'm just started to learn Haskell. Coming from a programming contest
background (where it is important to be able to solve problems in a small
amount of code) I'm wondering what the best way is for simple IO.
A
Hi,
Seems that Haskell allows to specify dummy type variables in a
declaration of a type synonym, which do not appear in its right-hand
side. This can lead to interesting effects, which appears differently
in GHC and Hugs. I would like to know, what behavior is correct
according to the haskell 98
--
type F a = Int
class A a where
foo :: A b = a (F b)
--
GHC - OK
Hugs - Illegal type F b in constructor application
This time, I'd say Hugs is wrong (though eliminating that initial
complaint leads back to an
--
type F a = Int
class A a where
foo :: A b = a (F b)
--
GHC - OK
Hugs - Illegal type F b in constructor application
This time, I'd say Hugs is wrong (though eliminating that initial
complaint leads back to an
Could someone provide an elegant solution to Bird problem 4.2.13?
Here are the problem and my inelegant solution:
Problem
---
Since concatenation seems such a basic operation on lists, we can try to
construct a data type that captures
concatenation as a primitive.
For example,
data
On 5 Mar 2009, at 4:02 am, R J wrote:
Could someone provide an elegant solution to Bird problem 4.2.13?
This is the classic Lisp SAMEFRINGE problem in disguise.
You say that the method of converting CatLists to lists and then
comparing those is a hack, but I take leave to doubt that.
It's
Hi,
I managed to miss not one, but two separate emails containing patches to
haskell-src meta. My sincere apologies to those who've sent me patches.
I'll be applying them among other improvement to src-meta and will update
the package on hackage in short time (today :).
Matt
hi,
i am looking for someone to help me with an assignment!
can anyone help me?
i am looking forward to your reply.
sincerely,
Tolis
_
BigSnapSearch.com - 24 prizes a day, every day - Search Now!
2008/11/25 apostolos flessas [EMAIL PROTECTED]:
hi,
i am looking for someone to help me with an assignment!
can anyone help me?
Hi Tolis!
Have a look at the homework help policy, so you know what people will
and will not answer.
http://www.haskell.org/haskellwiki/Homework_help
Then let us
Hello. I'm trying to apply the nested regions (as in Lightweight Monadic
Regions by Oleg Kiselyov and Chung-chieh Shan) design pattern, if that's the
proper term. I was hoping to gain a bit more type safety in this little library
I'm working on -- Streaming Component Combinators, available on
Hi
has anyone had any success in running a recent version of hs-plugins on a
windows platform. I refer to this post to the haskell list in December last
year. The current version of hs-plugins dosn't appear to work either. Same
problem ...
{- I downloaded the source and put my file in the same directory
You may need to adjust the imports -}
module Main where
import Picture
import Draw -- change xWin to 1000 and yWin to 700 for this to work
import EnableGUI -- I use a Mac
import SOE hiding (Region)
import qualified SOE as G
Hi I have a bit of a dilemma.I have a list of lists, eg,
[[1,2,3],[4,5,6],[7,8,9]]. Imagine they represent a grid with 0-2 on the x axis
and 0-2 on the y axis, eg, (0,0) is 1, (1,0) is 2, (2,1) is 6, etc and (2,3) is
9. I want to be able to put in the list of lists, and the (x,y) coordinate,
Am Donnerstag, 8. Mai 2008 15:36 schrieb [EMAIL PROTECTED]:
Hi I have a bit of a dilemma.I have a list of lists, eg,
[[1,2,3],[4,5,6],[7,8,9]]. Imagine they represent a grid with 0-2 on the x
axis and 0-2 on the y axis, eg, (0,0) is 1, (1,0) is 2, (2,1) is 6, etc and
(2,3) is 9. I want to be
Hi MailList Haskell-Cafe:
Till now, which module / package / lib can i use to access binary file ?
And is this easy to use in GHC ?
Regards
--
L.Guo
2007-05-24
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
leaveye.guo:
Hi MailList Haskell-Cafe:
Till now, which module / package / lib can i use to access binary
file ? And is this easy to use in GHC ?
Data.Binary? Or perhaps just Data.ByteString, available on hackage,
?
--
L.Guo
2007-05-24
-
发件人：Donald Bruce Stewart
发送日期：2007-05-24 14:03:27
收件人：L.Guo
抄送：MailList Haskell-Cafe
主题：Re: [Haskell-cafe] (no subject)
leaveye.guo:
Hi MailList Haskell-Cafe:
Till now, which module
leaveye.guo:
Thanks for your suggestion, and sorry for the subject.
I have read the introduction of Data.ByteString, it is helpful.
And also, there is one problem left. When i read a binary file, data
is truncated at the charactor EOF.
Which function could do this work correctly ?
Hmm.
And also, there is one problem left. When i read a binary file, data is
truncated at the charactor EOF.
Which character is this: ^D or ^Z? Which operating system - Windows,
perhaps? And you are reading from a file, not from stdin?
-k
___
Sorry for not familiar to the email client.
My system is WinXP, and using GHC 6.6.
And is read from file.
Data is truncated at the ^Z char.
I just wrote one simple test code.
import IO
writeTest fn = do
h - openFile fn WriteMode
mapM_ (\p - hPutChar h (toEnum p::Char)) $ [0..255] ++
On Thu, May 24, 2007 at 02:38:05PM +0800, L.Guo wrote:
Thanks for your suggestion, and sorry for the subject.
I have read the introduction of Data.ByteString, it is helpful.
And also, there is one problem left. When i read a binary file, data is
truncated at the charactor EOF.
You have
marco-oweber:
On Thu, May 24, 2007 at 02:38:05PM +0800, L.Guo wrote:
Thanks for your suggestion, and sorry for the subject.
I have read the introduction of Data.ByteString, it is helpful.
And also, there is one problem left. When i read a binary file, data is
truncated at the
to Ketil :
Tring openBinaryFile, I notice that I cannot make one usable buffer,
just because I can not find one function to malloc a memory or just
get one change-able buffer.
:-$
to Marc:
I can not locate which module including readBinaryFile.
And I use hoogle search engine.
Could you
leaveye.guo:
to Ketil :
Tring openBinaryFile, I notice that I cannot make one usable buffer,
just because I can not find one function to malloc a memory or just
get one change-able buffer.
:-$
No 'malloc' here in Haskell land: that's done automatically. Recall
that 'getContents' will
do ?
--
L.Guo
2007-05-24
-
From: Donald Bruce Stewart
At: 2007-05-24 17:03:55
Subject: Re: Re: [Haskell-cafe] (no subject)
What are you trying to do?
-- Don
leaveye.guo:
To read the handle openBinaryFile returns, both the hGetBuf and
hGetBufNonBlocking needs one parameter _buf_ of type Ptr a.
I can not get one data of that type.
In the doc, there is only nullPtr, and also some type cast functions.
I failed to find some other buffer-maker
On Thu, 2007-05-24 at 17:01 +0800, L.Guo wrote:
Tring openBinaryFile,
Well, did you get it to work?
I can not locate which module including readBinaryFile.
This is what I find in System.IO (ghci :b System.IO):
openBinaryFile :: FilePath - IOMode - IO Handle
openBinaryTempFile ::
-
From: Donald Bruce Stewart
At: 2007-05-24 17:31:02
Subject: Re: Re: [Haskell-cafe] (no subject)
I mean, what problem are you trying to solve? Ptrs aren't the usual way
to manipulate files in Haskell.
...
-- Don
___
Haskell
Hello,
Ketil Malde wrote:
Makes me wonder whether one should have binary be the default? I'm a
stranger in Windows-land, but are there cases where you want reading
of a file to be terminated on ^Z? Seems pretty awful to me.
The ghc docs state about openBinaryFile:
Like openFile, but open
I'm attempting to construct an abstract data type with a generalised
(deferred) representation. For a simple motivating example, say I am
building an abstract data type with this representation:
newtype Foo1 k e = Foo1 (Data.Map.Map k (Data.Set.Set e))
While this is a fine default
_
FREE online classifieds from Windows Live Expo buy and sell with people
you know
http://clk.atdmt.com/MSN/go/msnnkwex001001msn/direct/01/?href=http://expo.live.com?s_cid=Hotmail_tagline_12/06
Dear Colleagues,
Apologies in advance for the p.m. ommission.
This is a kind reminder that the deadline for extended abstract
submissions to TFP 2007 is tomorrow, Feb. 1 at 11:59 p.m. EST. We are also
pleased to announce that the TFP 2007 invited speaker is John McCarthy,
Stanford
Dear,
I will try to explain what I'm trying to achieve, below you can find the
code demonstrating where I'm at currently, and where I would like to
ideally get, as well as the current compilation error.
Basically I'm working on a minilanguage that I would like to simulate.
This language is
Hi
Im having a small problem with the portability
of my Haskell code. My code uses wxHaskell and the library for which this one
is the Haskell interface (that is called wxWidgets) doesnt work in the
same away in Windows and Linux.
Now I now which code run in Linux and in Windows but
Hello José,
Wednesday, March 15, 2006, 5:54:49 PM, you wrote:
JMV #ifdef __WIN32__
i use the following:
#if defined(mingw32_HOST_OS) || defined(__MINGW32__) || defined(_MSC_VER)
--
Best regards,
Bulatmailto:[EMAIL PROTECTED]
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
L.S.,
I used the link checker of the World Wide Web Consortium to check the
links on haskell.org; there are several links broken. As the checks take a
long time, I have put the results on my website:
http://members.chello.nl/hjgtuyl/computing/Haskell/checklinks/checklink.htm
The check
Hi,
I have to install HDirect on a windows plataform but I have a lot of problems.
When I try to install the version 0.21,make boot has problems with Happy and
I've commented this line(the path is correct),latter make lib give 2 errors:
../src/ihc :command not found
[hugs/PointerPrim.hs] Error
From: John Peterson [EMAIL PROTECTED]
To: [EMAIL PROTECTED]
Subject: Re: [Haskell-cafe] Functional Reactive Programming
Functional Reactive Programming is alive but in need of some new
students to push the effort a bit. A lot of us have taken teaching
or industrial positions so the old FRP team
. Peterson wrote:
From: John Peterson [EMAIL PROTECTED]
To: [EMAIL PROTECTED]
Subject: Re: [Haskell-cafe] Functional Reactive Programming
Functional Reactive Programming is alive but in need of some new
students to push the effort a bit. A lot of us have taken teaching
or industrial positions so
81 matches
Mail list logo
