On Sat, Jun 4, 2011 at 9:52 AM, Scott McLoughlin <[email protected]> wrote: [...] > So I'll rephrase my question in this manner. We can imagine a > Smalltalk or Lisp or Forth machine. Can we imagine a machine > predicated on a statically typed language - a Haskell machine, or > OCaml Machine or whatever - in the same way??? > > Why or why not?
If the type system is Turing complete (e.g. Haskell's extended type system), you now have two languages to implement. I can't recall the specific topics, but, over on lambda-the-ultimate.org, there have been numerous and interesting discussions about the barriers to bootstrapping via metacircular interpreters (as in Lisp) in languages with Turing complete type systems. Mike _______________________________________________ fonc mailing list [email protected] http://vpri.org/mailman/listinfo/fonc
