[Haskell-cafe] Ur vs Haskell
Brandon S Allbery KF8NH
allbery at ece.cmu.edu
Sat Jan 8 03:21:07 CET 2011
-----BEGIN PGP SIGNED MESSAGE-----
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 at kf8nh.com
system administrator [openafs,heimdal,too many hats] allbery at 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/
-----END PGP SIGNATURE-----
More information about the Haskell-Cafe