if you want to make something like this for haskell (and
i'd very much like to use it!-), there are several issues,
including:
1 handling code:
- going for a portable intermediate representation,
such as bytecode, is most promising, especially
if the code representation is
[EMAIL PROTECTED] wrote:
Hey everyone; recently I've been toying around with various methods of writing
a shell and reading the academic literature on such things. The best prior art
on the subject seems to be the ESTHER shell (see
http://citeseer.ist.psu.edu/689593.html,
In an email to the HAppS listt today, alexj described that HAppS-State
provides a way to serialize function calls for replay either on-restart or
on other replicated boxes. (which actually helped me to understand somewhat
what's going on behind all its TemplateHaskell magic. This is somewhat more
On 5 Dec 2007, [EMAIL PROTECTED] wrote:
Since from my Lisp days I know that code is data, it strikes me that
one could probably somehow smuggle Haskell expressions via this route
although I am not sure this is a good way to go or even how one would
do it (to turn, say, a list of the chosen
On 2007.12.05 15:56:49 +0100, John van Groningen [EMAIL PROTECTED] scribbled
0.7K characters:
[EMAIL PROTECTED] wrote:
Hey everyone; recently I've been toying around with various methods of
writing a shell and reading the academic literature on such things. The best
prior art on the
Hey everyone; recently I've been toying around with various methods of writing
a shell and reading the academic literature on such things. The best prior art
on the subject seems to be the ESTHER shell (see
http://citeseer.ist.psu.edu/689593.html,
http://citeseer.ist.psu.edu/744494.html,
