#7095: Kind-polymorphic typechecking requires better documentation.
--+-
Reporter: schernichkin | Owner:
Type: feature request | Status: new
Priority: normal
#6104: Regression: space leak in HEAD vs. 7.4
-+--
Reporter: simonmar | Owner: igloo
Type: bug | Status: merge
Priority:
#7096: linker fails to load package with binding to foreign library
--+-
Reporter: nus | Owner:
Type: bug | Status: new
Priority: normal|
#7097: linker fails to load package with binding to foreign library
--+-
Reporter: nus | Owner:
Type: bug | Status: new
Priority: normal|
#7087: 'select' fails for very large arguments to 'threadDelay'
+---
Reporter: Gabriel439 | Owner:
Type: bug| Status: closed
Priority: normal
The Seventh ACM SIGPLAN Workshop
on
Programming Languages meets Program Verification (PLPV 2013)
http://plpv.tcs.ifi.lmu.de/
22nd January, 2013
Rome, Italy
Welcome to issue 237 of the HWN, an issue covering crowd-sourced bits
of information about Haskell from around the web. This issue covers the
week of July 15 to 21, 2012.
Quotes of the Week
* Eduard_Munteanu: Sufficiently advanced category theory is
indistinguishable from trolling
*
Nitpick: Your example actually does not lead to an error with GHC, as you
define, but do not use 'foo' in M. Names (like classes) only clash when you
look them up.
Manuel
Lennart Augustsson lenn...@augustsson.net:
It's not often that one gets the chance to change something as
fundamental as
If Lennart's suggestion is combined with GHC's lazy checking for name clashes
(i.e., only check if you ever look a name up in a particular scope), it would
also work in your example.
Manuel
Sittampalam, Ganesh ganesh.sittampa...@credit-suisse.com:
If you’re using unqualified and unrestricted
The ... foo ... in my example was intended to show that module M does
look up 'foo'.
From: Manuel M T Chakravarty [mailto:c...@cse.unsw.edu.au]
Sent: 25 July 2012 08:26
To: Sittampalam, Ganesh
Cc: Lennart Augustsson; Haskell Prime
Subject: Re: Proposal: Scoping rule change
If Lennart's
My point is that if you would rather not get that error when J changes,
you need to use explicit import lists:
Module M
import I (foo)
import J ()
definitioninModuleM = foo
Lennart's proposed change makes explicit import lists unnecessary for
the case where foo is defined inside M
On Fri, Jul 20, 2012 at 10:02:18AM +0100, Ross Paterson wrote:
On Fri, Jul 20, 2012 at 09:34:16AM +0100, Simon Hengel wrote:
Hi Ross,
can you fix this on Hackage? My suggested solution is to again just
remove the test-suite sections from the cabal file, if that is fine with
Richard.
Hello,
I wrote a simple test program as
main = do
withFile a.txt ReadMode (\h - do
c - hGetContents h
putStrLn c)
then I got my expected results: I'm a.txt
but if I changed to
main = do
c - withFile a.txt ReadMode hGetContents
putStrLn c
I got just a empty
On Wed, Jul 25, 2012 at 09:43:48AM +0100, Simon Hengel wrote:
On Fri, Jul 20, 2012 at 10:02:18AM +0100, Ross Paterson wrote:
On Fri, Jul 20, 2012 at 09:34:16AM +0100, Simon Hengel wrote:
Hi Ross,
can you fix this on Hackage? My suggested solution is to again just
remove the test-suite
Hi,
From the withFile doc
(http://hackage.haskell.org/packages/archive/haskell2010/latest/doc/html/Sys
tem-IO.html#v:withFile):
The handle will be closed on exit from withFile, whether by normal
termination or by raising an exception.
Your program is effectively this one
main' :: IO ()
Albert Y. C. Lai tre...@vex.net writes:
On 12-07-23 10:52 PM, Qi Qi wrote:
Foldl has the space leak effect, and that's why foldl' has been
recommended.
foldr (+) and foldl (+) for Int have the same asymptotic costs, both
time and space. See my http://www.vex.net/~trebla/haskell/lazy.xhtml
On 12-07-25 09:06 AM, Mathieu Boespflug wrote:
Albert Y. C. Lai tre...@vex.net writes:
foldr (+) and foldl (+) for Int have the same asymptotic costs, both
time and space. See my http://www.vex.net/~trebla/haskell/lazy.xhtml
Therefore, I do not understand why they are labeled opposite
Let assume, that some computation takes argument and produces value
Either a b. This computation may be represented in for different forms
computePure :: a - Either b c
computeMonad :: a - m (Either b c)
computeApplicative :: app a - app (Either b c)
computeArrow :: arr a (Either b c)
On 25/07/2012, Евгений Пермяков permea...@gmail.com wrote:
Let assume, that some computation takes argument and produces value
Either a b. This computation may be represented in for different forms
...
computeApplicative :: app a - app (Either b c)
...
=
This seems rather more
On 2012-07-25 22:22, Евгений Пермяков wrote:
Let assume, that some computation takes argument and produces value Either a b.
This computation may be represented in for different forms
computePure :: a - Either b c
computeMonad :: a - m (Either b c)
computeApplicative :: app a - app
Hi.
My friend Matvey Aksenov create some useful screen capturing utility for
XMonad.
https://github.com/supki/xmonad-screenshot
It allows capturing all workspaces in single image. Also chosen
workspaces could be filtered by some predicate.
Result image could be filled with horizontal or
Better sent to xmonad@
On Wednesday, July 25, 2012, Dmitry Malikov wrote:
Hi.
My friend Matvey Aksenov create some useful screen capturing utility for
XMonad.
https://github.com/supki/**xmonad-screenshothttps://github.com/supki/xmonad-screenshot
It allows capturing all workspaces in
Welcome to issue 237 of the HWN, an issue covering crowd-sourced bits
of information about Haskell from around the web. This issue covers the
week of July 15 to 21, 2012.
Quotes of the Week
* Eduard_Munteanu: Sufficiently advanced category theory is
indistinguishable from trolling
*
Depending on the context, it may or may not be wise to distinguish
between undefined and [undefined]. This is a matter of strictness,
laziness, and totality. If you identify all bottoms as one, you
essentially restrict yourself to (what might as well be, for the
purposes of this discussion) a
Dear Alexander,
Let me clarify again: by we identify all bottoms I mean that any error
and also nontermination is identified with _|_ . However, I did not mean
that [_|_] is identified with _|_ (since the point of a formal treatment
is exactly to correctly consider the lazy semantics of
Sorry, I forgot to reply to the list.
On 07/26/2012 11:53 AM, Alexander Solla wrote:
(consider, e.g., 'head undefined' vs. 'head [undefined]')
This was a typo, I meant 'tail undefined' vs. 'tail [undefined]'.
I'm not arguing one way or the other (I know what I do, unless there's
a need to do
On 07/26/2012 11:53 AM, Alexander Solla wrote:
The classically valid inference:
(x == y) = _|_ = (y == x) = _|_
Btw: whether this inference is valid or not depends on the semantics of
(==) and that's exactly what I was asking about. In Haskell we just have
type classes, thus (==) is more or
On 7/25/12, Christian Sternagel c.sterna...@gmail.com wrote:
On 07/26/2012 11:53 AM, Alexander Solla wrote:
The classically valid inference:
(x == y) = _|_ = (y == x) = _|_
Btw: whether this inference is valid or not depends on the semantics of
(==) and that's exactly what I was asking
Dear Alexander,
On 07/26/2012 01:09 PM, Alexander Solla wrote:
On 7/25/12, Christian Sternagel c.sterna...@gmail.com wrote:
On 07/26/2012 11:53 AM, Alexander Solla wrote:
The classically valid inference:
(x == y) = _|_ = (y == x) = _|_
Btw: whether this inference is valid or not depends on
Евгений,
The possible extension may look somehow like this:
class Applicative a = Branching a where
branch :: a (Either b c) - (a b - a d) - (a c - a d) - a d
What about the following alternative that does not require an extension?
import Control.Applicative
eitherA :: Applicative f =
Xyne wrote:
I've put together a clean script using various code snippets that I have in my
release scripts:
http://xyne.archlinux.ca/scripts/pacman/#repo-add_and_sign
Just ask if anything is unclear or if you think you've found a bug. If you
need
something customized to your build
Hello,
I'm trying to use the 'makehapkg' script to build Haskell packages, as
suggested by Magnus Therning, but I'm having some issues with it. Though
it works fine for packages without dependencies other than ghc, like
haskell-xdg-basedir (not currently in habs), it fails to install extra
32 matches
Mail list logo
