Hi, On Fri, Jan 28, 2005 at 07:43:27AM -0800, Shawn Garbett wrote: > Does avoiding polymorphism and static type checking > exclude things like type classing in Haskell? > As far as I know you can type check type classes statically, but there is run time overhead because of type information. The work on extensional polymorphism offers another solution instead of type classes, and with better contol over the overloading. Extensional polymorphism also has a run-time representation of types, and use flow-analysis to optimise this representation. If you have static type checking, you can add polymorphism and type classes or extensional polymorphism at a later time. Extensional polymorphism was developed as a constraint layer on top of the O'Caml type system.
> Type classing in Haskell is a very elegant solution to > developing generic algorithms and doesn't bring with > it all the problems that OO polymorphism has. However, > I can understand why this would cause problems with > theorem provers and other kernel runtime issues. > Some of the samples with extensional polymorphism can type more than possible with type classes. -- Sincerely | Homepage: J�rgen | http://www.hex.no/jhf | Public GPG key: | http://www.hex.no/jhf/key.txt
signature.asc
Description: Digital signature
_______________________________________________ bitc-dev mailing list [email protected] http://www.coyotos.org/mailman/listinfo/bitc-dev
