ok, i have this problem here. i was asked to write a function in Scheme, that takes an \"environment\", and an expression and it returns the value of this expression, for the variable bindings found i
Can I build iterative process using recursive call in and statement? For example, purpose, we have function fo开发者_JAVA技巧o that doesn\'t do anything. What kind of process it will create (iterativ
I have a basic interpreter in clojure. Now i need to implement for (initialisation; finish-test; loop-update) {
This question already has answers here: Closed 12 years ago. 开发者_如何学C Possible Duplicate: How many primitives does it take to build a LISP machine? Ten, seven or five?
I am very new to scheme. And now I am trying to compile some scheme code into binary file which will be loaded faster into interpreter. (The interpreter is a hybrid interpreter)Some one told me that I
I\'m working through Exercise 21.2.3 of HtDP on my own and was wondering if this is idiomatic usage of the various functions. This is what I have so far:
I get this error : cdr: expects argument of type <pair>; given #<void> and checking if (null? argument) isn\'t working
I need some advice on abstracting the find and check-callback functions. The code works fine, but it seems that there is a lot of unnecessary repetition. Is there a more elegant way to re-write them?
I\'m pretty intrigued by Gambit Scheme, in particular by its wide range of supported platforms, and its ability to put C code right in your Scheme source when needed. That said, it is a Scheme, which
I\'m starting to learn Lisp with a Java background. In SICP\'s exercise there are many tasks where students should create abstract functions with many parameters, like
加载中,请稍侯......