Assuming universal quantification

1997-03-14 Thread stark
= 3, pages = "485--517", URL = "ftp://ftp.math.luc.edu/pub/laufer/papers/haskell+extypes.ps.gz" } .... Ian Stark http://www.brics.dk/~stark BRICS, Department of Computer Science, University of Aarhus, Denmark

Suggestion for monad syntax

1996-04-11 Thread Ian Stark
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. ......

Re: Pattern Match Success Changes Types

1998-05-07 Thread Ian . Stark
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 .....

Re: numerics in Haskell

1998-08-04 Thread Ian . Stark
;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

Haskell '98

1998-08-07 Thread Ian . Stark
Colin Runciman writes: > Names including a date, like Haskell 98, ... could mislead. How would this be misleading? A number of other languages use it to mark points in their ongoing development (Fortran, Ada, ML,...), and it seems to communicate just about the right message. To anyone unfami

Re: types with value parameter (another example of application)

1999-03-01 Thread Ian . Stark
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

The Clean type system

2000-01-14 Thread Ian . Stark
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

Re: rounding in haskell

2000-02-08 Thread Ian . Stark
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

Re: rounding in haskell

2000-02-08 Thread Ian . Stark
(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

ghc-4.06-1.src.rpm

2000-03-14 Thread Ian . Stark
g compilers? Ian Stark ---- Ian Stark http://www.dcs.ed.ac.uk/home/stark LFCS, Division of Informatics, The University of Edinburgh, Scotland

Re: Show class on ADT with function

2000-05-08 Thread Ian . Stark
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

RE: Haskell -> Java bytecode?

2000-05-26 Thread Ian Stark
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