Luke Palmer wrote: [...]
[1] It would be totally cool to use a Haskell- or ML-style type inference system, but those things just don't work in procedural languages.
And they're very slow when not done at compile-time. Try a Haskell interpreter like hugs vs. a Haskell compiler like ghc.
Steffen
--
@n=([283488072,6076],[2105905181,8583184],[1823729722,9282996],[281232,
1312416],[1823790605,791604],[2104676663,884944]);$b=6;@c=' -/\_|'=~/./g
;for(@n){for$n(@$_){map{$h=int$n/$b**$_;$n-=$b**$_*$h;[EMAIL PROTECTED]
0..11;[EMAIL PROTECTED],[EMAIL PROTECTED];[EMAIL PROTECTED]"\n"[EMAIL PROTECTED];