Thanks - I can confirm all is working again. I believe than, within some
time window. some messages may have been dropped.
Tim
On 14/05/13 07:06, Yitzchak Gale wrote:
The mailman daemon process on the server apparently exited
for some reason. I restarted it, and now mail traffic seems
be distributed or archived.
I've not had a response from mail...@projects.haskell.org.
Tim
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
now I have an extra step to build build GHC
7.4.2 atop of 7.0.3.
Tim
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
the necessary IO action from the STM action,
and then run it once the STM transaction has completed successfully.
Tim
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
the diagrams library currently have
adequate text support.
Tim
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
and linux, and
provides good access to fonts and font metrics. Any suggestions?
Tim
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
of functions approach is the one that I
normally take when I am building a system that needs new types added without
requiring global changes. I know that existentials and GADTs are possible
solutions, but I've not needed the extra complexity here.
Cheers,
Tim
Hi Eric,
In a previous project, I chose vty over ncurses:
- you can write your own event loop, and hence handle different
event sources.
- more liberal license (BSD3 versus GPL)
Tim
On 26/01/13 19:24, Erik de Castro Lopo wrote:
Hi all,
I am in the process of writing a Haskell
Does this new release included the sandbox functions discussed in this
blog post:
http://blog.johantibell.com/2012/08/you-can-soon-play-in-cabal-sandbox.html
?
Tim
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org
would better illustrate your problem?
Tim
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
) - processBar bar
(UFrog frog) - processFrog frog
But I think from your original mail, you find this ugly in some way?
Tim
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On Sun, Jul 22, 2012 at 5:43 PM, Tim Matthews tim.matthe...@gmail.comwrote:
On Sun, Jul 22, 2012 at 5:11 PM, Anonymous Void bitsofch...@gmail.comwrote:
but I have no idea what to put into some of the arguments for
regSetValueEx or regCreateKeyEx,
Those are just plain bindings to windows
.
Tim
On 27/06/2012, at 5:33 PM, Johannes Waldmann wrote:
Dear all,
I need a recent ghc on a not-so-recent (?) CentOS.
The ghc binary package (7.2 or 7.4) does not work
because of a mismatch in the libc version.
ghc-7.0 is working but when I use it to compile 7.4,
it breaks with some
With the C pre processor you can write different code for windows and non
windows? Can your package achieve the same?
The name alone makes it sound like an alternative to using CPP.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
for
the fast paths in data structures, while keeping the full STM available as a
fall-back for expressing the cases that cannot be implemented using short
transactions.
--Tim
-Original Message-
From: haskell-cafe-boun...@haskell.org
[mailto:haskell-cafe-boun...@haskell.org] On Behalf
example from
reactive-banana. It's a great introduction to FRP for me. The declarative
style is very appealing. I will try how it fits with my ideas.
Some of my code (thaugh probably obsolete): http://hpaste.org/55795
Regards
Tim
___
Haskell-Cafe
Hi Stephen,
2011/12/27 Stephen Tetley stephen.tet...@gmail.com
Hi Tim
More problematic is that FRP models hybrid (continuous and discrete)
systems. For me at least, MIDI seems essentially discrete - a stream
of control events. In MIDI files control events are twinned with a
time stamp so
.
Now my questions:
I have read about Yampa, but I have not mastered it yet. E.g. I don't
understand switches. Could my triggers be realized with Yampa's events
and switches?
Would you recommend any other approach?
Is there something similar somewhere?
Regards
Tim
.html
Tim
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
sometimes called the
mother of all monads.
Regards
Tim
2011/11/21 David Menendez d...@zednenem.com
On Sat, Nov 19, 2011 at 3:29 PM, Felipe Almeida Lessa
felipe.le...@gmail.com wrote:
On Sat, Nov 19, 2011 at 6:08 PM, Tim Baumgartner
baumgartner@googlemail.com wrote:
I have not yet gained
Hi Heinrich,
I read your article about the operational monad and found it really very
enlightening. So I'm curious to work through the material you linked below.
Thanks!
Regards
Tim
2011/11/21 Heinrich Apfelmus apfel...@quantentunnel.de
Tim Baumgartner wrote:
Thanks a lot! Althaugh I have
originally wanted to know. I guess I struggled with the
definition of output.
Oh, there's so much more to learn...
Thanks,
Tim
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
this? Are there
easy research papers about Haskell programming? Or should I try the
Monad.Reader? I'm looking for topics that either can be used directly in
many situations or that show some functional principles that boost my
creativity and functional thinking.
Regards,
Tim
2011/11/19 Felipe Almeida Lessa felipe.le
solve this in the code.
Thanks for any pointers.
Tim
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On 21/09/11 02:39, Heinrich Apfelmus wrote:
Tim Docker wrote:
I'm getting a stack overflow exception in code like this:
-- applyAction :: A - IO [B]
vs - fmap concat $ mapM applyAction sas
return vs
I don't get it if I change the code
to problems I
am currently
having with mapM over large lists (see the thread stack overflow
pain).
Can you explain what you mean by mapM_ tends to require more pipeline
composition?
In what way is it leveraging the language strengths?
Thanks,
Tim
,
Tim
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Jeuring. Generic Programming for Indexed
Datatypes.
Color pdf: http://dreixel.net/research/pdf/gpid.pdf
Greyscale pdf: http://dreixel.net/research/pdf/gpid_nocolor.pdf
Oh, brilliant, thank you! I'll take a look now.
Thanks,
Tim
___
Haskell-Cafe
encapsulates all the different types of order.
Thank you!
Tim
Thank you
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Platform and any other tools they need
preinstalled. It means a bit of extra preparation, but it'll allow you
to get to the interesting bit of the class more quickly and with less
frustration on the part of both yourself and your students.
Hope this helps.
Chers,
Tim
this, or should
I not be doing this at all, and, if the latter, what would be the best
means of achieving a similar result (i.e. a typeclass that implements
all the functionality of one or more others, optionally with some
additional specialism)?
Many thanks,
Tim
similar.
Many thanks,
Tim
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
), but haven't yet implemented the part of the project
that'll use it. I'd also be interested in anyone else's experiences
with it as it seems like a fairly young project, and will try and
write up some of my own once I've got a bit further with it!
Thanks,
Tim
? I imagine wanting to build the platform against bleeding
edge ghc would be a pretty common desire.
Tim
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On 07/06/11 14:03, Brandon Allbery wrote:
On Tue, Jun 7, 2011 at 07:34, Tim Dockert...@dockerz.net wrote:
do others go about testing their code with many hackage dependencies against
a new ghc? I would have expected that the first thing to do would be get the
We don't, for the most part
the types and then derive
my program for me. :)
I will be happy to fill out a few bug reports.
Many Thanks
Tim
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
of debuggers that are more tailored to the
process of debugging a functional program.
Cheers,
Tim
--
Tim Chevalier * http://cs.pdx.edu/~tjc/ * Often in error, never in doubt
an intelligent person fights for lost causes,realizing that others
are merely effects -- E.E. Cummings
my question is: Is there anyone who knows how to prove that IO and Cont
are monads with satisfing following properties:
IO doesn't obey the monad laws, due to the presence of seq in Haskell.
Sad but true...
Cheers,
Tim
--
Tim Chevalier * http://cs.pdx.edu/~tjc/ * Often in error, never in doubt
,
hplaylist allows me to type:
$ hplaylist Songs about cheese
which automatically copies the named playlist, and all music files
included in the playlist, to my device.
Download at:
http://hackage.haskell.org/package/hplaylist-0.1
or
https://github.com/catamorphism/hplaylist
Cheers,
Tim
--
Tim
to re-post it in haskell-cafe as well.
Tim Maxwell
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
are a rich
enough language to let you express your intent in data and not just in
code. That helps you help the compiler help you.
Cheers,
Tim
--
Tim Chevalier * http://cs.pdx.edu/~tjc/ * Often in error, never in doubt
an intelligent person fights for lost causes,realizing that others
are merely
-simpl) for each variation?
Cheers,
Tim
--
Tim Chevalier * http://cs.pdx.edu/~tjc/ * Often in error, never in doubt
an intelligent person fights for lost causes,realizing that others
are merely effects -- E.E. Cummings
___
Haskell-Cafe mailing list
is taking over maintainership of the library, so you
may want to cc him on any emails. In general it's not too safe to
assume that any particular library maintainer reads haskell-cafe
regularly :-)
Cheers,
Tim (hsmagick maintainer)
--
Tim Chevalier * http://cs.pdx.edu/~tjc/ * Often in error, never
arguments IIRC. (You can confirm this
for yourself if you also want to read the demand analyzer output.)
If ($) were getting inlined, the code would look the same coming into
demand analysis in both cases, so you wouldn't see a difference. So
I'm guessing you're compiling with -O0.
Cheers,
Tim
to be programming in or what languages are
practical. Sounds like a joy! Also, if you haven't, check out the book
_Mindstorms_ by Seymour Papert -- the particular programming paradigm
he advocates is different, but there should be some good fundamental
ideas to inspire you.
Cheers,
Tim
--
Tim Chevalier
On Sun, Jan 16, 2011 at 9:32 AM, Permjacov Evgeniy permea...@gmail.com wrote:
On 01/13/2011 10:45 PM, Tim Chevalier wrote:
Hello,
I've recently released version 1.0 of extcore, a library for
processing code in GHC's text-based External Core format. extcore
includes a parser, prettyprinter
for a colleague
who didn't have any version of GHC installed on his machine, and I
just couldn't find a simpler way than installing two other versions of
GHC first.
Just curious if anyone has done it. I realize PPC is unsupported.
Cheers,
Tim
--
Tim Chevalier * http://cs.pdx.edu/~tjc/ * Often in error
On Thu, Jan 13, 2011 at 11:45 AM, Tim Chevalier catamorph...@gmail.com wrote:
Hello,
I've recently released version 1.0 of extcore, a library for
processing code in GHC's text-based External Core format. extcore
includes a parser, prettyprinter, typechecker, and interpreter for
External Core
.
Please direct replies to glasgow-haskell-us...@haskell.org, with me
CCed. Please make sure not to reply to hask...@haskell.org.
Cheers,
Tim Chevalier
--
Tim Chevalier * http://cs.pdx.edu/~tjc/ * Often in error, never in doubt
an intelligent person fights for lost causes,realizing that others
2011/1/12 Neil Brown nc...@kent.ac.uk
On 11/01/11 23:19, Tim Baumgartner wrote:
Hi,
I'm having difficulties with this function I wrote:
iterateR :: (MonadRandom m) = (a - m a) - a - m [a]
iterateR g s = do
s' - g s
return (s:) `ap` iterateR g s'
I'm running the computation
not terminate. Reproducible.
Any clues what I'm doing wrong here?
Thanks in advance,
Tim
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
:
http://dockerz.net/software/chart.html
Thanks to Malcolm Wallace, Eugene Kirpichov, and Matt Brown for their
contributions to this release.
Tim Docker
--
New features in v0.14
-
* Plot Type: AreaSpots4D
Does anybody know of any utilities in haskell for reading and writing HDF5
files?
Other number crunchy formats? Thanks.--Tim
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
I just want to throw out 2 extreme case solutions to think about while this
problem doesn't really seem to be heading anywhere:
1) Drop the skills options in favor of the simple text box already in use.
This would of course would have a big impact on attempting to search for
haskellers.
2) A
[]
(ExitFailure 2,,Usage: javac options so...
Hope this helps.
- Tim
[1] System.Process
http://haskell.org/ghc/docs/6.12.2/html/libraries/process-1.0.1.2/System-Process.html
On Oct 19, 10:12 pm, Arnaud Bailly arnaud.oq...@gmail.com wrote:
Hello,
I have the following code (fragment) I use
The gravatars don't need to be on the front page but just on viewing the
profile. Why not just a big list possibly in random order then
sortable/searchable in various ways such as location, particular skills,
etc. This site could potentially become useless to anyone who's years
experience is less
://hackage.haskell.org/package/Chart
doesn't currently have support for candlestick charts, but adding
support would be straightforward - a patch would be most welcome
(hint, hint!).
Tim
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman
On Fri, Sep 17, 2010 at 6:47 PM, Michael Snoyman mich...@snoyman.comwrote:
* OpenID. Fixes the extra password problem, but doesn't give us any
extra information about the user (email address, etc).
I have my open id with verisign. https://pip.verisignlabs.com/
Verisign doesn't give me an
performance worse.
Cheers,
Tim
--
Tim Chevalier * http://cs.pdx.edu/~tjc * Often in error, never in doubt
Both of them are to world religions what JavaScript is to programming
languages. -- Juli Mallett, on Satanism and Wicca
___
Haskell-Cafe mailing list
Haskell
it would tell that
something with solid foundations and theory could still appear, hip and
pretty.
What is important though is the code. This is absolutely great and success
just keeps getting harder to avoid.
Thanks a lot,
Tim Matthews
___
Haskell
-hamlet fit in well and if so, as it often best to keep
styles separate, could a quasi quoted language live in in a separate haskell
module and then at run time it recreates the separate css files on first
launch?
Thanks
Tim Matthews
___
Haskell-Cafe
On Sun, Aug 1, 2010 at 9:18 PM, Alistair Bayley alist...@abayley.orgwrote:
On 24 July 2010 09:58, Hamish Mackenzie
hamish.k.macken...@googlemail.com wrote:
On 24 Jul 2010, at 02:15, Tim Matthews wrote:
Any of the haskellers here from NZ?
I am in Wellington, Stephen is near Palmerston
to notice questions that arise there.
Tim
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
SPJ http://research.microsoft.com/en-us/people/simonpj/default.aspx and
probably many others are actually employed at Microsoft research centers. It
looks like Microsoft just hasn't been able to find a suitable spot to push
Haskell. Haskell influenced F# because they needed a functional language
. Anything
even remotely similar here in New Zealand?
Thanks
Tim Matthews
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On Sun, Jul 11, 2010 at 4:06 PM, Brandon S Allbery KF8NH
allb...@ece.cmu.edu wrote:
The whole point of the .net CLR is that the implementation (Windows
COM, Mono, etc.) is hidden; you work with the CLR directly, *not* the
implementation behind it.
True. At least for CLR code that only deals
A native-managed bridge for the clr while being cross platform is quite
possible but unfortunately the developers of hs-dotnet reference ole32 and
oleaut32 as extra libraries. This means that the code relies on the
com/ole/activex layer in windows which is what Microsoft's implementation of
the
found this http://linux.lsdev.sil.org/wiki/index.php/Libcom that you
could try as a drop in replacement. Best of luck if you try this approach.
Thanks
Tim
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo
That sounds like an excellent idea! If you would like some help, let me
know and I would be glad to :)
Cheers,
- Tim
On Thu, Jul 1, 2010 at 11:50 AM, Don Stewart d...@galois.com wrote:
I think we need to standardise the presentation of this data, and
provide a lib to access it. I'll think
for you.
It may not be the most elegant, but it only took a few minutes and it does
the job. You'll find it attached :)
Cheers,
- Tim
On Wed, Jun 30, 2010 at 5:08 PM, Don Stewart d...@galois.com wrote:
Downloads and popular packages on Hackage for Q1 and Q2 this year.
http
then exit $ return () else ... -- do whatever
else here...
Cheers,
- Tim
2010/6/10 Günther Schmidt gue.schm...@web.de
Hi everyone,
I'm about to write a rather lengthy piece of IO code. Depending on the
results of some of the IO actions I'd like the computation to stop right
there and then.
Now
Actually, on second thought, Lennart is probably right. Continuations are
probably overkill for this situation.
Since not wanting to continue is probably an 'erroneous condition,' you may
as well use Error.
Cheers,
- Tim
2010/6/10 Lennart Augustsson lenn...@augustsson.net
I would not use
, if there are going to be multiple 'lengthy computations' then
perhaps
MaybeT or EitherT would be better, b/c they allow the propagation of failure
across multiple actions, instead of cascading off to the right of the screen
w/ 'if's or 'case's.
Cheers,
- Tim
On Thu, Jun 10, 2010 at 3:21 PM, Ben Millwood
Jones, Tim Sheard, and Sergio Antoy, all names that should be familiar
to anyone who knows the functional programming literature. We have
faculty members who have served as program chairs and general chairs
for ICFP; who have given invited talks at ICFP; who have co-organized
the ICFP programming
)
(Nothing, Just _)
Why is this the case?
Thanks,
Tim
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
for
the example.
My question was why, when I generate random values for (Maybe t, Maybe
t) using the Arbitrary type class, do I always see two Nothing values
or two Just values, and never one of each?
Tim
___
Haskell-Cafe mailing list
Haskell-Cafe
news is that quickcheck 2.1 behaves as I expected. I'm
still curious
as to the behaviour of the older version.
Tim
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
to convert the result back to an appropriate
numerical type. But internally the numeric data has still been converted
to an intermediate string representation. I'm wondering if this is
intentional, and whether it matters.
Tim
___
Haskell-Cafe mailing list
John Goerzen wrote:
Tim Docker wrote:
Yes. I can use fromSql to convert the result back to an appropriate
numerical type. But internally the numeric data has still been converted
to an intermediate string representation. I'm wondering if this is
intentional, and whether it matters.
Yes
a sign of an incomplete
implementation of the ODBC driver? It would certainly seem possible for
the ODBC driver to return more specific types.
Tim
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
Going through the data using getWord8 is a no-go. It is just too slow.
My solution so far has been to get the underlying bytestring and work
with that, but obviously defeats the purpose of using the Get monad.
What might be a better solution?
hGetArray with IOUArrays goes perty fast.
Perhaps this is similar to what you're looking for.
http://openquark.org/Open_Quark/Welcome.html
It's a pure, lazy language for the JVM. I haven't used it myself, but I
would imagine that
it would have a Java FFI.
Cheers,
- Tim
On Mon, Feb 8, 2010 at 6:42 PM, Tony Morris tonymor...@gmail.com
Eidhof ch...@eidhof.nl wrote:
I don't think it's pure. I would definitely use a pure language on the JVM,
but IIRC Open Quark / Cal is an impure language. For example, from the
library documentation: printLine :: String - ().
-chris
On 9 feb 2010, at 15:31, Tim Wawrzynczak wrote:
Perhaps
Last time I tried something like this [on Windows], it didn't seem to
work. I wanted to trap arrow keys and so forth, but they seem to be being
used for input history. (I.e., pressing the up-arrow produces
previously-entered lines of text, and none of this appears to be reaching
the Haskell
Hi Mark,
I recently ported Conrad Barski's 'Casting SPELs in Lisp' to Haskell (a text
adventure game).
I had some of these problems as well, and you can find my code on Hackage
(the package is called Advgame).
Some things in there might be of some help.
Cheers,
- Tim
On Sun, Jan 17, 2010
At a quick glance,
+5 Awesome.
Cheers
- Tim
On Thu, Jan 14, 2010 at 3:03 PM, James Russell j.russ...@alum.mit.eduwrote:
I am pleased to announce the Functional Programming Bibliography
at http://www.catamorphism.net/
The functional programming bibliography was created in the hope
Oh also, I noticed that you say it's powered by Haskell.
Would you mind sharing some of your architectural details as they relate to
Haskell with us?
On Thu, Jan 14, 2010 at 3:11 PM, Tim Wawrzynczak inforichl...@gmail.comwrote:
At a quick glance,
+5 Awesome.
Cheers
- Tim
On Thu, Jan
and tools?
Mostly related to academia? Spread out around several areas?
Tim Newsham | www.thenewsh.com/~newsham | thenewsh.blogspot.com
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
file
a bug report or post to the glasgow-haskell-users list with me CCed.
Cheers,
Tim
--
Tim Chevalier * http://cs.pdx.edu/~tjc * Often in error, never in doubt
The higher you climb, the more you show your ass. -- Alexander Pope
___
Haskell-Cafe mailing
.
It works very similarly to his final program,
except it can be run in a loop, instead of one function at a time. It's
available at http://hackage.haskell.org/package/Advgame-0.1.1
if anyone is interested.
Cheers,
- Tim
___
Haskell-Cafe mailing list
the fold
over the allInputs list.
Cheers,
- Tim
On Thu, Oct 29, 2009 at 2:27 PM, Hector Guilarte hector...@gmail.comwrote:
Hi cafe,
I'm trying to implement a Perceptron in Haskell and I found one in:
http://jpmoresmau.blogspot.com/2007/05/perceptron-in-haskell.html (Thanks
JP Moresmau
! Be careful when using any function that
starts with the word 'unsafe'! You may kill a kitten! And I guess this
says something about using 'unsafe' functions...
http://upload.wikimedia.org/wikipedia/en/1/11/God-kills-kitten.jpg (NSFW)...
Cheers and sorry all,
Tim
On Thu, Oct 22, 2009 at 1:59 PM
which is local to the next function (effectively creating a closure
over it).
Cheers,
- Tim
On Wed, Oct 21, 2009 at 12:34 PM, michael rice nowg...@yahoo.com wrote:
There's a thread on the plt-scheme list about creating a function of NO
arguments named NEXT that just returns the number of times
Here's an example in the IO monad:
import Data.IORef
import System.IO.Unsafe
counter = unsafePerformIO $ newIORef 0
next = do
modifyIORef counter (+1)
readIORef counter
Naturally, this uses unsafePerformIO, which as you know, is not kosher...
Cheers,
- Tim
On Wed, Oct 21, 2009 at 1:00
will print [1,2,3] which is the result of calling 'foo' 3
times.
But technically then, mkNext is just an IO action which returns an IO action
;)
and not a function which will return the next value each time it is called,
hence the need to extract the value from mkNext, then use it...
Cheers,
Tim
constraint, there are the functions 'when' and
'unless.' They allow conditional evaluation of expressions in a monadic
context. For example,
main = do
line - getLine
when (line == hello) putStrLn Hello back!
Cheers,
- Tim
On Wed, Oct 21, 2009 at 7:43 PM, michael rice nowg...@yahoo.com wrote
I was poking around once trying to find something like that and stumbled
across this: http://wiki.cs.pdx.edu/forge/riviera.html
Cheers,
Tim
On Wed, Feb 11, 2009 at 8:22 AM, Cristiano Paris
cristiano.pa...@gmail.comwrote:
I wonder whether this can be done in Haskell (see muleherd's comment
Yeah, it's broken in windows. Here's the workaround
courtesy of Alistar Bayley. (ticket 2189)
{-# LANGUAGE ForeignFunctionInterface #-}
import Data.Char
import Control.Monad (liftM, forever)
import Foreign.C.Types
getHiddenChar = liftM (chr.fromEnum) c_getch
foreign import ccall unsafe
I'd also give a read to this website:
http://jekor.com/article/is-haskell-a-good-choice-for-web-applications
Interesting read about a guy who actually used Haskell to create his website
from the ground up.
On Tue, Aug 18, 2009 at 9:56 AM, Colin Paul Adams
co...@colina.demon.co.ukwrote:
Jake
Well, continuations come from Scheme, and by and large, they are usually
used in languages like Scheme (i.e. PLT web server), or Smalltalk (Seaside
web server), but they can be very useful in e.g. cases like yours for making
a convenient way to make a local exit. I did this in one toy game
1 - 100 of 448 matches
Mail list logo
