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 notice that almost all scheme functions can only return one list as output. In the following, I would like to return multiple values of all the adjacent nodes of neighbors.
I have code like this to convert hex into byte string (define (word->bin s) (let ((n (string->number s)))
I want to return nothing when if condition is not met, for instance (if x y z) so if x is not met, z w开发者_如何学编程ill be executed and I want to do nothing at z, just same as pythons \"pass\" F
I\'ve gone through the academic Scheme stuff (read SICP, The Little Schemer, The Seasoned Schemer, TSPL) and been playing with Scheme as a toy for a while.
I\'m trying to write a function in scheme that takes a list and squares every item on the list, then returns the list in the form (list x y z). However, I\'m not sure how to write a code that will do
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
I need to create a sub-function that will return me all the adjacent node, which I needed for this question in Scheme. I\'m new to scheme, not sure how I can combine two conditions into one test case
I\'m trying to add a plugin architecture to my C# app. I\'ve chosen IronScheme as the language, and also because it\'s built on the DLR, which should make it easier to embed.
Let f transform one value to another, then I\'m writing a function that repeats the transformation n times.
加载中,请稍侯......