4 ms·
That's brilliant... I'd always assumed lisps were so tightly bound to the GC that any other memory model was infeasible.
by Pxtl 10y ago
That's brilliant... I'd always assumed lisps were so tightly bound to the GC that any other memory model was infeasible.
- piokuc 10y agoThe idea of getting rid of GC is very exciting, as GC has a lot of drawbacks. I want to study Carp to see how this was achieved. Incidentally, today I also found Bone Lisp https://github.com/wolfgangj/bone-lisp/blob/master/README.md https://github.com/wolfgangj/bone-lisp/blob/master/README.md which has the same goal.
- lispm 10y agohttps://github.com/vsedach/Thinlisp-1.1 https://github.com/vsedach/Thinlisp-1.1 ThinLisp is not a typical Lisp implementation in that it does not implement a garbage collector or many of the other run-time development features of other Lisps. ThinLisp is designed for producing high quality deliverable C libraries and executables from Lisp sources. Originally designed for real-time control applications, ThinLisp stresses run-time performance at the expense of some development time conveniences. Prescheme http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.3.4031 Schlep http://people.csail.mit.edu/jaffer/Schlep/scm2c.html BitC http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.570.5677&rep=rep1&type=pdf and various others...
- toolslive 10y agoyou might enjoy this classic then: http://www.pipeline.com/~hbaker1/LinearLisp.html http://www.pipeline.com/~hbaker1/LinearLisp.html