-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 On 1/7/11 14:14 , Alexander Kjeldaas wrote:
Ur looks very impressive, so the natural question I'm asking myself is: How does it stack up against haskell frameworks, and why can't Ur be implemented in Haskell?
I'm thinking mainly of the safety guarantees, not necessarily the performance guarantees, GC-less execution, or even non-lazy evaluation.
And I can't answer those.. any takers?
Right on the intro page it talks about having simplified dependent typing. While some (not all) forms of dependent typing can be simulated in Haskell, "simple" is not the word to describe the techniques. - -- brandon s. allbery [linux,solaris,freebsd,perl] allbery@kf8nh.com system administrator [openafs,heimdal,too many hats] allbery@ece.cmu.edu electrical and computer engineering, carnegie mellon university KF8NH -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.4.11 (Darwin) Comment: Using GnuPG with Mozilla - http://enigmail.mozdev.org/ iEYEARECAAYFAk0nygQACgkQIn7hlCsL25UUcACfSbSvzrFF3hFtPIOeV6+SEkCF 0dUAn3V4ozEYg/U6rzOYysaJXM7xKzBQ =QUia -----END PGP SIGNATURE-----