Re: Learning purposes Scheme interpreterer with sup****t for

Here's an explanation of what I'm doing and what I need.
I'm working on implementing interpreter for my  hybrid language.  The
best way to think of it is a lisp syntax but with:
- brackets [] instead of ()

- built in array processing capabilities - you can do staff  like in
apl family languages
[+ 2 '[1 2 3]]
=>[3 4 5]

- rules database with unification like in prolog (sort of)
[is fact [1] 1]
=>fact
[is fact [n] [* n [fact [1- n]]]
fact

-tacit programming
[/ + count] // definition for average
[[/ + count] 4 10 1 ]
=> 5

-function manipulation
etc


The implementation language is c/c++ for the core,  extension will be
in edi itself. Something like s9fs http://www.t3x.org/bits/s9fes/
and
many bigger scheme impelmentations which implemnt part in c part in
scheme.
I want to keep the interpreter small and avoid external dependencies
as much as I can. I don't care about speed. Currently Cheney copying
gc will be used, later I'll probably add generational one.


My biggest issue is to remove the c call stack from the game. I want
to manipulate my own call stacks.Those call stack will be used to
implement continuations( continuation is a snapshot of the call stack
and the enviroment ,If I'm understanding the concept right). With
continuations I could implement fibers, generators, coroutines etc.

cheers
Bobi