I search for a programming language for which a compiler exists and that supports self modifying code. I’ve heared that Lisp supports thes开发者_如何学Ce features, but I was wondering if there is a m
I\'m trying to solve a problem in Scheme which is demanding me to use a nested loop or a nested recursion.
I learned quite a bit of scheme from SICP but am more interested in common lisp no开发者_如何转开发w. I know common lisp\'s fold is reduce, with special arguments for left or right folding, but what i
When using parenscript if I execute (parenscript:ps (slot-value ($ \"#mytextarea\") \'selectionStart))
On the xkcd site today, the following appeared as a joke in a <script language=\"scheme\"> tag so what does the following code do / represent?
I\'m bewildered by all the built-in Mathematica functions that purport to prevent evaluation in some way: Unevaluated, Defer, Hold, and over half a dozen of the form Hold*.The Mathematica documentatio
I\'m trying to have a function compare the first argument of a passed in argument to a value, then if it is true, perform some function, then recursively call the same function.
I have this problem to work on: The sum higher order procedure can be generalised even further to capture the idea of combining terms with a fixed operator. The mathematical product operator is a spe
Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.
I\'m working on a small side project for a friend and I need to build complex forms dynamically from a set of predefined types which in-turn are persisted via the underlying object model.
加载中,请稍侯......