Hi I am trying to write a function that will return an expression that is mutable and can be used as a procedure.
This is an exercise from EOPL. Procedure (invert lst) takes lst which is a list of 2-lists and returns a list with each 2-list reversed.
I\'ll be working on a project 开发者_JAVA技巧in concurrent programming, and it would be nice to be able to use Scheme. However, for this project it will be really necessary to use different CPU cores
I\'m new to programming and have had a hard time understanding recursion. There\'s a problem I\'ve been working on but can\'t figure out. I really just don\'t understand how they are solvable.
I have to write scheme with scheme.. quiet funny, but that\'s the situation. Any way, Here\'s an example for trying to write \"lambda\" expression with all the proucedors that I may use,andI need help
I\'ve read something about tail-call optimization in Scheme. But I\'m not sure whether I understand the concept of tail calls. If I have code like this:
Finally taking the plunge to learn a Lisp dialect (Scheme), I have encountered two definitions of a list -
So I have to remove the last element of a list in scheme.开发者_如何转开发 For example, let\'s say I have a list (1 2 3 4). I need to return:
How does the following process work: (define integers (cons-stream 1 (stream-map (lambda (x) (+ x 1)) 开发者_高级运维 integers))
The following racket function produces the erro开发者_如何学Cr: reference to undefined identifier: val
加载中,请稍侯......