[plt-scheme] Standard ML in PLT Scheme

From: Robby Findler (robby at cs.uchicago.edu)
Date: Thu Dec 20 15:18:19 EST 2007

On Dec 20, 2007 2:11 PM, Chongkai Zhu <czhu at cs.utah.edu> wrote:
> Matthias Felleisen wrote:
> >
> > Are the denotations of 1 the same in ML as in Scheme? How about closures?
> >
> > Conjecture: It looks like you have created an unsound hybrid language.
> > I.e., unsound from the perspective of ML; its invariants can be
> > undermined now.
> >
> My conjecture is that if type-inference (which includes type checking)
> of haMLet is used, you can't violate an ML invariant in pure ML: you
> have to do it in Scheme.

Of course. But you do allow Scheme programs and ML programs to
communicate, don't you? Maybe worth having a look at this paper:


(there's also a bw version, suitable for printing on my web page)


Posted on the users mailing list.