-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 On Wednesday 19 November 2003 5:30 am, Brandon Michael Moore wrote:
I think I remeber seeing a paper about techniques for writing code generators in Haskell targeting stack based bytecodes that encoded bytecode sequences in a way that the typechecker could give you some sanity guarantees, and then talked a bit about using dynamic programming for optimizing bytecode sequences.
This kind of work is exciting. The popular explosion (in the 90's) of C can be viewed as tied to it's use in building the UNIX kernel. I've heard of a POSIX compliant kernel built in Haskell, with proofs of properties about information security. (Don't ask where, it was proprietary and isn't on the web). When one can write things like efficient device drivers, embedded code, or kernels in Haskell it will have fully matured. Maybe one can do this already. I'd love to see examples. Shawn -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.2.1 (GNU/Linux) iEYEARECAAYFAj+7hhEACgkQDtpPjAQxZ6DllQCcCABUOmBBeu+8aDGL8Rl5rrT9 aoAAnRH6nHYaWIOSy4GeMU1IaZaCLDKS =xrvG -----END PGP SIGNATURE-----