I provide a ThreadScope binary on my site (
http://www.edsko.net/2013/01/24/threadscope-0-2-2/) which runs fine for me
on 10.8.3.
-E
On Mon, Apr 1, 2013 at 8:01 AM, Dominic Steinitz domi...@steinitz.orgwrote:
Alfredo Di Napoli alfredo.dinapoli at gmail.com writes:
Said that,has someone
Hi Malcolm,
Thank you for the thoughtful reply.
I understand you to make the [reasonable] assertion that the presence of {n}
does not constitute a nested context because the existence of a nested
context is determined by the state of the context stack, and thus by L
(rather than the mere
Cool! Works for me. Many thanks, Dominic
On 3 Apr 2013, at 12:40, Edsko de Vries edskodevr...@gmail.com wrote:
I provide a ThreadScope binary on my site
(http://www.edsko.net/2013/01/24/threadscope-0-2-2/) which runs fine for me
on 10.8.3.
-E
On Mon, Apr 1, 2013 at 8:01 AM, Dominic
I absolutely love to use Haskell when teaching
(and I have several years of experience doing it).
And I absolutely dislike it when I have to jump through hoops
to declare types in the most correct way, and in the most natural places.
This is hard to sell to the students. - Examples:
1. for
Hey there!
I wrote one of the guys who originally wrote to Haskell-Cafe 2(?) years
ago, and I was told that there is the Functional-Programming-Sthlm [1] user
group.
I am not sure how active they are, but there is a little mingle next week,
for which you can still register [2]. One of the topics
Hi Johannes.
I know this isn't really an answer, but ...
1. for explicit declaration of type variables, as in
reverse :: forall (a :: *) . [a] - [a]
I have to switch on RankNTypes and/or KindSignatures (ghc suggests).
... you can do this with ExplicitForall rather than RankNTypes,
which
http://stackoverflow.com/questions/8940470/algorithm-for-finding-numerical-permutation-given-lexicographic-index
How would you rewrite this into Haskell? The code snippet is in Scala.
/**
example: index:=15, list:=(1, 2, 3, 4)
*/
def permutationIndex (index: Int, list: List [Int]) :
permutationIndex :: Int → [Int] → [Int]
permutationIndex [] = []
permutationIndex xs =
let len = length xs
max = fac len
divisor = max / len
i = index / divisor
el = xs !! i
in permutationIndex (index - divisor * i) (filter (!= el) xs)
Of course, this is not very
Hi Johannes,
Johannes Waldmann wrote:
I absolutely dislike it when I have to jump through hoops
to declare types in the most correct way, and in the most natural places.
reverse :: forall (a :: *) . [a] - [a]
\ (xs :: [Bool]) - ...
All of this just because it seemed, at some time,
a clever
Hi Tillmann,
On Wed, Apr 3, 2013 at 11:59 PM, Tillmann Rendel
ren...@informatik.uni-marburg.de wrote:
From the type-theoretic point of view, I guess this is related to your view
of what a polymorphic function is.
Do you have a reference to the previous conversation?
but we moved further and
Hi Kim-Ee,
Kim-Ee Yeoh wrote:
[...] I guess this is related to your view of [...]
Do you have a reference to the previous conversation?
Sorry, I mean related to one's view of, not related to Johannes
Waldmanns' view of.
Which seems miles away from what you're alluding to. Full-blown
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
About two weeks ago we got an email (at ghc-users) mentioning that
comparing to 7.6, 7.7.x snapshot would contain (amongst other things),
type level natural numbers.
I believe the package used is at [1].
Can someone explain what use is such package
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
On 03/04/13 20:42, Mateusz Kowalczyk wrote:
About two weeks ago we got an email (at ghc-users) mentioning that
comparing to 7.6, 7.7.x snapshot would contain (amongst other
things), type level natural numbers.
I believe the package used is at
Where is [1]?
On Wed, Apr 3, 2013 at 3:42 PM, Mateusz Kowalczyk
fuuze...@fuuzetsu.co.ukwrote:
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
About two weeks ago we got an email (at ghc-users) mentioning that
comparing to 7.6, 7.7.x snapshot would contain (amongst other things),
type level
Thanks Edsko, the app is awesome and it's starting just fine.
Even though this fixes my problem, it doesn't solve the root, namely why it
was failing.
Can you tell me a bit more about the dark magic you used to make it work?
Which GHC version did you use?
Thanks a lot,
A.
On 3 April 2013
Hello cafe,
I'm happy to announce the release of my first package antiquoter [1], a
combinator library for writing quasiquoters and antiquoters. The main aim
is to simplify their definitions and reduce copy-and-paste programming.
The main feature the current version is trying to solve is code
Is it just me or have some of the old Haskell Platform releases
disappeared from haskell.org?
The 2010.x links from http://www.haskell.org/platform/prior.html also
point to non-existent pages.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
On 4/04/2013, at 5:59 AM, Tillmann Rendel wrote:
As I understand it, in ML, it seemed to be a clever idea to not have type
signatures at all.
Wrong. In ML, it seemed to be a clever idea not to *NEED* type signatures,
and for local definitions they are very commonly omitted.
But you can
On Wed, Apr 3, 2013 at 8:28 AM, Johannes Waldmann
waldm...@imn.htwk-leipzig.de wrote:
All of this just because it seemed, at some time,
a clever idea to allow the programmer to omit quantifiers?
(I know, mathematicians do this all over the place,
but it is never helpful, and especially not
Welcome to issue 264 of the HWN, an issue covering crowd-sourced bits
of information about Haskell from around the web. This issue covers the
week of March 17 to 30, 2013.
Quotes of the Week
* ddarius: (f x) is a partial application iff
f x == (curry (uncurry f) x)
* flebron: Hey, I
Geoffrey Mainland mainl...@apeiron.net:
Fantastic, glad you got it working! Maybe it's time for me to send
Trevor a pull request...
That sounds like an excellent idea!
Manuel
On 04/01/2013 04:27 PM, Peter Caspers wrote:
indeed, not very helpful ...
When I installed Cuda the latest driver
Hi Geoff,
Yes, please do!
-T
On 02/04/2013, at 3:01 AM, Geoffrey Mainland mainl...@apeiron.net wrote:
Fantastic, glad you got it working! Maybe it's time for me to send
Trevor a pull request...
Geoff
On 04/01/2013 04:27 PM, Peter Caspers wrote:
indeed, not very helpful ...
When I
On 13-04-03 07:39 PM, Alexander Solla wrote:
There's your problem. Mathematicians do this specifically because it is
helpful. If anything, explicit quantifiers and their interpretations
are more complicated. People seem to naturally get how scoping works in
mathematics until they have to
On 4/3/13 11:46 PM, Albert Y. C. Lai wrote:
On 13-04-03 07:39 PM, Alexander Solla wrote:
There's your problem. Mathematicians do this specifically because it is
helpful. If anything, explicit quantifiers and their interpretations
are more complicated. People seem to naturally get how
24 matches
Mail list logo
