Lazy pairs for Guile

Hello,

maybe of some interest:

Lazy pairs for Guile
http://uucode.com/texts/lazypair/index.html

Guile is an interpreter for the Scheme programming language, packaged
as a library which can be incorporated into programs and can be used
as a scripting language for the programs.

In my applications, I'd like to represent tree-like structures as
the real Scheme lists to Guile. There are two issues here:

* structures are big enough. Making a full copy of data is overhead,
so I'd like to instantiate tree branches on demand.

* Scheme list functions such as car, cdr, for-each etc should work
on exposed data.

These issues are solved by patching Guile source code. Not the best
way, but it works for me. Comments are appreciated.


Regards, Oleg