#4063: target is not a module name or a source file
--+-
Reporter: beroal | Owner:
Type: feature request | Status: closed
#4070: Don't use sh to run boot.
-+--
Reporter: simonpj |Owner:
Type: bug | Status: new
Priority: normal|Milestone:
#4065: Inconsistent loop performance
-+--
Reporter: rl|Owner:
Type: bug | Status: new
Priority: normal|
#4066: hSetEncoding only sets the encoding for the read side of a duplex Handle
-+--
Reporter: simonmar |Owner: simonmar
Type: bug | Status: merge
#1349: Generalise the ! and UNPACK mechanism for data types, to unpack function
arguments
-+--
Reporter: simonpj |Owner:
Type: task | Status: new
#4071: minor error in ghc manual regarding type defaulting
-+--
Reporter: rwbarton | Owner:
Type: bug | Status: new
Priority: normal|
#1349: Generalise the ! and UNPACK mechanism for data types, to unpack function
arguments
-+--
Reporter: simonpj |Owner:
Type: task | Status: new
#4072: Local package DB doesn't take preference over global DB
-+--
Reporter: tibbe | Owner:
Type: bug | Status: new
Priority: normal|
#4072: Local package DB doesn't take preference over global DB
-+--
Reporter: tibbe | Owner:
Type: bug | Status: new
Priority: normal|
-- Apologies for multiple copies --
VSTTE 2010: Workshops on Theories, Tools and Experiments
Edinburgh, Scotland, 19th August 2010
(*** only 1 week to go! *)
The Third International Conference on Verified Software: Theories,
Tools, and Experiments
Friends
Many of you will know that I've been muttering about re-engineering GHC's type
inference engine for some time now. Dimitrios, Tom, Martin and I have just
completed an epic paper describing the Glorious New Framework that forms the
substance of the above mutterings:
No, it's aimed at beginning-level programming students,
especially those who are struggling with the idea of
recursion.
So, not only is it not intended as a full-featured real world
programming language, but it is definitely not suited for
that purpose:
-- Very small set of build-in functions.
Ivan Miljenovic wrote:
Heinrich Apfelmus wrote:
Yes, the integers are just indexes. Of course, the example with the even
integers is a bit silly; but if the integers are actually indexes, then
it's conceptually cleaner to make them abstract, i.e.
data Node -- constructors are not
I'd also think of Harvard (Morrisset), Tufts (Ramsey), Portland State (Jones,
Sheard), Yale (Hudak), North Eastern (Wand, Felleisen, Shivers), Utah (Flatt),
Chicago (Reppy, MacQueen), North Western (Findler).
Simon
From: haskell-cafe-boun...@haskell.org
Heinrich Apfelmus apfel...@quantentunnel.de writes:
I'd be happy with either one. :) In both cases, I want to specify a
custom vertex type.
Except an abstract type isn't a custom vertex type...
I can either do that directly if the library permits, though I think the
solution with associated
Heinrich Apfelmus schrieb:
Ivan Miljenovic wrote:
I'm not sure I understand what you're saying here: first you said you
wanted to be able to specify a vertex type, now you're saying that you
don't want to know what the vertex type even is (except that it's some
abstract Node type)? Whilst
Henning Thielemann schlepp...@henning-thielemann.de writes:
Heinrich Apfelmus schrieb:
Ivan Miljenovic wrote:
I'm not sure I understand what you're saying here: first you said you
wanted to be able to specify a vertex type, now you're saying that you
don't want to know what the vertex type
On 14 May 2010 00:10, Derek Elkins derek.a.elk...@gmail.com wrote:
On Thu, May 13, 2010 at 10:49 AM, Edward Amsden eca7...@cs.rit.edu wrote:
On Wed, May 12, 2010 at 3:29 PM, Peter Robinson thaldy...@gmail.com wrote:
As far as I know, TChan needs the 'retry' combinator which requires GHC's
On Mon, 10 May 2010, Max Cantor wrote:
Based on some discussions in #haskell, it seemed to be a consensus that
using a modified continuation monad for Error handling instead of
Eithers would be a significant optimization since it would eliminate a
lot of conditional branching (everytime = is
Ozgur Akgun wrote:
In this case I think you should either make it a separate package, or don't
hide it in this module. It looks like an easy way to call Ubigraph from
Hhaskell, and there is no apparent alternative (in hackage) so why hide it?
I've contacted Kohei Ozaki, the author of
The new version (0.2.0.1) is on Hackage.
vacuum-ubigraph now depends on Hubigraph, basic customization is now
possible, e.g.:
import System.Vacuum.Ubigraph
import Graphics.Ubigraph
myNodeStyle n = map (setColor #ff) $ defaultNodeStyle n
where
setColor color (VColor _) =
Hi,
an idea recently crossed my mind that describes a (possibly?) useful way
of accessing XML data from Haskell that is very memory efficient – at
least as long as you only read the XML; for XML processing and
generation, other existing libraries are probably well suited.
Given a (possibly very
Hello,
i'm playin' around with GHCs Haskell and some extensions. I'm already aware of
that functional dependencies are very very tricky, but there is something I
don't understand about there implementation in GHC. I've constructed my own
TypeClass Num providing a signature for (+), having
Friends
Many of you will know that I've been muttering about re-engineering GHC's type
inference engine for some time now. Dimitrios, Tom, Martin and I have just
completed an epic paper describing the Glorious New Framework that forms the
substance of the above mutterings:
On Fri, May 14, 2010 at 02:37:19PM +1000, Ivan Miljenovic wrote:
On 13 May 2010 04:12, Brent Yorgey byor...@seas.upenn.edu wrote:
* Demand More of Your Automata by Aran Donohue
Great, because of Aran I now can't change some of the bits of API in
graphviz without making the code
Brent Yorgey byor...@seas.upenn.edu writes:
On Fri, May 14, 2010 at 02:37:19PM +1000, Ivan Miljenovic wrote:
On 13 May 2010 04:12, Brent Yorgey byor...@seas.upenn.edu wrote:
* Demand More of Your Automata by Aran Donohue
Great, because of Aran I now can't change some of the bits of
Julian Fleischer wrote:
Hello,
i'm playin' around with GHCs Haskell and some extensions. I'm already aware of that functional
dependencies are very very tricky, but there is something I don't understand about
there implementation in GHC. I've constructed my own TypeClass Num providing a
Hello Julian,
Friday, May 14, 2010, 4:18:42 PM, you wrote:
Now, if I type
3 + 4
it does not work, and i really don't understand why. If i ask GHCi
for 3's type ($ :t 3) it will answer 3 :: (Prelude.Num t) = t.
But, if 3 and 4 are Prelude.Nums and there is an instanfe Num x x x
for x of
Hi Julian
Variations of this one come up quite often, in a nutshell the
typechecker doesn't use the instance context in the way you are
expecting:
instance (Prelude.Num x) = Num x x x where
^^^
instance context
GHC takes less notice of the context than you
All of STM (Software Transactional Memory) is GHC-specific.
Hm, it's odd that only TChan mentions it...
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On Friday 14 May 2010 15:32:10, Bulat Ziganshin wrote:
Hello Julian,
Friday, May 14, 2010, 4:18:42 PM, you wrote:
Now, if I type
3 + 4
it does not work, and i really don't understand why. If i ask GHCi
for 3's type ($ :t 3) it will answer 3 :: (Prelude.Num t) = t.
But, if 3 and 4
If I notice a new library version I'll be happy to make the requisite
changes myself, too :)
Aran
On Fri, May 14, 2010 at 9:30 AM, Ivan Lazar Miljenovic
ivan.miljeno...@gmail.com wrote:
Brent Yorgey byor...@seas.upenn.edu writes:
On Fri, May 14, 2010 at 02:37:19PM +1000, Ivan Miljenovic
On Fri, May 14, 2010 at 11:30:40PM +1000, Ivan Lazar Miljenovic wrote:
Brent Yorgey byor...@seas.upenn.edu writes:
On Fri, May 14, 2010 at 02:37:19PM +1000, Ivan Miljenovic wrote:
On 13 May 2010 04:12, Brent Yorgey byor...@seas.upenn.edu wrote:
* Demand More of Your Automata by
I'm not knowledgeable enough in type systems to understand the paper, therefore
I do not know if this email answers anything about your request for comments.
For what I understand of the current possibilities of GHC, being able to use
types for ensuring the axioms of algebra (groups, rings and
On Fri, May 14, 2010 at 02:18:42PM +0200, Julian Fleischer wrote:
Hello,
i'm playin' around with GHCs Haskell and some extensions. I'm already aware
of that functional dependencies are very very tricky, but there is
something I don't understand about there implementation in GHC. I've
The primary problem I see with this is that XML content is
fundamentally text, not bytes. Using your types, two XML documents
with identical content but different encodings will have different
Haskell values (and thus be incorrect regarding Eq, Ord, etc).
Additionally, since the original
In this presentation
http://norfolk.cs.washington.edu/htbin-post/unrestricted/colloq/details.cgi?id=907
the speaker talks about F# on .Net platform. Early on in the talk he says
that they did F# because haskell would be hard to make as a .Net
language.Does anyone know what features of
dmehrtash:
In this presentation
http://norfolk.cs.washington.edu/htbin-post/unrestricted/colloq/details.cgi?id=
907
the speaker talks about F# on .Net platform. Early on in the talk he says
that they did F# because haskell would be hard to make as a .Net language.
Does anyone know
On Fri, May 14, 2010 at 08:57:42AM -0700, John Millikin wrote:
Additionally, since the original bytestring is shared in your types,
potentially very large buffers could be locked in memory due to
references held by only a small portion of the document. Chopping a
document up into events or
Hello Don,
Friday, May 14, 2010, 9:43:38 PM, you wrote:
Most .NET libraries are imperative, use mutable state -- so binding to
they are also OOP. ocaml supports OOP while haskell doesn't
--
Best regards,
Bulatmailto:bulat.zigans...@gmail.com
Would there be issues (lazy evaluation, type system...) with other
languages calling a Haskell code in a hypothetical Haskell in .NET?
Daryoush
On Fri, May 14, 2010 at 10:43 AM, Don Stewart d...@galois.com wrote:
dmehrtash:
In this presentation
Hi,
Am Freitag, den 14.05.2010, 15:31 -0300 schrieb Felipe Lessa:
On Fri, May 14, 2010 at 08:57:42AM -0700, John Millikin wrote:
Additionally, since the original bytestring is shared in your types,
potentially very large buffers could be locked in memory due to
references held by only a
dmehrtash:
Would there be issues (lazy evaluation, type system...) with other languages
calling a Haskell code in a hypothetical Haskell in .NET?
There are always issues, but conceptually it is no harder than calling
Haskell from C, which is relatively straight forward.
You did it wrong. All you did was Church encode the Either type.
Your bind is still doing a case-analysis. All you have to do is use
ContT r (Either e). The bind implementation for ContT is completely
independent of the underlying monad. It doesn't even require the m in
ContT r m to be a
On Fri, May 14, 2010 at 4:25 PM, Derek Elkins derek.a.elk...@gmail.com wrote:
You did it wrong. All you did was Church encode the Either type.
Your bind is still doing a case-analysis. All you have to do is use
ContT r (Either e). The bind implementation for ContT is completely
independent
On Fri, May 14, 2010 at 4:53 PM, Antoine Latter aslat...@gmail.com wrote:
On Fri, May 14, 2010 at 4:25 PM, Derek Elkins derek.a.elk...@gmail.com
wrote:
You did it wrong. All you did was Church encode the Either type.
Your bind is still doing a case-analysis. All you have to do is use
ContT
Aran Donohue aran.dono...@gmail.com writes:
If I notice a new library version I'll be happy to make the requisite
changes myself, too :)
One thing I think I should mention: it might also be helpful to say
which packages your article uses rather than the modules (as that
involves more work
On Fri, 2010-05-14 at 10:40 -0700, Daryoush Mehrtash wrote:
In this presentation
http://norfolk.cs.washington.edu/htbin-post/unrestricted/colloq/details.cgi?id=907
the speaker talks about F# on .Net platform. Early on in the talk he
says that they did F# because haskell would be hard to
On May 14, 2010, at 20:24 , Brandon Simmons wrote:
The other baffling thing is this: if the debugging line 426 is
uncommented, then even running:
$ runghc Befunge.hs --quiet mycology.b98
...will fail. But all we're doing is a call to `putStr`! Why would
that trigger an error?! Maybe there
On Saturday 15 May 2010 02:53:43, Brandon S. Allbery KF8NH wrote:
On May 14, 2010, at 20:24 , Brandon Simmons wrote:
The other baffling thing is this: if the debugging line 426 is
uncommented, then even running:
$ runghc Befunge.hs --quiet mycology.b98
...will fail. But all we're
On Fri, May 14, 2010 at 8:39 PM, Maciej Piechotka uzytkown...@gmail.com wrote:
1. Haskell Class/Type famillies/... are conceptually different then
classes and interfaces.
I believe interfaces would be roughly equivalent to the subset of
single-parameter type classes such that:
- All type
On Fri, 2010-05-14 at 22:54 -0400, C. McCann wrote:
On Fri, May 14, 2010 at 8:39 PM, Maciej Piechotka uzytkown...@gmail.com
wrote:
1. Haskell Class/Type famillies/... are conceptually different then
classes and interfaces.
I believe interfaces would be roughly equivalent to the subset of
52 matches
Mail list logo
