Re: strong typing is not a panaceum, and, anyway...

2001-10-19 Thread Brian Boutel
Jerzy Karczmarczuk wrote: > > Brian Boutel to Sergey Mechveliani: > > > > There is no scientific reason why all computations with types and > > > type resolution should preceed all computations with non-types. > > > No scientific reason, but a strong engineering reason. > > > > The engineerin

RE: haskell98: Directory.getDirectoryContents

2001-10-19 Thread Simon Peyton-Jones
Prompted by a suggestion from Sigbjorn, I propose to clarify the description of Directory.getDirectoryContents. Current description: "Computation getDirectoryContents dir returns a list of all entries in dir." I propose to add: "Each entry in the returned list is named relative to the direc

RE: Haskell 98 - Standard Prelude - Floating Class

2001-10-19 Thread Simon Peyton-Jones
An apparently-innocuous suggestion about adding default methods for sinh and cosh led to a flood of mail. Since no consensus emerged, I plan to leave things as they are in the Haskell 98 Report. Namely, the following default methods for the Floating class are there: x**y = exp (log x *

Main module editor/Interpreter

2001-10-19 Thread Eric Allen Wohlstadter
Has anyone made a program for Hugs that allows you to add type definitions and top level functions to the Main module from the interpreter command line? I find it odd that I have load from a text file to experiment with data types, classes, etc. If this sort of thing is not available convince me e

Re: Large lists, heaps, stacks...

2001-10-19 Thread Till Doerges
Hi everybody, thanks for all the answers! On Fri, Oct 19, 2001 at 09:55:00AM +0200, Janis Voigtlaender wrote: [...] > You might try the following version that does not build up huge data > structures in accumulating parameters to output them only in the two > base cases. Rather, it produces par

strong typing is not a panaceum, and, anyway...

2001-10-19 Thread Jerzy Karczmarczuk
Brian Boutel to Sergey Mechveliani: > > There is no scientific reason why all computations with types and > > type resolution should preceed all computations with non-types. > No scientific reason, but a strong engineering reason. > > The engineering idea is to test a design with all availabl

Re: More Unicode nit-picking

2001-10-19 Thread Kent Karlsson
- Original Message - From: "Colin Paul Adams" ... > But this seems to assume there is a one-to-one mapping of upper-case > to lower-case equivalent, and vice-versa. Apparently this is not > so. True. It's quite tricky. See below. > It seems that whilst the Unicode database's definit

Re: More Unicode nit-picking

2001-10-19 Thread Marcin 'Qrczak' Kowalczyk
19 Oct 2001 06:09:09 +0100, Colin Paul Adams <[EMAIL PROTECTED]> pisze: > But this seems to assume there is a one-to-one mapping of upper-case > to lower-case equivalent, and vice-versa. Apparently this is not so. Indeed, but there exists a default locale-independent case mapping. Language-speci

Re: list comprehension

2001-10-19 Thread Rijk-Jan van Haaften
Hello, Hi, I have a script here   interleave :: [Integer] -> [Strings] -> [String] interleave (x:xs) (y:ys)     = words [a | a <- (unwords [(show x), (filter (/= 1) y), "+"])]   Firstly, "Strings" is not a standard type. I suspect you mean "String" so the type signature is interleave :: [In

Re: Working character by character in Haskell

2001-10-19 Thread Malcolm Wallace
"Simon Marlow" <[EMAIL PROTECTED]> writes: > > Well, in Haskell each character of the string takes 20 bytes: 12 bytes > > for the list cell, and 8 bytes for the character itself Ahem, _Haskell_ mandates no such thing. Perhaps you are talking about a specific implementation? ghc probably. > I

Re: list comprehension

2001-10-19 Thread Ch. A. Herrmann
> "Stephanie" == Stephanie Randles <[EMAIL PROTECTED]> writes: Stephanie> Hi, I have a script here Stephanie> interleave :: [Integer] -> [Strings] -> [String] Stephanie> interleave (x:xs) (y:ys) = words [a | a <- (unwords Stephanie> [(show x), (filter (/= 1) y), "+"])] S

list comprehension

2001-10-19 Thread Stephanie Randles
Hi, I have a script here   interleave :: [Integer] -> [Strings] -> [String]interleave (x:xs) (y:ys)    = words [a | a <- (unwords [(show x), (filter (/= 1) y), "+"])]     and the error message i receive is   (Instance of Num Char required for definition of interleave)   and I don't un

Re: Large lists, heaps, stacks...

2001-10-19 Thread Steinitz, Dominic J
Have you looked in the list library? partition or groupBy may be what you want. Dominic. - To receive our special fares directly by email, register at http://www.britishairways.com/registration

final test: Research Job in Compositional Reasoning and Analysis @ Heriot-Watt Univ., Scotland, UK

2001-10-19 Thread Joe Wells
Title: Research Position Research Position Useful Logics, Types, Rewriting, and their Automation (ULTRA) GroupComputing and Electrical Engineering DepartmentHeriot-Watt UniversityEdinburgh, Scotland, UK Description of the Position A research position is available on an E

Re: Large lists, heaps, stacks...

2001-10-19 Thread Janis Voigtlaender
Till Doerges writes: > I tried to implement a function that separates a list into two parts > according to a list of indices given. (Does anything like that perhaps > exist already in the Prelude?) > ... > > 1) Could anybody please explain the behaviour of select and select' > to me? >