The following paper, to be presented at POPL93, is now available by ftp:
Tobias Nipkow and Christian Prehofer
Type Checking Type Classes
We study the type inference problem for a system with type classes
Lennart Augustsson writes:
I thought there were problems with extending Hindley-Milner type systems
with cyclic types: The type inference can handle type correct programs,
but will loop for certain type incorrect programs, or am I mistaken?
It is absolutely unproblematic to extend
Hi, I came up with the following extremely compact version of Gaussian
elimination for matrices represented as functions. I searched the web
but found nothing resembling it, probably because of its inefficiency.
Has anybody seen something like it before?
Thanks
Tobias
gauss :: Int - (Int - Int -
