This is a multi-part message in MIME format.
--D94C6EDB5EF90419BD64FA07
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: 7bit
When I asked if there was an STL like library available for Haskell the
short answer was no. So I decided to create one.
Attached is a
Kevin Atkinson wrote:
... However, there should be some way to get the return type with out having to
explicitly store it in the object as a bulk type.
Another solution I thought of is to be able to have auxiliary types in
class
such as
class Listable c, a where
toList :: c - [a]
Hello!
On Thu, May 06, 1999 at 09:26:15PM -0400, Arvind wrote:
[...]
The optimization " n+1 n == True " is extremely useful in array
subscript analysis, bounds checking etc. and is correct as long as n
terminates (is not bottom). The cases where this optimization is used
most often, n
Lennart Augustsson writes:
Wolfram Kahl wrote:
In the end, my dreams even include a proof format
that can be checked by the compiler :-)
Dependent types! That's all you need.
Absolutely!
I have read your Cayenne paper
( http://www.cs.chalmers.se/%7Eaugustss/cayenne/paper.ps )
"D. Tweed" wrote:
On Wed, 5 May 1999, Kevin Atkinson wrote:
Normally given the class.
class Listable c b where
toList :: c - [b]
to list will never be able to be resolved unless the signature is given
when toList is called because there is no way to derive the type of b
