Re: mixing lush with clush
Ralf Juengling <[email protected]> Sat, 25 Mar 2006 12:14:26 -0800 (PST)
| Newsgroups | gmane.lisp.lush.devel |
|---|---|
| Message-ID | <[email protected]> |
On Fri, 24 Mar 2006, Yury Sulsky wrote: > my delirium I decided it'd be a good idea to write a type inferencer > for lush. I'm halfway done with that. cool. > One problem I've run into is that there are a billion primitives in > Lush. Both the type inferencing and C compilation would be much easier > if we had a strict set on top of which everything is built. How about: > > let let* lambda mlambda -- does anything else create a new lexical scope? > defparameter defvar setq > quote declare scope > cond and or not = == > you want to implement if-else in terms of cond, not the other way around? > selectq while progn idx-gloop idx-eloop you have progn whith let > eval apply cinline > * + - / div mod bitand bitor bitxor bitshl bitshr > > Am I missing anything? cons, car, cdr, consp, null classof what about other mathematical functions? what about constructors of builtin types (htable, make-array, etc.) and primitives specific to those types? Ralf ------------------------------------------------------- This SF.Net email is sponsored by xPML, a groundbreaking scripting language that extends applications into web and mobile media. Attend the live webcast and join the prime developer group breaking into this new coding territory! http://sel.as-us.falkag.net/sel?cmd=lnk&kid=110944&bid=241720&dat=121642