Should the following be legal or not?
data T a = F (a->a->Bool)
x = F (==)
The compilers all produce an `ambiguous overloading' error, and I am not sure
why. Everything is OK if you give a type declaration for x (x :: Eq a => T a)
or if you add an argum
re
import M1 (T(A,B), ...) renaming (B to C)
data T = A | C
However, it would be safe to allow, in interface files only, an import to
specify a subset of the constructors (at least those that are renamed). The
full set appears later anyway. All this applies to class methods
rews RD, Backwell, Bristol BS19 3NR
tel: 0275 464 257
Registration Form
-
Name:
Address:
Tel:
Email Address:
Price you will pay:
---
Ian[E
comes with a collection of small test programs.
It is available by anonymous ftp from ftp.cs.bris.ac.uk, /pub/functional/brisk.
Comments are welcome.
Ian[EMAIL PROTECTED], Tel: 0272 303334
in the report. A notable case
is that the functions associated with a class are variously called
methods, operations, or operators. The last of these is surely wrong.
o A number of other minor matters are raised by the tests available by
anonymous ftp from ftp.cs.bris.ac.uk, d
The ftp directory for brisk at ftp.cs.bris.ac.uk is /functional/brisk, not
/pub/functional/brisk.
Sorry, and thanks to Kent Karlsson for pointing this out.
Ian[EMAIL PROTECTED], Tel: 0272 303334
readInt (so that it matches showInt)
and rename the current readInt as readRadix or something?
Ian[EMAIL PROTECTED], Tel: 0272 303334
5.2 *already* uses the term body for the topdecls
alone, in contradiction to the current syntax.
*) do the same for interfaces in 5.3 (we don't want modules and interfaces in
the same file, do we?) and change B.4, B.5, B.6 to match.
Ian
en brisk is further advanced, I can make some of these ideas more
concrete.
Ian[EMAIL PROTECTED], Tel: 0272 303334
ogic hold
for {True,False}, but not when you include _|_. It is not reasonable to have
unlifted booleans, is it? Which value would you choose to identify _|_ with?:-)
Ian[EMAIL PROTECTED], Tel: 0272 303334
o do a check for the right number
of arguments on entry to every function.
Ian[EMAIL PROTECTED], Tel: 0272 303334
s both have some nasty
problems (eg Warren Burton's recent comments) and that both need a more
thorough redesign for Haskell 2.0.
Ian[EMAIL PROTECTED], Tel: 0272 303334
ould be imported along with it.
I believe Haskell current rules do ensure this, but are not liberal enough.
Ian[EMAIL PROTECTED], Tel: 0272 303334
e, if
people agree. Send us your pathological programs, preferably short ones which
make a point.
Ian[EMAIL PROTECTED], Tel: 0272 303334
eans: what good does it do, and what harm? I think that
for certain operations, particularly in the IO monad, a
declaration form does add clarity. Others may disagree, and say
that Haskell is terse enough as it is.
Comments, anyone? ( Implementation, anyone? )
Ian Stark.
..
er
to read, and I've never quite understood why n in (n+k) should match
only non-negative integers.
Ian
ies for eliminating indirection-like constructs such as "y = snd
(e1,e2)" either in the garbage collector or in a low-priority background
process.
Ian [EMAIL PROTECTED], http://www.cs.bris.ac.uk/~ian
have to admit I was a bit taken aback by this, but I think it is
an instance of polymorphism and overloading being just so convenient
you forget that they are there: those two uses of `Right' look so
much, well, the same.
Ian Stark
.....
xpecting one soon, but it is a
very obvious gap.
Ian[EMAIL PROTECTED], http://www.cs.bris.ac.uk/~ian
;arbitrary precision" the same as true real numbers --- or does
it just mean "for this run of the program I would like to use 10^5
digits" ?
Ian Stark
.
Ian Stark http://www.dcs.ed.ac.uk/home/stark
Department of Computer Science, The University of Edinburgh, Scotland
than the current Haskell
community is important.
Taking the two-digit year suggests a lifetime for Haskell '98 of
more than a year and less than a century, which seems safe enough.
Ian
On Stable & Current Haskell, what is going to happen when we next
want to take a marker on Current Haskel
1995. Also published as
Technical Report 391, University of Cambridge Computer
Laboratory.
For a copy, send email to <[EMAIL PROTECTED]>
----
Dr Ian StarkOffice: 2506
Division of Informatics
8 and imperfect).
--
Ian[EMAIL PROTECTED], http://www.cs.bris.ac.uk/~ian
--F93F7E72348E2F23CC7D1D40
Content-Type: text/plain; charset=us-ascii; name="Layout.hs"
Content-Transfer-Encoding: 7bit
Content-Disposition: in
> Let's either disallow (n+k) pattern bindings or always resolve the
> ambiguity as an (n+k) pattern. I'd prefer the former, but I never
> use (n+k) patterns, anyway.
Likewise!
> Kevin
Ian
Steve Tarsk writes ("Clean and Haskell"):
> I just want to say that Haskell is a fat old slow
> dinosaur compared with Clean. Download Clean at
> www.cs.kun.nl/~clean and get rid of your Haskell
> installation.
Without getting into the merits of the languages per se, for me and
many other people
Jerzy Karczmarczuk writes ("Re: Clean and Haskell"):
> Ian Jackson:
> > The operating system I run on my computers, Debian (www.debian.org),
> > consists only of software and documentation to which I have (or can
> > download) the source code, which I can use at wor
olved this, but reinventing this yourself can take a long,
> long time.
I'm interested in this; does "parts of the type checker that were
undefined" mean that they just hadn't been written, or that the type
system itself is unclear? Is the Clean type sys
George rightly points out how tricky trig functions are. My own
favourite curious operation is subtraction:
Prelude> 1.0 - 0.8 - 0.2
-1.49012e-08
----
Ian Stark http://www.dcs.ed.ac.uk/home/stark
L
(entirely sensible) mechanics of floating-point arithmetic.
--------
Ian Stark http://www.dcs.ed.ac.uk/home/stark
LFCS, Division of Informatics, The University of Edinburgh, Scotland
pecify
build-time requirements (as distinct from install-time). This is a
particular problem when devising an RPM for a package written in any
language which gcc cannot compile.
Can anyone confirm that version 3 does have this feature? Is it
sufficient to describe the bootstrapping of self-compilin
function. Also, the manual says that an Array is
not strict in its contents, which doesn't seem helpful to me.
Ian.
I tried to report a broken link on www.haskell.org, but the page had
no attribution or contact address at the bottom, and no in the , so I mailed
`[EMAIL PROTECTED]' - but that address doesn't exist.
Who should I contact ?
Thanks,
Ian.
Mail Delivery System writes ("Undelivere
here? Eq and Read too, though they do become tricky at Int->Int.
----
Ian Stark http://www.dcs.ed.ac.uk/home/stark
LFCS, Division of Informatics, The University of Edinburgh, Scotland
Simon said:
> GHC has a Java back end in development. You say ghc -J Foo.hs to produce
> Foo.java.
Any particular reason for generating Java rather than JVM bytecode?
Does it make a difference?
----
Dr Ian
x27;t know if a
better optimised version could be written although I may look into this).
I've put the code at http://c93.keble.ox.ac.uk/~ian/md5/
License is GPL.
Ian
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
On Wed, Jan 17, 2001 at 07:11:40PM +, Ian Lynagh wrote:
>
> I've put the code at http://c93.keble.ox.ac.uk/~ian/md5/
>
> License is GPL.
0.1.1 now there which changes the license to GPL/BSD so it can be used
as a drop-in replacement for th
-> String -> IO Int
> foo io_l s = do l <- io_l
> () <- putStr s
> io_l
prints (with both GHC and hugs):
qq
ww
qq
ee
qq
ww
qq
and I really don't understand why. Is
On Sat, Jan 20, 2001 at 05:08:48PM -0500, Scott Turner wrote:
> At 21:17 2001-01-20 +0000, Ian Lynagh wrote:
> > main = do _ <- foldl foo (return 14) ["qq\n", "ww\n", "ee\n"]
> > putStr ""
> >
report (primUnicodeIsUpper -- 'A'..'Z') are
also misleading.
Thanks
Ian
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
As far as I can tell, the report doesn't allow (:) or []((:), []) in the
export list, yet the hugs prelude has the first and the GHC prelude has
the second. Have I missed something that allows them or is this a bug in
the preludes or the report?
Thank
l
> extensions, and just reduce the amount of built-in compiler magic needed
> to express the Prelude.
I think it would be nice if the prelude was valid Haskell 98 - if these
extensions are useful and natural, and as I can't see how they could
break existing code, could they be put int
if m /=0 (Note 5)
would be clearer. In fact as the preeceding text says 'and "" for the
empty stream' I think it may be written correctly but have gotten lost
in the conversion from whatever it is really written in.
Thanks
Ian
___
lieve should be
aexp_ { fbind1 , ... , fbindn }
Thanks
Ian, who's going to have to rejig his code some time for the revised
report :-(
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
Hi
I've rewritten the syntax section (appendix B) in docbook, slightly
hacked the nwalsh style sheets and produced
http://c93.keble.ox.ac.uk/~ian/report/html/
The lexical Structure section is also just started more as
proof-of-concept for linking back into the rest of the report.
As we
qop -> qvarop | qconop
in the context-free syntax - is this deliberate? It really sucks IMO.
> My plan is to iterate just once more (early Dec), and then freeze
> the report at Christmas. I'm getting tired!
:-)
Thanks
Ian
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
member "foo" in class "Fractional"
Prelude>
As the report stands I don't think any implementation does the right
thing, but that they should fail due to not being able to offsideify the
module as n == m on the line defining foo so the { is neither explicitly
nor
future then I don't have a problem with that.
Incidentally "orignal" is spelt wrong in the first line.
Thanks
Ian
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
gt; Array (a,b) c -> Array b c
row i x = ixmap (l,u) (\j->(i,j)) x where ((_,l),(_,u)) = bounds x
~~~~~~ ~~~
Thanks
Ian
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
being indented at all (only looked at the
HTML version).
I think
unionBy eq xs ys = xs ++ foldl (flip (deleteBy eq)) (nubBy eq ys) xs
may be clearer written as
unionBy eq xs ys = xs ++ deleteFirstsBy eq (nubBy eq ys) xs
Thanks
Ian
___
Haskell maili
worth quibbling over at any rate :-)
Another one for you: In 10.3 (Monad, Functions) the listFile example
uses openFile where it means readFile.
Another minor quibble: the use of brackets around contexts isn't
consistent within the Monad section (haven't looked at the others).
Thanks
(map toUpper s)
The section also doesn't follow the convention of the portable part of
the module definition being given at the end of the section.
Thanks
Ian
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
,False] (I don't seem to have a
hugs Directory.hs) while the library report only allows
isIllegalOperation, isPermissionError and isAlreadyExistsError. I
haven't looked for other cases of this.
(this is under Linux, don't know if it would behave differe
for Random.Random needed in left hand pattern at 17:11.
and hugs doesn't seem to know genRange exists. With it commented out it
returns the same as ghc.
Thanks
Ian
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
legal
> lexeme (Sec. 2.3, p. 6).
Euch. Is --- the start of a comment? Either way the lexical syntax needs
to be changed, either to
comment -> dashes {any} newline
dashes -> -- {-}
or to
comment -> dashes {any} newline
dashes -> --
Thanks
Ian
_
On Mon, Dec 10, 2001 at 04:03:27PM +, Ian Lynagh wrote:
>
> In the thread "Literate scripts not handled correctly" Simon Marlow
> said:
>
> > Yes, it looks like GHC's unlit program removes whitespace when looking
> > for \begin{code}, but not for
micolon
to be inserted. This can be fixed by changing
L ({n}:ts) (m:ms) = { : (L ts (n:m:ms)) if n > m, (Note 1)
= { : } : (L ts (m:ms)) otherwise
to
L ({n}:ts) (m:ms) = { : (L ts (n:m:ms)) if n > m, (Note 1)
= { : } : (L (:ts) (m:ms)) otherwis
I
am not sure who is wrong with default ([Foo]) or (Foo -> Int).
Finally, the context free grammar doesn't currently enforce the
restriction that only one default declaration be given. Fixing it would
make rather a mess, though.
Ian
___
Haskel
at I was asking:
What is a monotype? For example, is "[Foo]" a monotype and is
"Foo -> Int" a monotype? The context free grammar implies that a
monotype is identical to a type, in which case why is a different name
used?
The rest was to attempt to high
sion that they were in
the wrong.
Thanks
Ian
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
or help
Main> main
foobar
Main> main
bar
Main> main
bar
Main> main
bar
and in ghci:
Skipping Main ( q.lhs, ./q.o )
Main> main
foo
bar
Main> main
bar
Main> main
bar
Main> main
bar
Main>
Thanks again
Ian
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
Hi all
I have written a vim syntax highlighting file which, given a literate
script with TeX markup surrounding the Haskell code, will highlight both
the TeX and Haskell.
lhaskell.vim is at
http://c93.keble.ox.ac.uk/~ian/haskell-vim/lhaskell.vim
along with haskell.vim and tex.vim, but
hc
give me errors:
$ rm Foo.{o,hi}; nhc98 -c Foo.lhs -o Foo.o
Unknown preprocessor directive at line 4 in file ./Foo.lhs
ifdef QQ
$ rm Foo.{o,hi}; ghc -c Foo.lhs -o Foo.o
Foo.lhs:4: parse error on input `#'
Are ghc and nhc98 being incompatible with Haskell 9
it is parsing the
> output from CPP. Apart from this, '#' should be interpreted exactly as
> per the report (when -fglasgow-exts is off).
See below - changing "FOO" to "ifdef FOO" has the same result.
[ian@urchin /tmp]$ cat Foo.lhs
#FOO
> main = ret
cing the above with the following. It does mean that
creates 2 newlines, but I don't believe this should be a
problem.
whitechar-> newline | vertab | formfeed | space | tab | uniWhite
newline -> return | linefeed
return -> a carriage return
linefeed -> a line fe
On Fri, Feb 01, 2002 at 02:32:37PM -0500, Dean Herington wrote:
> GHC accepts the declaration:
>
> (a # b) = a ++ b
>
> but Hugs rejects it, saying:
>
> Syntax error in input (unexpected `=')
>
> Who
space | tab | uniWhite
> | newline -> return | linefeed
> | return -> a carriage return
> | linefeed -> a line feed
>
> Why not say
>
> newline -> return linefeed | return | linefeed
>
> which, given maximal munch, will behave decen
please, whatever you do or even suggest doing to
layout rules, don't break the non-layout way.
--
Ian Zimmerman, Oakland, California, U.S.A.
GPG: 433BA087 9C0F 194F 203A 63F7 B1B8 6E5A 8CA3 27DB 433B A087
The world has taken on a thickness of vulgarity that raises
a spiritual man'
ct it's misparsing these as
> > f x = (\x -> (x*x .))
> > g x = (if x then 1 else (2 +))
> > h = (let op x y = y in (3 `op`))
>
> But I would claim that nhc98 is parsing these correctly, at least
But, for example
ust bitter from spending a while
thinking about and implementing this myself!) and makes some previously
legal scripts illegal.
Thanks
Ian
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
cters newline, return, linefeed, and formfeed, all start a
new line.
in "B.3 Layout" should also be updated. In fact I think it should be
changed to
* The token newline starts a new line
regardless, although that kind of reminds me the "May contain nuts"
warning on
entation of the lexeme, provided that it is not, as a
consequence of the first two rules, preceded by {n}. (A string
literal may span multiple lines -- Section 2.6.)
where I have altered only the first line).
Thanks
Ian
___
Haskell mail
nicely typeset. I don't
think I can explain any better in this medium, so go take a look :-)
Enjoy
Ian
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
fer it if such forking wasn't necessary, but if the
above is the case (I am not a lawyer, etc etc) then I guess it isn't the
end of the world - I must admit to not seeing what CUP would be getting
out of it if this is so, though.
Ian
___
Has
On Mon, Nov 11, 2002 at 09:39:08AM +, Ganesh Sittampalam wrote:
> On Fri, 08 Nov 2002 09:57:08 +0100, Peter Thiemann
> <[EMAIL PROTECTED]> wrote:
>
> >there used to be a Haskell implementation of MD5 and other cryptographic
> >hashes available on
> >http:
st I
thought it was a GHC bug, but now nhc98 also exhibits it I am wondering
if it is a bug in my understanding?
Thanks
Ian
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
On Wed, Dec 18, 2002 at 02:51:48PM -, Simon Marlow wrote:
>
> in fact, any prefix of "Foo", including the empty string, would be
> correct. See section 21.2.2 in the (revised) Haskell 98 report.
Aha, thanks. I've kludged around it with
last ('
-libsrc packages. It should
enter testing in 10 days time.
Stable packages are available from Isaac's "Haskell Experimental"
repository. To use them, add
deb http://www.syntaxpolice.org/haskell-experimental/ stable/
to your /etc/apt/sources.list and install as above.
Thanks
Ian
able/
and install as above.
Unfortunately things aren't quite back to normal after the recent Debian
break-in, so sparc and s390 builds haven't been done yet. Also, only
x86, sparc and ia64 are registerised builds. I'll try a powerpc
registerised build when I can log in to a suitable
l with -cpp
> preprocessor sprinkles. The directories should go in your ~/.vim/
> folder.
I've put mine here: http://urchin.cipe/~ian/vim/
They also use a simple heuristic to guess whether the non-Haskell stuff
should be treated as TeX or just text, and cope with the Bird style. We
re
On Mon, Feb 09, 2004 at 04:20:59PM +, Ian Lynagh wrote:
>
> I've put mine here: http://urchin.cipe/~ian/vim/
Or, more usefully, http://urchin.earth.li/~ian/vim/
Ian
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.
release (3.1).
I'm told this is still possible, so I'll have a look at it unless
someone else says they already have or want to.
Thanks
Ian
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
it's a bit odd, I don't think it's a problem.
Thanks
Ian
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
On Tue, Nov 16, 2004 at 04:07:48PM +, Malcolm Wallace wrote:
> On Tue, 16 Nov 2004 15:04:02 +0000, Ian Lynagh <[EMAIL PROTECTED]> wrote:
>
> > > Is there a good reason why I can't say
> > >
> > > data Bar = Bar { _ :: Int, _ :: Char, x :: Bo
Fellow Haskellers,
We (Björn Bringert, Duncan Coutts and Ian Lynagh) are pleased to
announce that we have recently set up a Haskell consultancy company,
Well-Typed LLP (http://www.well-typed.com/).
Our services include application development, library and tool
maintenance, project advice, and
ibrary_submissions
Thanks
Ian
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
e list it on
http://www.haskell.org/ghc/docs/latest/html/users_guide/bugs-and-infelicities.html#haskell98-divergence
?
Thanks
Ian
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
Hi all,
It is now possible for projects on community.haskell.org to create
themselves a trac (which provides a bug tracking system and wiki).
Please see
http://community.haskell.org/admin/using_project.html#trac
for details of how to do so.
Thanks
Ian
=
The (Interactive) Glasgow Haskell Compiler -- version 6.8.3
=
The GHC Team is pleased to announce a new patchlevel release of GHC.
This release contains a number of
On Wed, Jun 18, 2008 at 10:22:39PM +1000, Manuel M T Chakravarty wrote:
>
> An installer package for Mac OS X, Intel/Leopard, is available at
>
> http://www.cse.unsw.edu.au/~chak/haskell/GHC-6.8.3-i386.pkg
Thanks Manuel; I've added this to the GHC download p
==
The (Interactive) Glasgow Haskell Compiler -- version 6.10.1
==
The GHC Team is pleased to announce a new major release of GHC. There
have been a number of signific
at
http://community.haskell.org/
Thanks
Ian, on behalf of the community admin team
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
The best place at the moment is in GHC's trac:
http://hackage.haskell.org/trac/ghc/newticket
setting the component to "libraries/pretty".
Thanks
Ian
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
==
The (Interactive) Glasgow Haskell Compiler -- version 6.10.2
==
The GHC Team is pleased to announce a new patchlevel release of GHC.
This release contains a number
==
The (Interactive) Glasgow Haskell Compiler -- version 6.10.3
==
The GHC Team is pleased to announce a new patchlevel release of GHC.
This release contains a handful
ust Reactive.Yampa etc.
>
> Where should the modules of Conal’s reactive package be rooted then? Under
> Control.Reactive.Reactive?
I don't know anything about the package, but if putting the modules
directly under Control.Reactive wouldn't make sense the
==
The (Interactive) Glasgow Haskell Compiler -- version 6.10.4
==
The GHC Team is pleased to announce a new patchlevel release of GHC.
This release contains a number
==
The (Interactive) Glasgow Haskell Compiler -- version 6.12.1
==
The GHC Team is pleased to announce a new major release of GHC. There
have been a number of signific
On Mon, Dec 14, 2009 at 03:24:05PM +0100, Bas van Dijk wrote:
> There's a broken link to the Haskell Platform in:
>
> http://haskell.org/ghc/docs/6.12.1/html/users_guide/release-6-12-1.html#id2890234
Thanks; fixed with a redirect
ark it as dealt with.
If you see any other problems with the new server, or anything else
missing from it, let me know.
Thanks
Ian
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
Hi all,
monk is just days away from being turned off, so if you want to get
anything off of it before that happens, you need to do it now.
More information here:
http://www.haskell.org/pipermail/haskell/2010-January/021861.html
Thanks
Ian
1 - 100 of 160 matches
Mail list logo