erina Komendantskaya University of Dundee
Henrik NilssonUniversity of Nottingham
Iavor Diatchki (chair)Galois
J. Garrett Morris University of Edinburgh
Joachim Breitner University of Pennsylvania
Juriaan Hage Utrecht University
Lennart AugustssonFac
erina Komendantskaya University of Dundee
Henrik NilssonUniversity of Nottingham
Iavor Diatchki (chair)Galois
J. Garrett Morris University of Edinburgh
Joachim Breitner University of Pennsylvania
Juriaan Hage Utrecht University
Lennart Augus
will
give
the program committee a chance to provide feedback and help draw out the key
ideas.
Program Committee
=
Adam Gundry Well-Typed
Ekaterina Komendantskaya University of Dundee
Henrik NilssonUniversity of Nottingham
Iavor Diatchki (chair)Galois
Hello,
I am pleased to announce a new version of `graphmod`---a program that helps
you visualize the import dependencies between the modules in your Haskell
programs.
The new feature in version 1.2.4 is support for pruning the dependency
graph, which is enabled with the flag -p or --prune-edges.
o are already eligible to work in the US.
-Iavor
On Thu, Jun 27, 2013 at 9:03 AM, Alejandro Serrano Mena
wrote:
> Hello,
> Are there any specific details to consider when applying? For example, is
> living in the US or having a visa required for application?
>
> Thanks in advance.
&
Hello,
Galois is hiring! We're looking for researchers, principal investigators,
and software engineers, including those with expertise in functional
programming, formal methods, computer security, control systems,
informatics, or networking.
For more information, take a look at http://corp.galo
Hello,
I am pleased to announce the availability of monadLib-3.7.1 on Hackage.
MonadLib is a library intended to help programmers to quickly and easily
construct various monads. The library has support for a wide range of
effects: threading state, read-only variables, collecting output,
except
Hello,
I would like to participate in the design of Haskell 2011. I have
used Haskell for about 10 years, commercially at Galois Inc, for the
last 3. I have a good understanding of all parts of the language and
various implementations, and I have a particular interest in its type
system and seman
Hello,
(you should be able to copy and paste the code in this email into two
modules called A and B to try it out)
> {-# LANGUAGE OverlappingInstances #-}
> module A where
This module, together with module 'B', illustrates a problem in some
implementations of overlapping instances and their inter
Hi,
Lately I have been using pattern guards more than usual and I find
that occasionally I need to nest them (i.e., I have alternatives with
a common prefix). This seems to happen when I need to do some
preliminary checking, followed by some decision making. Here is an
example:
server text
|
Hello,
I was playing around with "bang patterns" and I noticed that
when combined with asynchronous exceptions they can lead to
programs where the order of the declarations in a binding
group is important! Here is an example:
> import Control.Exception
> import Prelude hiding (catch)
>
> main =
Hi,
Mark is quite right, and there is a bug report that documents the problem:
http://hackage.haskell.org/trac/ghc/ticket/1241
The trac ticket is targeting GHC 6.8 but the ticket is still open. I
have not had a chance to try out any of the 6.8 release candidates
yet, so I am not sure if there have
Hello,
On 10/16/07, Simon Peyton-Jones <[EMAIL PROTECTED]> wrote:
> The H98 report is pretty clear about there being a single name space for type
> constructors and classes. Yes, in certain circumstances it's unambiguous.
> In Hugs, can you write
> module M where
> class C a
Hello,
I have a question concerning Haskell's module system.
Consider the following example which defines three modules A,B, and C:
> module A where { data X = X }
> module B where { class X a }
> module C where { import A; import B; data Y = Y X }
The question is: "Is there an ambiguity error i
Hello,
I have put up a new version of monadLib, which is available from hackage:
http://hackage.haskell.org/cgi-bin/hackage-scripts/package/monadLib-3.3.0
The changes in this version are fairly small:
* added an identity transformer, which is useful as a placeholder in
some applications,
* re
Hello,
Is this really a good idea? This seems a lot more relevant to the
Haskell mailing list then haskell-prime (at least to me)---it is a
language extension that is not implemented, there are a number of
different ways to implement it, and we have no significant experience
using it. As such, i
Hello,
I have placed a new version of 'monadLib' on its web-page:
http://www.csee.ogi.edu/~diatchki/monadLib
Some of the changes compared to the previous version:
* The whole library is in a single module MonadLib.hs (~500 lines)
* Simpler and more symmetric API
* Removed the (generic) monadic c
hi,
you might find the "backward" state monad interesting. here is the basic idea:
newtype S s a = S (s -> (a,s))
instance Monad (S s) where
return a = S (\s -> (a,s))
S m >>= k = S (\s1 -> let (a,s3) = m s2
(b,s2) = run s1 (k a)
in (b,s3)
hi,
On 12/30/06, Ross Paterson <[EMAIL PROTECTED]> wrote:
On Sat, Dec 30, 2006 at 10:31:30PM +, Chris Kuklewicz wrote:
> But WriterT is not lazy enough. So I put a lazier version up on the wiki:
>
> http://haskell.org/haskellwiki/New_monads/LazyWriterT
Interesting. Writer is lazy but Writ
Hello,
I was just looking at the details of how contexts on datatypes work in
Haskell'98
and I noticed the following. The report states that the context on a
particular constructor should contain all those predicates that
mention only variables that are in the fields of the constructor.
This wor
Hello,
Does the parallel list comprahension notation support guards that
involve both variables that are being generated? I was trying to
write something that is essentially:
[ f x y | (x,y) <- zip xs ys, p x y ]
and I thought that it would be nice to rewrite it as a parallel list
comprahension, b
Hello everyone,
There is now a new version of 'monadLib': a library of monad
transformers for Haskell.
'monadLib' is a descendent of 'mtl', the monad template library that
is distributed with most Haskell implementations. The library web
page is at:
http://www.csee.ogi.edu/~diatchki/monadLib
Com
Hello,
On 2/20/06, John Meacham <[EMAIL PROTECTED]> wrote:
> I think the problem is that 'mzero' exists, the correct solution seems
> to be to get rid of the 'mzero' method of MonadPlus. Since haskell is
> lazy, all Monads have at least the zero of _|_ which can be overriden by
> 'fail' with a mor
Hello,
On 2/19/06, Johannes Waldmann <[EMAIL PROTECTED]> wrote:
> > ... unless you export everything, you are forced to list all exports
> > explicitly, so there's no way to tell it just the few things you're
> > hiding (though that should not be a difficult extension).
>
> Alternative suggestion:
Hello,
Do you mean the record system or the module system? I don't think
either is exactly flawed, but for both, people have wanted them to do
more (and some have suggested that they should be the same thing :-)
The main problem with the record system I have heard about is that
people want to be
Hello,
On 1/4/06, David Roundy <[EMAIL PROTECTED]> wrote:
> > What happens to record updates?
> >
> > setFoo x r = r { foo = x }
> >
> > Or is the proposal to remove updates as well?
>
> Ah, good point, I hadn't thought about that. My proposal was to keep
> record updates which would indeed mean
Hello,
I just noticed that the GHC/Hugs "standard" libraries have acquired a
list monad transformer, which is broken, because it does not satisfy
the associativity law when applied to non-commutative monads. I am
not referring to some corner-case strictness problem, but rather a
fairly well known
Hello,
I also couldn't compile it. I looked in the sources a bit, and at
least one of the problems was that that the wxHaskell wrappers used
'char' insted of 'wxChar', which I think causes problems if wxWidgets
is compiled with unicode support (as is probably the case with the
Debian library). It
Hello,
On 8/5/05, Paul Govereau <[EMAIL PROTECTED]> wrote:
>
> Hello,
>
> I have encountered a type error that I find quite puzzling. I would
> appreciate it if someone could help me understand what is going wrong.
> Here is the program:
>
> > data Expr = Var String | Const Int
> > data Constra
Hello,
On 8/3/05, Srinivas Nedunuri <[EMAIL PROTECTED]> wrote:
> > The most obvious disadvantage is that the IO monad has no equivalent
> > of runST.
> OK, I'm missing something here. What is the big deal about runST? Can I not
> get the IO equivalent by simply running the program at the top leve
Hello,
On 4/25/05, Andrew Pimlott <[EMAIL PROTECTED]> wrote:
> I appreciated your explanation, but can you also address (to the list)
> the last case given by the original poster?
>
> > On 4/25/05, Andreas Rossberg <[EMAIL PROTECTED]> wrote:
> > > in particular, when I compare with the single par
Hello,
The type inference for "d1", goes on like this:
1. suppose "x" is of some type "a"
2. now lets infer a type for "p"
3. using the usual rules we infer that "p :: b -> ()",
subject to the constraint that "D a b" holds.
4. "p" does not look like a function so the monomorphism restriction
applie
Hello,
On Sun, 06 Mar 2005 12:21:01 +, Duncan Coutts
<[EMAIL PROTECTED]> wrote:
> On Sat, 2005-03-05 at 22:15 +0100, Sebastian Sylvan wrote:
> > On Sat, 05 Mar 2005 17:03:38 +, Duncan Coutts > module Graphics.UI.Gtk (
> > > qualified module Graphics.UI.Gtk.Button as Button,
> > > ...
>
Hello,
(appologies --- as I was writing, my post digressed from your original point,
I hope the discussion is still interesting though :-)
On Sat, 29 Jan 2005 18:48:00 -0800, John Meacham <[EMAIL PROTECTED]> wrote:
> ...
> instance (Monad m, Monad (t m), MonadTrans t, MonadStats m) => MonadStats
hello,
Richard Nathan Linger wrote:
On Wed, 24 Sep 2003, Norman Ramsey wrote:
Consider the following Haskell function:
asPair x = (fst x, snd x)
This function has type forall a b. (a, b) -> (a, b)
and is almost equivalent to the identity function, except it
can be used to make programs termina
hello,
i also like pretty for simple pretty priniting tasks, but i think it is
a bit low level. for example, the cominators could be parameterised by
a monad, so that one can have different printing styles, and also deal
nicely with precedences. one can build that functionality on top of the
hello,
i have no strong feelings about that either way,
however since in haskell we do not have "let" vs "let rec" distinctions,
perhaps we should not have "do" vs "do rec" distinction.
this of course would break programs relying on shadowing
(and at least i write quite a few of those, but that is
hi everyone,
what do people think should be the tokens produced by a haskell lexer
when applied to the following input:
A...
bye
iavor & thomas h.
--
==
| Iavor S. Diatchki, Ph.D. student |
| Department of Computer Science and Engine
hello,
it's a pity i don't know how to get my mailer to reply to a few messages
at once :-)
i also like mark's idea. i know that ghc can alredy achive some of that
with the OPTION pragmas, but i think it is nice if we can reuse what is
already in the language rather than making programmers le
hello,
i think records are very useful, and we don't use them much in haskell,
becuase the current record system is not very good.
Adrian Hey wrote:
IMHO preserving the status quo wrt records should be low priority.
It really doesn't bother me much if new (useful) language features break
existin
hi,
just a comment that the you can get more modular (and hence simpler)
proofs by using monad transformers.
than you can break down your proof in a number of steps:
1. prove that the identity monad is a monad
2. prove that the exception transformer: ErrorT x m a = m (Either x a)
gives a monad,if
hello,
Steffen Mazanek wrote:
Hello,
I have a question about pattern-matching. In the Haskell-report it is
not postulated, that
pattern matching has to be exhaustive. Would it be possible at all to
implement an
algorithm, which checks Haskell-style patterns for exhaustiveness? What
kinds of
co
hello,
Fredrik Petersson wrote:
Hi there!
Iam new to the list so feel free to shout at me when i do wrong! :)
Software-designer from sweden, likes fast bikes and metal, thats me, and hi
to you all!
welcome
Yeah ok to the problem,
i have this stupid code,
[c | (c,i) <- l]
Where (c,i) are a tuple f
hello,
i have made a package file for GHC.
this is how you can install fudgets.
1. download it:
http://www.cse.ogi.edu/~hallgren/untested/fudgets-030414-ghc-5.04.3-i386-linux-rh9.tar.gz
2. unzip it:
tar -C /usr/local -xzvf fudgets-030414-ghc-5.04.3-i386-linux-rh9.tar.gz
3. add it to the ghc packag
hi,
it works fine with GHC 5.04.3.
in fact we are using it for one of our projects here at OGI.
bye
iavor
Bas van Dijk wrote:
Hi,
Does anybody have the Fudgets library working with GHC 5.04.3 ?
I know the library is tested under GHC 5.02 but I would rather not install two
versions of GHC.
Ba
hello,
yep this is annoying. there is a flag in GHC to warn you about
such missing methods:
-fwarn-missing-methods
another thihng to watch out for are classes where there are mutually
recursive defaults (like the Eq class). forgetting to define a method
there will still loop, but won't be caug
hello,
i have been following the evolution of haskell for about 2 years now in my spare
time, but haven't had time to really get into haskell programming. so i am not
an expert or anything. i do not see the need for the "forall" quantifier to be written
explicitly however, and i quite like the wa
47 matches
Mail list logo
