Hi,
Thanks for the heads-up.
I have just checked my email addresses registered on linkedin: I had three
of them, my regular email address (this one), me previous work address,
which I never added myself, and haskell-cafe, which I did not add myself
either.
My regular address was labeled as
The syntax is actually used by non-technical people to write tests.
Using it to write Haskell code is a joke. (Using it for business
specification is not, even if for technical people this seems
overkill.)
Thu
2013/9/10 Ian Ross i...@skybluetrades.net:
Me too, but I wasn't brave enough to say
2013/7/30 David Sorokin david.soro...@gmail.com:
Hi, Cafe!
Probably, it was asked before but I could not find an answer with help of
Google.
I have a library which is hosted on Hackage. The library is licensed under
BSD3. It is a very specialized library for a small target group. Now I'm
in the license field of the
.cabal file: GPL or OtherLicense. The both choices seem correct to me and
misleading at the same time.
Cheers,
David
30.07.2013, в 12:53, Vo Minh Thu написал(а):
2013/7/30 David Sorokin david.soro...@gmail.com:
Hi, Cafe!
Probably, it was asked before but I
wrote:
Thanks Thu,
I agree with you. Just I don't know what to write in the license field of
the .cabal file: GPL or OtherLicense. The both choices seem correct to me
and misleading at the same time.
Cheers,
David
30.07.2013, в 12:53, Vo Minh Thu написал(а):
2013/7/30 David Sorokin
is dual and everyone is free to use the library under GPLv3 (which
is the main use case) according the terms provided in the corresponded
second file.
Thanks,
David
On 30.07.2013 13:57, Vo Minh Thu wrote:
Unless you want to provide multiple open source licenses, I don't see the
point
from
data License = Commercial | GPL3
I hope this analogy to Haskell data types is convincing :)
Janek
- Oryginalna wiadomość -
Od: David Sorokin david.soro...@gmail.com
Do: Vo Minh Thu not...@gmail.com
DW: Haskell Cafe haskell-cafe@haskell.org
Wysłane: wtorek, 30 lipiec 2013 11
Sorry but I was not discussing which license to use. It seems I cannot
get my point across...
2013/7/30 David Sorokin david.soro...@gmail.com:
This is already another question what license to use :)
On 30.07.2013 14:56, Vo Minh Thu wrote:
Again I haven't seen a reason to do what you propose
Certainly less entertaining but depending on your public, this one with FP
Complete's Aaron Contorer can be valuable:
http://www.youtube.com/watch?v=Fqi0Xu2Enaw
2013/6/17 Mihai Maruseac mihai.marus...@gmail.com
Hi,
I was wondering if we have similar movies for Haskell as
2013/6/13 Joachim Breitner m...@joachim-breitner.de
Hi,
Am Donnerstag, den 13.06.2013, 09:59 +0800 schrieb Niklas Hambüchen:
In many discussions we make guesses about how much code proposals like
Functor = Monad would break.
You can use https://github.com/dterei/Hackager to build all
2013/6/13 Vo Minh Thu not...@gmail.com
2013/6/13 Joachim Breitner m...@joachim-breitner.de
Hi,
Am Donnerstag, den 13.06.2013, 09:59 +0800 schrieb Niklas Hambüchen:
In many discussions we make guesses about how much code proposals like
Functor = Monad would break.
You can use https
2013/3/11 Brent Yorgey byor...@seas.upenn.edu:
Hi everyone,
I am currently teaching a half-credit introductory Haskell class for
undergraduates. This is the third time I've taught it. Both of the
previous times, for their final project I gave them the option of
contributing to an
2013/2/19 Daniel Trstenjak daniel.trsten...@gmail.com:
Hi Henk-Jan,
It seems to me that there is something missing from this e-mail.
What are you missing?
Screenshots obviously ;)
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
2013/1/18 Petr P petr@gmail.com:
Dear Haskellers,
could somebody recommend me study materials for learning Hindley-Milner type
inference algorithm I could recommend to undergraduate students? The
original paper is harder to understand, I'm looking for something more
didactic. The
2013/1/17 Jason Dusek jason.du...@gmail.com:
2013/1/17 Kazu Yamamoto k...@iij.ad.jp:
The following blog post by Joyent is worth reading:
http://joyent.com/blog/diy-vs-as-a-service-with-memcachier
We don't really believe in Node.js (Go Haskell are our
choices), so
2012/12/12 Dmitry Kulagin dmitry.kula...@gmail.com:
Hi Cafe,
I am faced with unpleasant problem. The lawyer of my company checked sources
of containers package and found out that it refers to some GPL-library.
Here is quote:
The algorithm is derived from Jorg Arndt's FXT library
in file
as distribution, as distinct from the AGPL).
If a sizable chunk of actual code was copied, then the containers package
would have to be GPL, and if you are using the library and distribute
programs built with it then those programs must be GPL as well.
On Wed, Dec 12, 2012 at 7:47 AM, Vo Minh Thu
2012/12/12 Johan Tibell johan.tib...@gmail.com:
On Wed, Dec 12, 2012 at 10:40 AM, Clark Gaebel cgae...@uwaterloo.ca wrote:
I just did a quick derivation from
http://graphics.stanford.edu/~seander/bithacks.html#RoundUpPowerOf2 to get
the highest bit mask, and did not reference FXT nor the
2012/10/4 Stephen Tetley stephen.tet...@gmail.com:
On 4 October 2012 18:04, Kim-Ee Yeoh k...@atamo.com wrote:
Something to consider is that it's not so much whether the material is
basic, advanced, or intermediate; it's that the way it's being presented is
boring and ineffective.
I'd suggest
2012/8/8 Martijn Schrage mart...@oblomov.com:
Hi cafe,
For a while now, I've been wondering why the 'let' keyword in a do block
isn't optional. So instead of
do ...
let x = exp1
y = exp2
z - exp3
...
you could simply write
do ...
x = exp1
y = exp2
z - exp3
Oh the mailing list was haskell@ instead of café. Sorry. (Now cc'ing café.)
Andreas, please post this kind of mail to the haskell-cafe instead of
the haskell mailing list.
2012/7/16 Vo Minh Thu not...@gmail.com:
It seems like the infered type (and thus bounds) is different when you
force
See the Further Reading section on the wikipedia page you provided
(http://en.wikipedia.org/wiki/Quickcheck), not all links are dead.
2012/6/1 Yves Parès yves.pa...@gmail.com:
Yes ^^ but I can't find this paper, Koen Claessen website doesn't mention it
and the link on the page
For what it's worth, I think he is active on stackoverflow.
Thu
Le 23 avril 2012 17:13, Johan Tibell johan.tib...@gmail.com a écrit :
On Mon, Apr 23, 2012 at 7:53 AM, Max Rabkin max.rab...@gmail.com wrote:
On Mon, Apr 23, 2012 at 15:01, Paul Graphov grap...@gmail.com wrote:
And what should I
Le 5 avril 2012 16:14, Grigory Sarnitskiy sargrig...@ya.ru a écrit :
Hello! I've just realized that Haskell is no good for working with functions!
First, what are 'functions' we are interested at? It can't be the usual
set-theoretic definition, since it is not constructive. The constructive
Le 21 mars 2012 03:45, serialhex serial...@gmail.com a écrit :
i'm looking for something lightweight, that dosnt need it's own
server, can easily run on cgi on an apache with minimal work, and
dosn't have many dependancies. i was looking at yesod, but it is
bigger than i need for my site (at
2011/12/20 Michael Serra mk.se...@gmail.com:
Hello Haskellers,
I'm implementing a simple tree-manipulating (for sports tournaments)
application prototype, with SDL for graphics and simple user interaction.
For reference, I've posted the code on hpaste. My question is about code
2011/11/29 Stefan Holdermans ste...@vectorfabrics.com:
Martin,
(The trick with `flip` is tempting, but again at the
cost of having to peer rather too closely at the implementation of
processFile when reading the code).
That trick is of course completely orthogonal. One could just as well
2011/10/21 Michael Litchard mich...@schmong.org:
I know it's bad form to post the same question to multiple mailing
lists. But what about say, the beginner's mailing list and
stackoverflow.com?
Hi,
Nothing is carved in stone, use your judgment. It shouldn't be done
systematically but from
I guess you refer to data-reify:
http://hackage.haskell.org/package/data-reify
2011/8/11 Stephen Tetley stephen.tet...@gmail.com:
Strafunski and its successors (Uniplate, SYB, KURE) are really for
working on trees. If you want to work on graphs you would probably be
better of with something
2011/7/26 Siddhartha Gadgil siddhartha.gad...@gmail.com:
I have been making programs for mathematical applications
(low-dimensional topology) in Haskell, which I find a delight to code
in. However, the execution is slow, and this seems to be because
recursively defined functions seem to
2011/7/20 Sergey Mironov ier...@gmail.com:
Hi. I was searching for info about building ghc on ARM arch. I already
know about [1] approach, and also saw debian binaries [2], but I am
afraid I have to compile ghc by myself this time, since our system
uses incompatible libc, so my question is
2011/7/18 Emanuil Boyanov emanuilboya...@gmail.com:
Hi guys, I'm new to Haskell, I learn it for couple of months now and we've
learned only simple functions like map, zip etc. But now my assignment is a
lot tougher than I thought so I'll need some guidelines. I've googled my
assignment and I
Don isn't working at Galois anymore. I guess his new email address is
simple to find but I gave it to Wren privately.
But I guess the sloth signal works fine too.
Cheers,
Thu
2011/7/13 Yves Parès limestr...@gmail.com:
It's mine too!
Who!? Who said that? Links! I want links! (And names)
2011/6/22 Dmitri O.Kondratiev doko...@gmail.com:
Hi,
I am looking for Haskell library to create graph diagrams in png or similar
formats.
See the graphviz package: http://hackage.haskell.org/package/graphviz
Cheers,
Thu
___
Haskell-Cafe mailing
2011/6/22 Gregory Collins g...@gregorycollins.net:
On Wed, Jun 22, 2011 at 4:39 PM, SM Design social_me...@abv.bg wrote:
I have a homework which is very important to be done but I can't complete
the task at all. The program i should write is:
Nobody on this list is going to do your homework
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
2011/6/4 Tillmann Vogt tillmann.v...@rwth-aachen.de:
Hi,
There are some categories on Hackage that have become so large that it is
hard to find something, i.e. Data(414 packages) and Graphics (191). Thats
why I suggest to use subcategories separated from the category with a dot.
To show that
2011/6/2 John Goerzen jgoer...@complete.org:
Hi Jon all,
I've decided that I'm OK with re-licensing hslogger, HDBC, and well all of
my Haskell libraries (not end programs) under 3-clause BSD.
My schedule is extremely tight right now but if someone wants to send me
patches for these things
2011/5/19 Andrew Coppin andrewcop...@btinternet.com:
http://www.winestockwebdesign.com/Essays/Lisp_Curse.html
Some of you might have seen this. Here's the short version:
Lisp is so powerful that it discourages reuse. Why search for and reuse an
existing implementation, when it's so
2011/5/9 bri...@aracnet.com:
On Sun, 8 May 2011 16:23:59 -0700
Rogan Creswick cresw...@gmail.com wrote:
Newt scans the input (either a file, directory or stdin) for tags
marked with tagName [1], then replaces those entries with
values specified on the command line, producing either a new
2011/4/26 Trevor Elliott tre...@galois.com:
Hot on the heels of the last release, cereal-0.3.3.0 [1] adds support
for parsing and rendering lazy ByteStrings. Most running functions in
Data.Serialize.Get and Data.Serialize.Put now have lazy analogues, and
Data.Serialize has gained encodeLazy
2011/4/27 Henning Thielemann lemm...@henning-thielemann.de:
I like to apply for the quote of the week. :-)
If Haskell is great because of its laziness,
then Python must be even greater,
since it is lazy at the type level.
Dynamically typed languages only check types if they have to,
2011/4/9 Grigory Sarnitskiy sargrig...@ya.ru:
I guess that deciding whether two functions are equal in most cases is
algorithmically impossible. However maybe there exists quite a large domain
of decidable cases? If so, how can I employ that in Haskell?
It is a common situation when one has
2011/4/7 José Pedro Magalhães j...@cs.uu.nl:
Hi all,
I want to use cabal-install on a machine without internet access. I tried
downloading http://hackage.haskell.org/cgi-bin/hackage-scripts/archive.tar,
unpacking it and setting the local-repo field in the config file to this
location but
2011/4/5 Christopher Done chrisd...@googlemail.com:
On 5 April 2011 15:17, Marco Túlio Gontijo e Silva mar...@marcot.eti.br
wrote:
I plan to apply to the Google Summer of Code, to work on the
parallelization of
Cabal Install. As stated in some comments, this project may be too small
for
2011/4/4 Tillmann Vogt tillmann.v...@rwth-aachen.de:
Dear Haskell Programmers,
To get some feedback on my proposal here is posting that explains it more
detailed:
http://tillmannvogt.wordpress.com/2011/03/30/gsoc/
If this succeeds it could become the poster child application for WebGL and
2011/3/29 Bryan Edds bryane...@yahoo.com:
Hi Jake!
My only question is this: what does your language offer that others do
not with respect to soft real time systems? The language you describe in
the linked forum thread looks neat, but I think I'm missing the
reasoning behind its design. Why
2011/3/28 Jason Dagit dag...@gmail.com:
...
The tutorials are still written using OpenGL's immediate
mode, but that was deprecated in OpenGL 3.x so it's possible that in the
future these examples won't be supported by your graphics card.
...
Hi,
I wouldn't worry about the older API to be
2011/3/17 wren ng thornton w...@freegeek.org:
On 3/17/11 9:18 AM, Andy Stewart wrote:
On Sat, Feb 12, 2011 at 6:57 PM, Jan
Christiansenj...@informatik.uni-kiel.de wrote:
if you have written at least 1 lines of code in Haskell,
Goodness. It looks like my current project is over 17,275
2011/3/14 Malte Harder malte.har...@googlemail.com:
Dear all,
I just released the first version of the Craftwerk graphics library for
2d vector graphics. Craftwerk is intended to act as an abstract
interface to different backend drivers. The library itself has a TikZ
2011/3/11 Victor Oliveira rhapso...@gmail.com:
Hi cafe,
There are a lot of http servers in hackage. I didn't have used none.
I would like to know if one of them is something closer of the nginx.
I need some light and fast. It don't need support all http, just the basics
is fine.
, }] results in [FunctionToken
[IdentifierToken foo, BinderToken bar]]
-Ursprüngliche Nachricht-
Von: Vo Minh Thu [mailto:not...@gmail.com]
Gesendet: Freitag, 25. Februar 2011 17:44
An: Hauschild, Klaus (EXT)
Cc: haskell-cafe@haskell.org
Betreff: Re: [Haskell-cafe] http
2011/2/25 Hauschild, Klaus (EXT) klaus.hauschild@siemens.com:
Hi,
Currently I'm trying to lern Haskell by doing. After doing some examples I
plan to solve an ICFP task (see subject). In short: build an interpreter for
a stack based language thata describes a 3D scene. Ray trace this scene
2011/2/17 Henning Thielemann lemm...@henning-thielemann.de:
Duncan Coutts schrieb:
Several people have asked about the new host key. Yes, there is a new
RSA host key for the community server, the fingerprint of which is:
21:b8:59:ff:39:69:58:7a:51:ef:c1:d8:c6:24:6e:f7
ssh will likely give
2011/1/21 Clint Moore cmo...@wamboli.com:
After sufficient hand-wringing I finally uploaded web-mongrel2 up to
hackage and I'm interested in criticism of my approach. The module
itself is terribly simple as it's meant to provide a lightweight layer
between an application or framework and
Hi,
I've not really followed the thread, but on the client side, for
long-polling, you issue an XMLHttpRequest that will receive an answer
from the server only when the server has something to push to the
client (maybe done with a thread waiting on an MVar). XHR is
asynchronous as you have to
2010/11/9 C K Kashyap ckkash...@gmail.com:
Thanks Stephen,
On Tue, Nov 9, 2010 at 2:53 PM, Stephen Tetley stephen.tet...@gmail.com
wrote:
I'd use a parser combinator library that has word8 word16, word32
combinators. The latter should really have big and little endian
versions word16be,
2010/11/9 C K Kashyap ckkash...@gmail.com:
I think I can restate my problem like this ---
If I have a list of actions as follows -
import Data.Word
import Data.Binary.Get
data MyAction = A1 (Get Word8) | A2 (Get Word16)
a = A1 getWord8
b = A2 getWord16be
listOfActions = [a,b,a]
How
2010/11/9 Ozgur Akgun ozgurak...@gmail.com:
If we change the code a bit,
data MyAction = A1 Word8 | A2 Word16
a,b :: Get MyAction
a = A1 $ getWord8
b = A2 $ getWord16be
listOfActions :: [Get MyAction]
listOfActions = [a,b,a]
Now, we know how to execute the list of actions, and get the
Hi,
There is for instance http://gamr7.com/
They are listed in http://www.haskell.org/haskellwiki/Haskell_in_industry
Cheers,
Thu
2010/11/6 Corentin Dupont corentin.dup...@gmail.com:
Hello,
as well as I know, there is very few, if no, jobs in Haskell in France.
They are much more on CAML.
2010/10/31 Nils Schweinsberg m...@n-sch.de:
Hi!
I'm having a really hard time to write a correct parser for a small language
I've developed. I have been trying to write a parser using parsec, but
always get a lot of error messages like unexpected \n, expected ...,
new-line or... when trying
2010/10/21 Peter Schmitz ps.hask...@gmail.com:
I am seeking suggestions for a regression test utility or framework
to use while developing in Haskell (in a MS Windows environment).
[snip]
Hi,
Have a look at HUnit and, e.g. test-framework.
http://hackage.haskell.org/package/HUnit
2010/10/19 Tom Hawkins tomahawk...@gmail.com:
How do I profile cabal libraries?
I cabal install -p a local package I am testing, and I compile a
test of the library using -prof -auto-all. But the profiling report
only lists a CAF entry for the library, but does not detail any of the
2010/10/18 DavidA polyom...@f2s.com:
Ketil Malde ketil at malde.org writes:
Don Stewart dons at galois.com writes:
Good start, if only the advanced were replaced with something more
characteristic, like lazy, or statically typed. Which, BTW, both do
not
lazy and statically typed
2010/10/11 Roman Cheplyaka r...@ro-che.info:
On Mon, 11 Oct 2010 11:54:12 +0100, Magnus Therning mag...@therning.org
wrote:
On Mon, Oct 11, 2010 at 08:37, Michael Snoyman mich...@snoyman.com
wrote:
[...]
Also, now 10 random profiles will be displayed on the homepage. Only
verified users
2010/10/7 Michael Snoyman mich...@snoyman.com:
On Wed, Oct 6, 2010 at 8:14 PM, Brent Yorgey byor...@seas.upenn.edu wrote:
One (slightly off-topic) question: at the top of the site it says the
meeting place for professional Haskell programmers. Is this supposed
to be geared towards Haskell
2010/10/4 Jonas Almström Duregård jonas.dureg...@chalmers.se:
Hi Café,
I'm doing some code generation with Template Haskell that results in
few hundred top level declaration, of which only 10 or so should
actually be exposed to the user (the rest are only used by generated
code).
Since I
2010/10/3 Ketil Malde ke...@malde.org:
Matthias Kilian k...@outback.escape.de writes:
http://www.vimeo.com/15462768
And is there any way to just *download* the video? For people not
using adobe flash?
+1. I'd like to watch video offline on my phone, so Flash isn't really
a good
2010/10/2 Luke Palmer lrpal...@gmail.com:
On Sat, Oct 2, 2010 at 4:32 AM, Bulat Ziganshin
bulat.zigans...@gmail.com wrote:
Hello Heinrich,
Saturday, October 2, 2010, 1:36:48 PM, you wrote:
Would you put a flattr button [1] on the wxHaskell page? This way,
people like me would be able to
2010/10/1 Magnus Therning mag...@therning.org:
Now that there are lists/groups on Twitter
(http://mashable.com/2009/11/02/twitter-lists-guide/) maybe one should
be created one for Haskellers?
I would do it, but it seems I can't be on my own list :-) So unless
I've missed something I'd have
2010/9/29 Tom Hawkins tomahawk...@gmail.com:
On Tue, Sep 28, 2010 at 9:20 PM, Shakthi Kannan shakthim...@gmail.com wrote:
If you are still at it, you can have a look at Chalmers Lava [1], or
Kansas Lava [2].
Feldspar [3] project targets DSP though.
These are examples light embedded DSLs,
2010/9/24 Albert Y. C. Lai tre...@vex.net:
On 10-09-23 04:57 PM, Andrew Coppin wrote:
If you think that sounds silly, ask some random person (not a computer
programmer, just some random human) how find the sum of a list of
numbers.
My reply: to sum 10 numbers, sum 9 numbers, then account
2010/9/18 Tillmann Vogt tillmann.v...@rwth-aachen.de:
Hi,
I have nearly finished writing a Collada-output library to make 3d animation
files. Before doing this I have looked at two libraries on hackage that
parse Collada to display it. For my library I have copied the types from
2010/9/18 Tillmann Vogt tillmann.v...@rwth-aachen.de:
Am 18.09.2010 15:14, schrieb Vo Minh Thu:
Hi,
This is a great goal! I've also been thinking in solidifying all
things 3D on hackage lately and forming a game and graphics strike
team. (The idea is that even if you're not interested
2010/9/16 Evan Laforge qdun...@gmail.com:
2010/9/16 Alexey Karakulov ankaraku...@gmail.com:
Hi. I'm writing GUI (gtk) program which purpose is take some data as user
input, perform some evaluations, and produce some plots and coefficients.
Since some evaluations take significant time (about 10
the same
options, and ease the whole process.
Thanks,
Thu
2010/9/15 Daniel Fischer daniel.is.fisc...@web.de:
On Wednesday 15 September 2010 02:50:15, David Terei wrote:
On 13 September 2010 20:41, Vo Minh Thu not...@gmail.com wrote:
... the post is from 2008. No LLVM goodness. So I thought GHC
2010/9/13 David Virebayre dav.vire+hask...@gmail.com:
Does it help to compile with ghc --make -O2 -funbox-strict-fields ??
No, it doesn't. Can I assume you don't have the problem I described?
Thanks,
Thu
___
Haskell-Cafe mailing list
2010/9/13 Daniel Fischer daniel.is.fisc...@web.de:
On Monday 13 September 2010 11:50:14, Vo Minh Thu wrote:
2010/9/13 David Virebayre dav.vire+hask...@gmail.com:
Does it help to compile with ghc --make -O2 -funbox-strict-fields ??
No, it doesn't. Can I assume you don't have the problem I
Hi,
I would like to benchmark C/C++ and Haskell code. The goal is to
improve the Haskell port[0] of smallpt[1].
To make sure my approach was reliable, I got the code of two programs
(one in C, the other in Haskell) from a post[2] by Don. The code is
reproduced below. When timing the execution of
2010/9/12 Andrew Coppin andrewcop...@btinternet.com:
Vo Minh Thu wrote:
Hi,
I would like to benchmark C/C++ and Haskell code. The goal is to
improve the Haskell port[0] of smallpt[1].
To make sure my approach was reliable, I got the code of two programs
(one in C, the other in Haskell
2010/9/7 David Virebayre dav.vire+hask...@gmail.com:
2010/9/7 Ben Lippmeier b...@ouroborus.net:
Though be warned you must use a recent GHC head build to get good
performance. After GHC 7.0 is out (in a few weeks) we'll be able to release
a properly stable version.
Pardon a probably stupid
2010/9/7 Günther Schmidt gue.schm...@web.de:
Hi list,
I noticed that there are some libs / packages like atom and HJscript which
allow you to write a program in a haskell EDSL and that then actually
generates valid source code in another language. In the above example that
would be
2010/9/6 Manuel M T Chakravarty c...@cse.unsw.edu.au:
Ian Lynagh:
To fix this problem, we propose that we create a haskell.org
committee, which is responsible for answering these sorts of questions,
although for some questions they may choose to poll the community at
large if they think
2010/9/6 Ivan Lazar Miljenovic ivan.miljeno...@gmail.com:
On 6 September 2010 17:42, Johann Bach johann.bach1...@gmail.com wrote:
Is there a way to run a Haskell module via ghci with a single command
on the command-line?
Note: I'm on Windows XP.
If I have the module test.hs, I can type
2010/9/6 Johann Bach johann.bach1...@gmail.com:
On Mon, Sep 6, 2010 at 12:51 AM, Vo Minh Thu not...@gmail.com wrote:
2010/9/6 Ivan Lazar Miljenovic ivan.miljeno...@gmail.com:
On 6 September 2010 17:42, Johann Bach johann.bach1...@gmail.com wrote:
Is there a way to run a Haskell module via ghci
2010/9/4 Michael Litchard mich...@schmong.org:
I'll be starting a new job soon as systems tool guy. The shop is a
perl shop as far as internal automation tasks go. But I am fortunate
to not be working with bigots. If they see a better way, they'll take
to it. So please give me your best
2010/8/31 michael rice nowg...@yahoo.com
Learn You a Haskell ... says that (-) is a type just like Either. Where
can I find its type definition?
You can't define it *in* Haskell as user code. It is a built-in infix
type constructor (Either or Maybe are type constructors too, not just
types).
the relationship between the ananymous function
syntax and the function type:
id = \x - x
In fact, if you write in prefix form, it is quite familiar:
f :: (-) Int Bool
e = Either String Float
Cheers,
Thu
Michael
--- On Tue, 8/31/10, Vo Minh Thu not...@gmail.com wrote:
From: Vo Minh Thu
2010/8/31 Andrew Coppin andrewcop...@btinternet.com:
Luke Palmer wrote:
I have a description of the design pattern you need, appropriately
named:
http://lukepalmer.wordpress.com/2009/03/24/certificate-design-pattern/
Mmm, I like that.
There are two small problems:
* In my web browser,
.
m :: Maybe Int -- not just Maybe
(+) :: (-) Int Int -- and not only (-) Int
Cheers,
Thu
Michael
--- On Tue, 8/31/10, Vo Minh Thu not...@gmail.com wrote:
From: Vo Minh Thu not...@gmail.com
Subject: Re: [Haskell-cafe] On to applicative
To: michael rice nowg...@yahoo.com
Cc: haskell-cafe
: Vo Minh Thu not...@gmail.com, haskell-cafe@haskell.org
Date: Tuesday, August 31, 2010, 2:36 PM
Prelude FmapFunc let s = show :: ((-) Int) String
Prelude FmapFunc :t s
s :: Int - String
Prelude FmapFunc let v = fmap (hello ++) s
Prelude FmapFunc :t v
v :: Int - String
Prelude FmapFunc v 1
Thu not...@gmail.com wrote:
From: Vo Minh Thu not...@gmail.com
Subject: Re: [Haskell-cafe] On to applicative
To: michael rice nowg...@yahoo.com
Cc: Ryan Ingram ryani.s...@gmail.com, haskell-cafe@haskell.org
Date: Tuesday, August 31, 2010, 3:07 PM
2010/8/31 michael rice nowg...@yahoo.com
* constructors.
Just is a (value) constructor.
This makes sense:
Just 7 is a value, so Just surely constructs a value. Nothing doesn't
take an argument but is called a constructor too.
Maybe Int is a type, so Maybe surely constructs a type.
Michael
--- On Tue, 8/31/10, Vo Minh Thu
2010/8/28 Sean Leather leat...@cs.uu.nl:
On Sat, Aug 28, 2010 at 01:29, Vo Minh Thu wrote:
It would be interesting to know some other sources: [...] number of
attendees to e.g. Utrecht
summer school on FP, ...
Just a bit over 30, I think. And it was interesting to see a significant
number
2010/8/27 sylvain sylvain.na...@googlemail.com:
Hi,
the results given by the same research at the world level is worrisome:
the interest in Haskell is steadily declining since 2004. Why was
Haskell not successful conquering the hearts? Is it doomed to fail or is
there still a chance?
2010/8/28 sylvain sylvain.na...@googlemail.com:
Hello,
I'm not sure if you're serious or not ...
Well, I wasn't, actually. My previous email was an eruption of second
degré (I guess the closest English term would be irony).
But you do realise Haskell is not a word only used to name some
2010/8/26 michael rice nowg...@yahoo.com
From: http://en.wikibooks.org/wiki/Haskell/Applicative_Functors
=
import Control.Applicative
f :: (a - b - c)
fmap :: Functor f = (d - e) - f d - f e
fmap f :: Functor f = f a - f (b - c) -- Identify d with a, and e
I think it works well :)
But sumsqr has type Int - Int - Int, not Int - Int - Int - Int.
I.e. it does take only two arguments while fmap3 takes a function of
three arguments.
2010/8/26 michael rice nowg...@yahoo.com
OK, fmap2 works, but not fmap3. What am I not understanding?
Michael
This is indeed the case: if you want to apply your sumsqr function or
Ivan's (\ x y z - z * y + z), to some Functor (Maybe in this case),
you don't have to redefine them, or even to use fmap2 or fmap3: you
just have to use $ and *.
E.g.:
(\ a b c - a + b + c) $ Just 1 * Just 2 * Just 3
Hi,
Is is possible to get Network.Socket.ByteString.recv to be
non-blocking (i.e. return directly even if no data is available) ?
I have tried ti use
setSocketOption sock NoDelay 1
but then I get the following error:
setSocketOption: unsupported operation (Protocol not available)
Here is
1 - 100 of 136 matches
Mail list logo
