On Thu, Apr 04, 2013 at 06:29:51PM -0400, Albert Y. C. Lai wrote:
You may think you know what's wrong, but you don't actually know
until you know how to clarify to the beginners. Note: harping on the
word any does not clarify, for the beginners exactly say this:
Yeah, t can be *any* type,
of leaving out quantifiers, but I didn't see an
example of quantifiers in the wrong place. Did I miss one?
Tom
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On Thu, Apr 04, 2013 at 01:15:27PM +, Johannes Waldmann wrote:
Tom Ellis tom-lists-haskell-cafe-2013 at jaguarpaw.co.uk writes:
I didn't see an example of quantifiers in the wrong place.
The example was:
every x satisfies P(x,y) for some y
Oh I see. I interpreted that as lack
efficient, because you're using lists, and
attempting to index into them and measure their lengths. Perhaps a different
data structure is in order.
Thanks
Tom Davie
On 3 Apr 2013, at 17:38, Lone Wolf amslonew...@gmail.com wrote:
http://stackoverflow.com/questions/8940470/algorithm-for-finding
source files: Portions of this code (c)
2013 Tom Murphy. All rights reserved.
ROADMAP:
-- Lenses sound pretty cool, so I've started writing lenses for the Author
type, as well as finding out what a lens is. Maybe one day there'll be
lenses for the Post type, too -- keep your fingers crossed!
-- One
Oh, and happy April 1!
On Mon, Apr 1, 2013 at 6:16 AM, Tom Murphy amin...@gmail.com wrote:
Hi All,
Not particularly happy to announce the non-release of my latest
library, HBlog 0.1. I've been working on it steadily for a long time now,
but it's still not ready.
The library
On Fri, Mar 08, 2013 at 08:53:15PM -0800, Edward Z. Yang wrote:
Are these equivalent? If not, under what circumstances are they not
equivalent? When should you use each?
evaluate a return b
a `seq` return b
return (a `seq` b)
Furthermore, consider:
[...]
- Does the
Roma Tor Vergata, Italy
Enrico PontelliNew Mexico State University, USA
Kristoffer RoseIBM Research, USA
Sukyoung Ryu KAIST, South Korea
Vitor Santos Costa University of Porto, Portugal
Torsten Schaub University Potsdam, Germany
Tom
but I don't
understand. This seems to come from the IdInfo on the Id which is the
binder Test.sum' but [1] says that this information is optional so it
seems strange that such crucial information would be encoded there.
Thanks,
Tom
[1]
http://www.haskell.org/ghc/docs/7.6.2/html/libraries/ghc
On Thu, Mar 14, 2013 at 10:43:14PM +, Simon Peyton-Jones wrote:
| -Original Message-
| From: Tom Ellis
| The -ddump-simpl output below doesn't contain a case corresponding to the
| seq in sum', but the -ddump-prep does. Isn't the output from simpl the
| input to prep? If so
by imprecise?
Tom
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
There's another one...
http://3.bp.blogspot.com/-0-NT1rzFpik/Tpe4sb18gOI/AuM/j2BHO_TgLi4/s1600/calvinball.jpg
Tom
On Tue, Feb 26, 2013 at 7:07 PM, Ben Lippmeier b...@ouroborus.net wrote:
On 27/02/2013, at 10:28 , Corentin Dupont corentin.dup...@gmail.com wrote:
Hello everybody!
I am
On Tue, Feb 26, 2013 at 10:00:32AM -, o...@okmij.org wrote:
Tom Ellis wrote:
To avoid retaining a large lazy data structure in memory it is useful to
hide it behind a function call. Below, many is used twice. It is hidden
behind a function call so it can be garbage collected between
of pessimisation.
Tom
% cat thunkfail.hs
{-# OPTIONS_GHC -fno-warn-unused-binds #-}
import Data.List
million :: Int
million = 10 ^ (6 :: Int)
many :: () - [Int]
many () = [1..million]
different_many :: () - [Int
On Sun, Feb 24, 2013 at 07:12:24PM +0100, Joachim Breitner wrote:
You should try:
million :: () - Int
million _ = 10 ^ (6 :: Int)
many :: () - [Int]
many x = [1..million x]
Thanks Joachim, but that doesn't work either.
Tom
% cat thunkfail.hs
{-# OPTIONS_GHC -fno-warn-unused-binds
(5050,5050)
./A +RTS -M750k 0.06s user 0.00s system 97% cpu 0.069 total
Thanks Don, that's good to know. I am not currently bitten by this issue in
any production code, but I am concerned it will crop up when I least expect
it.
Tom
___
Haskell-Cafe
Prelude import Data.Ratio
Prelude Data.Ratio 93 % 10 - (2 * 9 % 2)
3 % 10
Floating point sucks, avoid it if you can.
Thanks
Tom Davie
On 16 Jan 2013, at 13:25, ivan dragolov i...@dragolov.net wrote:
9.3 - (2 * 4.5) = 0.3007
I expected 0.3
?
--
Иван Драголов
that it is
bikeshedding. One lesson I learned from Haskell is that syntax is much more
important than I previously realised.
Tom
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
/
-Tom
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
. On the project, we are partnered with
academics from the University of Pennsylvania, Harvard, and
Northeastern University.
Send a resume If interested.
Thanks!
-Tom
[1] http://www.crash-safe.org/
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http
How does this compare with other high-level Haskell db libraries?
Tom
On Sep 13, 2012 2:25 PM, Boris Lykah lyk...@gmail.com wrote:
I am happy to announce a new version of Groundhog, a library for fast
high-level database access:
http://hackage.haskell.org/package/groundhog
http
definitions?
Tom
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
of
not-yet-written packages, of course).
Tom
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
In practice, the amount of time you have to spend testing each function, to
make sure its IO doesn't trip up in some corner case, is usually greater
than the amount of time a rewrite-for-IO would take.
Tom
On Jun 28, 2012 2:54 PM, Dominique Devriese
dominique.devri...@cs.kuleuven.be wrote
Just to play devil's advocate, if you look back at the list, KC has
written a lot of helpful and informative messages in the past.
Tom
On 5/23/12, Bardur Arantsson s...@scientician.net wrote:
On 05/24/2012 04:31 AM, Brandon Allbery wrote:
On Wed, May 23, 2012 at 10:19 PM, Bardur Arantsson
s
or array, cabal tells me to add those to .cabal
build-depends.
So how can I use the Data.Array.Unboxed package together with all the stuff
from base that is not in haskell98?
Thanks,
Tom
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http
Apologies, I fixed this. It only affects the really old Array module, which
I can live without. Data.Array.Unboxed is fine.
Tom
On Tue, May 22, 2012 at 10:41 AM, Tom Nielsen taniel...@gmail.com wrote:
Dear cafe,
I have just upgraded to GHC 7.4, and now I run into some compilation
problems
! Now go take a break; make some cookies - here's a recipe
Tom
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
stuff like inline help to Just Work.
Tom
On 25 March 2012 08:26, Heinrich Apfelmus apfel...@quantentunnel.de wrote:
Tom Doris wrote:
If you're interested in UI work, ideally we'd have something similar
to RStudio as an environment, a simple set of windows encapsulating an
editor, a repl
it's definitely worth it for the code clarity and type
checking, to say nothing of the pre-optimization performance and
robustness.
Best of luck, happy to share some preliminary code with you directly
if you're interested!
Tom
On 21 March 2012 17:24, Ben Jones ben.jamin.pw...@gmail.com wrote:
I
If you want to do Haskell audio synthesis, you could also use
hsc3 (good start here: http://slavepianos.org/rd/ut/hsc3-texts/). With
hsc3 you can start on serious audio synthesis with only a few lines of
Haskell. In my opinion it could use a much larger community.
Tom
On 3/22/12, Heinrich
Sorry; make that http://slavepianos.org/rd/ut/hsc3-texts/hsc3-tutorial.html
On 3/22/12, Tom Murphy amin...@gmail.com wrote:
If you want to do Haskell audio synthesis, you could also use
hsc3 (good start here: http://slavepianos.org/rd/ut/hsc3-texts/). With
hsc3 you can start on serious
The messages are replies to messages on this list; I think it's just a
simple smartphone subject/message mixup
Tom
On Mar 17, 2012 4:44 PM, Jake McArthur jake.mcart...@gmail.com wrote:
This mailing list is not Twitter. Please stop sending emails without
meaningful content.
On Mar 17, 2012 12
There are some substantial technical challenges:
http://www.haskell.org/haskellwiki/GHC:FAQ#Why_isn.27t_GHC_available_for_.NET_or_on_the_JVM.3F
Not that it can't be done, but there's nothing ready yet.
Tom (IRC: amindfv)
On 2/23/12, ARJANEN Loïc Jean David arjanen.l...@gmail.com wrote:
Hello
I'd listen.
With good editing and good discussion, this could be a nice addition
to my (bi)week.
Tom (amindfv)
On 2/22/12, Christopher Done chrisd...@googlemail.com wrote:
Show of hands, who would be interested in working on a podcast weekly
or biweekly and what would you like to provide
for widespread use (a security setting is to only
run software from the App Store, and I'd like to have my software
function on users' computers.)
1.0) Aren't you unable to put software under the GPL or certain
other open-source licenses on the App Store?
amindfv / Tom
On 2/19/12, Austin Seipp mad@gmail.com wrote:
On Sun, Feb 19, 2012 at 6:01 PM, Tom Murphy amin...@gmail.com wrote:
0) Distributing non-Cocoa-built apps, even if you're approved by Apple
Do you just mean binaries that you expect users run under
/usr/local/bin or something, not app bundles
money.
- amindfv / Tom
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
,[])
afmap f (s0, i:is) = (sn, o:os) where
(s1, o) = f (s0,i)
(sn, os) = afmap f (s1, is)
f (s,i) = (s', s') where s' = s + i
is = [1,1,1,1,1]
os = afmap f (0,is) -- (5,[1,2,3,4,5])
Cheers,
Tom
___
Haskell-Cafe mailing list
Haskell-Cafe
) = {-# SCC plineb #-} Item x : Comma : pline
rs
pline (Comma : []) = {-# SCC plinec #-} Comma : Item S.empty : Comma :
Item S.empty : []
pline (Comma : rs) = {-# SCC plined #-} Item S.empty : Comma : pline rs
pline (Newline : rs ) = []
pline [] = []
On 17 February 2012 23:16, Tom Doris tomdo
the bytestring-csv package appears to have a bug whereby empty fields are
dropped completely from the row, which is different to Text.CSV , which
will return an empty field in the parse result. I'd argue this is a bug in
bytestring-csv, anyone know whether this has been raised before, or know of
a
I'm using ghci + hmatrix and a few other packages as a Haskell based
replacement for Matlab, everything works well so far in terms of available
functionality. However, I have encountered an issue when running in ghci on
x86_64 systems - calls into functions that in turn call gsl functions will
Could someone with more knowledge of the project please update
http://www.haskell.org/haskellwiki/Web/Databases_and_Persistence, to
reflect the move from happstack-state to acid-state?
Thanks,
Tom
On 2/11/12, dag.odenh...@gmail.com dag.odenh...@gmail.com wrote:
On 10 February 2012 23:09
.
amindfv / Tom
On 2/13/12, Greg Weber g...@gregweber.info wrote:
Hi Sergiu,
Thanks you for your interest in that proposal. I rushed it off a year
ago. Since then we have made a lot of improvements to Persistent and
the library forms a basic building block for most Yesod users and
other Haskellers
It seems that all tutorials and resources for Persistent use Template
Haskell along with several Yesod specifics.
But, I could be wrong, or new tutorials could be written.
Tom
On 2/13/12, Michael Snoyman mich...@snoyman.com wrote:
Actually, Persistent is fully usable without any special syntax
, of course.
Tom
[0]
Prelude limited == worst
False
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On 2/13/12, Sergiu Ivanov unlimitedscol...@gmail.com wrote:
[...]
a stable, flexible, and
easy-to-work-with, already existing storage interface should allow
Haskell programmers to focus less on IO and more on the purely
functional logic.
+1 - Very exciting!
Tom
access
it through the ActiveRecord or Persistent API, it gets turned into
a very limited store, with the SQL power of SQLITE or MongoDB.
Tom Limited /= Worst, though [0].
Tom The popularity of SQLite and NoSQL prove that sometimes a limited
Tom feature set is worth the gains in abstraction
Hi,
Is it common to use happstack-state without happstack for
real-world code (web or otherwise)?
Thanks,
amindfv / Tom
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Does this mean we're going to see music FRP examples soon?!
amindfv / Tom
On Feb 9, 2012 2:17 PM, Heinrich Apfelmus apfel...@quantentunnel.de
wrote:
Dear list,
the Show class is extremely useful for exploring Haskell in a terminal,
but sometimes, I just want something fancier. For instance
It's not as efficient for Maps, but you might want to look at the
swapper package:
http://hackage.haskell.org/package/swapper
It transfers Haskell data structures (any functors) directly to and from disk.
Tom
On 1/23/12, Krzysztof Skrzętnicki gte...@gmail.com wrote:
From my experience I can
On 1/18/12, MigMit miguelim...@yandex.ru wrote:
[..]
(it really is a JavaScript trick).
In the interest of Wikipedia-style fact-citation, here's a quote from Wikipedia:
During the blackout, Wikipedia is accessible on mobile devices and
smart phones. You can also view Wikipedia normally by
is a relatively recent addition [1].
-Tom
[1] http://hackage.haskell.org/trac/ghc/ticket/3476
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
back the parser state so that a new parse can be tried.
Care to share your code?
amindfv / Tom
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
have anything to do with each other, which makes talking across communities
more difficult.
amindfv / Tom
[0] http://www.haskell.org/haskellwiki/Eager_evaluation
[1]
http://learnyousomeerlang.com/the-hitchhikers-guide-to-concurrency#dont-panic,
paragraph 4
[2]
http://book.realworldhaskell.org
realworldhaskell.org/book
On Dec 25, 2011 1:46 AM, Eugene Kirpichov ekirpic...@gmail.com wrote:
See subject.
Is this expected?
--
Eugene Kirpichov
Principal Engineer, Mirantis Inc. http://www.mirantis.com/
Editor, http://fprog.ru/
___
the GC options passed to the RTS.
thanks!
Tom
On Friday, 16 December 2011 at 09:20, Mikolaj Konarski wrote:
On Mon, Oct 10, 2011 at 15:55, Tom Thorne thomas.thorn...@gmail.com
(mailto:thomas.thorn...@gmail.com) wrote:
Yes I will try to run threadscope on it, I tried it before and the event
On Dec 14, 2011 1:33 AM, Ian-Woo Kim ianwoo...@gmail.com wrote:
Hi, Ivan,
I modified hxournal. New source code is now on github repository.
https://www.github.com/wavewave/hxournal
Are these changes reflected on Hackage?
amindfv / Tom
Now it has a very rudimentary config file. The config
To clarify, by hack I meant that it seemed like a workaround specifically
to keep case in the OP's code, when it seemed like they were looking for
the functionality of guards.
amindfv / Tom
On Dec 11, 2011 1:39 PM, Yitzchak Gale g...@sefer.org wrote:
Brandon Allbery wrote:
case
isPalindrome s
isPalindrome word
| (word == reverse word) = putStrLn (word ++ is a palindrome)
| otherwise = putStrLn (word ++ is not a palindrome)
amindfv / Tom
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http
under the direction of Tom Schrijvers.
The successful applicant has a master degree in Computer Science or
equivalent. Ideally, she/he will also have a strong, documented
interest in doing research. Strong problem-solving and programming
skills are essential. Prior knowledge of purely functional
user
interfaces, Internet applications, XML, databases, formal methods and model
checking.
The proceedings will be published as an LNCS volume. The proceedings
of the previous meeting (FLOPS 2010) were published as LNCS 6009.
PC co-Chairs
- Tom Schrijvers (Ghent
Is the list the right place to ask about this?
I was trying to access Hackage today too, and didn't know who to let know
about the problem.
amindfv / Tom
On Thu, Dec 1, 2011 at 11:59 AM, Edgar Gomes Araujo
talktoed...@gmail.comwrote:
Hi everybody,
Is hackage.haskell.org down? I'm trying
Or set up a system like this:
http://www.linux.fm/
:)
amindfv / Tom
On Wed, Nov 23, 2011 at 11:38 AM, heathmatlock heathmatl...@gmail.comwrote:
Stream podcasts on functional programming.
On Tue, Nov 22, 2011 at 5:39 AM, Ben Wright bwright...@gmail.com wrote:
A while back I somehow managed
/ Tom
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
--
prof. dr. ir. Tom Schrijvers
Programming Languages Group
Department of Applied Mathematics and Computer Science
University of Ghent
Krijgslaan 281 S9
9000 Gent
Belgium
Phone: +32 9 264 4805
http://users.ugent.be/~tschrijv/
___
Haskell-Cafe mailing
applications, XML, databases, formal methods and model
checking.
The proceedings will be published as an LNCS volume. The proceedings
of the previous meeting (FLOPS 2010) were published as LNCS 6009.
PC co-Chairs
- Tom Schrijvers (Ghent University, Belgium)
- Peter Thiemann
I'm used to (on the east coast US) hearing lambda pronounced LAM-duh.
Duh is an expression of something being stupid, so I don't know about
Haskell having a mascot called Duh the Lamb!
amindfv / Tom
On Nov 16, 2011 4:06 PM, heathmatlock heathmatl...@gmail.com wrote:
On Wed, Nov 16, 2011 at 5
have you tried cabal clean before cabal install ?
Tom
On Fri, Nov 11, 2011 at 12:06 PM, Amy de Buitléir a...@nualeargais.ie wrote:
I wrote a library called AmysGeometry. The only modules in it (so far) are:
Amy/Geometry/ThreeD.hs
Amy/Geometry/UnitSphere.hs
The library compiles just fine
with
minimal effort:
https://github.com/glutamate/space/blob/master/VectorsL.hs
Tom
On Wed, Nov 9, 2011 at 9:56 AM, kaffeepause73 kaffeepaus...@yahoo.de wrote:
Hello,
quick question about unboxed Vectors :
Is it possible to create an unboxed vector of unboxed vector ? :
import qualified
Hi,
Can someone provide guidance on how handle operator precedence and
associativity with Polyparse?
Thanks in advance.
-Tom
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Cap'n:
http://www.mail-archive.com/haskell-cafe@haskell.org/
But I usually just use a search engine.
Tom / amindfv
On Tue, Oct 25, 2011 at 4:27 PM, Captain Freako capn.fre...@gmail.comwrote:
Are the archives of this list searchable?
___
Haskell
was looking for something equivalent to
Text.ParserCombinators.Parsec.Expr.buildExpressionParser. I suppose I
should learn how Parsec implements this under the hood.
-Tom
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org
to work in isolation - but maybe that part of a Haskell typer
wouldn't work in isolation either!
Regards,
Tom
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
The GUI list could definitely use this type of moderation.
Tom / amindfv
On Oct 23, 2011 9:54 PM, Erik de Castro Lopo mle...@mega-nerd.com wrote:
R J wrote:
hey Haskell this is nuts http://www.business10i.com
hey Haskell this is nuts ://xxx.xxx.xxx
Maybe its time to moderate
if their account is hacked.
Tom / amindfv
On Oct 23, 2011 11:09 PM, Conrad Parker con...@metadecks.org wrote:
On 24 October 2011 10:57, Daniel Fischer
daniel.is.fisc...@googlemail.com wrote:
On Monday 24 October 2011, 03:54:09, Erik de Castro Lopo wrote:
R J wrote:
hey Haskell this is nuts http
Ok, I'll bite: what's it need?
- Tom / amindfv
On Fri, Oct 21, 2011 at 1:51 PM, Albert Y. C. Lai tre...@vex.net wrote:
On 11-10-21 03:59 AM, Ivan Lazar Miljenovic wrote:
2011/10/21 Goutam Tmvvo1d_poin...@live.com:
Would you ever see yourself write a web application like Twitter
Thanks, I would except that my code, whilst pure, uses hmatrix, and hmatrix
uses lapack internally and so presumably calls FFI functions. As far as I
know lapack ought to be thread safe, but potentially the way it interfaces
with haskell in hmatrix isn't. I don't want to blame hmatrix since it is
.
On 10 Oct 2011, at 15:44, Tom Thorne wrote:
thanks! I just tried setting -A32M and this seems to fix the parallel GC
problems, I now get a speedup with parallel GC on and performance is the
same as passing -qg. I had tried -H before and it only made things worse,
but -A seems to do the trick.
I'm
be that (at least part of) the reason for your slowdown is that
the parallel GC spends a lot of time waiting for threads to stop.
This would be apparent in Threadscope. (I may be wrong, because even
the single-threaded GC needs to stop all threads)
On 7 October 2011 18:21, Tom Thorne
?
On Mon, Oct 10, 2011 at 3:07 PM, Gregory Collins g...@gregorycollins.netwrote:
On Mon, Oct 10, 2011 at 3:55 PM, Tom Thorne thomas.thorn...@gmail.com
wrote:
Yes I will try to run threadscope on it, I tried it before and the event
log output produced about 1.8GB, and then crashed
without a seg. fault, and the frequency with which it does so seems to
depend on the number of sparks that are being created.
On Thu, Oct 6, 2011 at 1:56 PM, Tom Thorne thomas.thorn...@gmail.comwrote:
I'm trying to narrow it down so that I can submit a meaningful bug report,
and it seems
for BAYSIG is here
https://github.com/glutamate/baysig
Both of these packages depend on a couple of unreleased cabal packages
that can be found in my github account.
Regards,
Tom
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http
:37 PM, Tom Thorne thomas.thorn...@gmail.comwrote:
The only problem is that now I am getting random occasional segmentation
faults that I was not been getting before, and once got a message saying:
Main: schedule: re-entered unsafely
Perhaps a 'foreign import unsafe' should be 'safe'?
I think
I am having some strange performance issues when using SMP parallelism, that
I think may be something to do with GC. Apologies for the large readouts
below but I'm not familiar enough to know what is and isn't relevant!
I have a pure function that is mapped over a list of around 10 values, and
though.
Unfortunately the code is for a paper (nothing to do with computer science
or haskell incidentally), and although I'm planning on open sourcing it, I
can't do that until the paper is published.
thanks again
Tom
On Wed, Oct 5, 2011 at 9:36 PM, Ryan Newton rrnew...@gmail.com wrote:
Hi Tom
at Indicee, but there's little visible activity.
None of these points are in comparison to Frege, which I haven't used at all.
Tom
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
)) = (a, b, 1)
Tom (amindfv)
On Oct 2, 2011 6:04 AM, Du Xi sdiy...@sjtu.edu.cn wrote:
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
. Is there a way around this?
Cheers
Tom
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
I used to have a lot of cabal problems when running a version of the GHC
installed with MacPorts. I notice you're using homebrew. Maybe that's part
of the problem?
Tom
On Sep 22, 2011 8:11 PM, Mariano Cortesi mcort...@gmail.com wrote:
___
Haskell-Cafe
started thinking about writing a medium sized tutorial, perhaps 60
pages or so, covering everything you need to know to be able to write
production quality Haskell code.
This would be such a valuable resource for the community.
Tom
On Mon, Aug 22, 2011 at 9:56 AM, Johan Tibell johan.tib
On 08/21/2011 05:33 AM, Felipe Almeida Lessa wrote:
On Sat, Aug 20, 2011 at 6:26 PM, Tom Schoutent...@zwizwa.be wrote:
data Kl i o = forall s. Kl s (i -s -(s, o))
This is an Arrow. At first I wondered if there was also an associated
Monad, hence the iso function.
Given
data Kl i
On 08/19/2011 08:50 AM, Ryan Ingram wrote:
ki1 :: KI () Int
ki1 = KI @Int (\() s - (s+1, s))
ki2 :: KI () Int
ki2 = KI @() (\() () - ((), 0))
f :: Bool - KI () Int
f x = if x then ki1 else ki2
iso f = KI ?? ??
The problem is that we have multiple possible internal state types!
Aha!
Nice
On 08/18/2011 07:27 AM, o...@okmij.org wrote:
-- Is there a way to make this one work also?
data Kl i o = forall s. Kl (i - s - (s, o))
iso :: (i - Kl () o) - Kl i o
iso f = Kl $ \i s - (\(Kl kl) - kl () s) (f i)
Yes, if you move the quantifier:
type Kl i o = i - Kl1 o
data Kl1 o =
)) - Kl i o,
in a lambda abstraction
The following variables have types that mention s0
s :: s0 (bound at /home/tom/meta/haskell/iso.hs:11:17)
In the pattern: Kl kl
In the expression: \ (Kl kl) - kl () s
In the expression: (\ (Kl kl) - kl () s) (f i
On 08/16/2011 09:23 AM, Stephen Tetley wrote:
{-
I don't think parametric monads will solve your problem though, as you
want a product of the states as the result of bind. Are you really
sure you want this behavior?, I'd imagine it breaks the monad laws
anyway.
-}
It seems that the product
interfaces, Internet applications, XML, databases, formal methods and model
checking.
The proceedings will be published as an LNCS volume. The proceedings
of the previous meeting (FLOPS 2010) were published as LNCS 6009.
PC co-Chairs
- Tom Schrijvers (Ghent University, Belgium
:
Couldn't match type `t' with `Sig s1 b'
`t' is a rigid type variable bound by
the inferred type of f' :: a - t
at /home/tom/meta/ssm/SigHC.lhs:52:7
In the expression: mb
In a case alternative: Signal mb - mb
In the expression: case (f a) of { Signal mb - mb
that they are always
built.
Tom
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
, debug libs, etc)
So in response to the question is there a way to install the HP
without XCode? the answer is pretty much no. Ok. It's a shame, but
thanks for the insight!
Thanks,
Tom
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http
101 - 200 of 681 matches
Mail list logo
