Can anyone help me out understanding the various parameter passing modes in Sch开发者_Go百科eme? I know Scheme implements parameter passing by value. But how about other modes?
I have (apply f\'(x1 x2 x3 .... xn)), and I\'d like to change it to a ma开发者_如何学Ccro expansion: (f x1 x2 x3...xn). What kind of problems can occur?If you\'re just converting
I\'m writing an application (A juggling pattern animator) in PLT Scheme that accepts Scheme expressions as values for some fields. I\'m attempting to write a small text editor that will let me \"explo
how can I write a function to take the last elemen开发者_Go百科t of the list? find the last of a list:
Consider the following BNF defining trees of numbers. Notice that a tree can ei开发者_StackOverflow社区ther be a leaf, a node-1 with one subtrees, or a node-2
I\'ve been teaching myself functional programming, and I\'m currently writin开发者_运维百科g different higher order functions using folds. I\'m stuck implementing scan (also known as prefix sum). My m
I am new to Scheme. I have tried and implemented probabilistic variant of Rabin-Miller algorithm using PLT Scheme. I know it is probabilistic and all, but I am getting the wrong results most of the ti
For example, I want to开发者_高级运维 break the long string in the below panic statement: (panic \"Truth-assignment length is longer than the number of propositions!\")
According to SICP section 1.2.6, exercise 1.22: Most Lisp implementations include a primitive called runtime that returns an integer that specifies the amount of time the system has been running (me
There is Gambit Scheme, MIT Scheme, PLT Scheme, Chicken Scheme, Bigloo, Larceny, ...; then there are all the lisps.
加载中,请稍侯......