BAL paper available

2001-05-15 Thread S.D.Mechveliani
Paper announcement -- The file http://www.botik.ru/pub/local/Mechveliani/basAlgPropos/haskellInCA1.ps.zip contains more expanded explanations on the BAL (Basic Algebra Library) project (previous variant was haskellInCA.ps.zip). My real intention in whole this line of

Re: BAL paper available

2001-05-15 Thread Jerzy Karczmarczuk
Serge Mechveliani : Paper announcement -- The file http://www.botik.ru/pub/local/Mechveliani/basAlgPropos/haskellInCA1.ps.zip contains more expanded explanations on the BAL (Basic Algebra Library) project (previous variant was haskellInCA.ps.zip). My real

Re: BAL paper available

2001-05-15 Thread Dylan Thurston
On Tue, May 15, 2001 at 06:33:41PM +0200, Jerzy Karczmarczuk wrote: Serge Mechveliani : ... My real intention in whole this line of business was always not just to propose a standard but rather to discuss and to find, what may be an appropriate way to program mathematics in Haskell.

Re: BAL paper available

2001-05-15 Thread Marcin 'Qrczak' Kowalczyk
Tue, 15 May 2001 16:10:20 +0400, S.D.Mechveliani [EMAIL PROTECTED] pisze: The matter was always in parametric domains ... The solution is simple: don't model domains as types. Model them as values (records with operations). Some simple domains can be also modelled as types for convenience.

RE: BAL paper available

2001-05-15 Thread Conal Elliott
Small comment. Marcin wrote: About program transformation possibility: I don't see how it would be applied in practice. There is no use of associativity of (+) for the compiler. It can do many optimizations, but it won't rewrite x+(y+z) to (x+y)+z nor vice versa. Associativity and

Re: BAL paper available

2001-05-15 Thread Wojciech Moczydlowski, Jr
On 15 May 2001, Marcin 'Qrczak' Kowalczyk wrote: Tue, 15 May 2001 21:14:02 +0300, Dylan Thurston [EMAIL PROTECTED] pisze: Nor hard numeric work (efficient, easy to manipulate arrays). If I understand correctly, Marcin Kowalczyk is working on exactly this last point... Well, I

Ix class

2001-05-15 Thread Matt Harden
Hello, I am working on an Ix instance for one of my types and finding it rather restrictive. For me it would be useful to have rangeSize be defined in the Ix class (with a default definition of course), so that it can be overridden. Also, does anybody know why Ix derives from Ord? It seems to

Re: Ix class

2001-05-15 Thread Jan Skibinski
On Tue, 15 May 2001, Matt Harden wrote: [..] I would like _any_ pair of Ints to be an acceptable boundary for the honeycomb, not just the ones that represent valid indexes. For example, (Hx (0,0), Hx (15,12)) should be a valid set of bounds. The current definition of rangeSize makes

Re: BAL paper available

2001-05-15 Thread Stefan Karrmann
On Tue, May 15, 2001 at 09:14:02PM +0300, Dylan Thurston wrote: On Tue, May 15, 2001 at 06:33:41PM +0200, Jerzy Karczmarczuk wrote: Serge Mechveliani : ... The matter was always in parametric domains ... Whoever tried to program real CA in Haskell, would agree that such a problem

Re: BAL paper available

2001-05-15 Thread Fergus Henderson
On 15-May-2001, Wojciech Moczydlowski, Jr [EMAIL PROTECTED] wrote: On 15 May 2001, Marcin 'Qrczak' Kowalczyk wrote: What should be improved compared to existing STUArray Int Double and similar? A simple standard proposal, not using ST and multiparameter type classes, so that it would be