[e-lang] Ecru REPL bugs

[Kevin Reid]

On Jul 20, 2008, at 18:37, Mark Seaborn wrote:

> Would it make sense to reuse CPython's storage model?  i.e. Its object
> headers, reference counting, and cycle collecting GC.  It may not be
> the fastest language implementation in the world, but it would give
> you precise GC very quickly, and bridging to Python would be trivial.
>
> Is there anything in E's data model that would make that awkward?  As
> I understand it, promises can "become" the object they resolve to,
> which would not work with Python's "is" operator.  E's EQ would have
> to follow promises' resolution chains before doing the comparison.

This is not a lone problem: E requires that available comparison  
operations also equate different instances of Selfless objects, so  
promises are not the only thing prohibiting exposure of pointer- 
comparison.


I'm pleased to hear that another E implementation is up and running.  
How's the performance? Can it run my half-baked benchmark script yet?

<svn://www.slimy.com/cl-e/e-benchmark/trunk>

BTW, MarkM and I have been doing a lot of E design discussion that  
hasn't been written down anywhere. (What little has been is on the  
wiki; see particularly <http://wiki.erights.org/wiki/Category:Unresolved_design_issues 
 > and <http://wiki.erights.org/wiki/Category:ELib_specification>.)  
Feel free to contact me on IRC or otherwise if you're looking for any  
sort of info on E design.

-- 
Kevin Reid                            <http://homepage.mac.com/kpreid/>