Scheme procedure problem

Posted by Zun on Stack Overflow See other posts from Stack Overflow or by Zun
Published on 2010-03-31T08:28:43Z Indexed on 2010/03/31 8:33 UTC
Read the original article Hit count: 290

Filed under:

Scheme

|

sicp

I defined the Scheme procedure to return another procedure with 2 parameters :

(define (smooth f)
  (?(x dx)(/ (+ (f (- x dx))
             (f x)
             (f (+ x dx)))
          3.0)))

if i run this procedure with sin procedure with 2 arguments 10 and 0.0001 then it is ok

  ((smooth sin) 10 0.0001) ==> -0.544021109075966

if i run this procedure recursively, then it has error

((smooth (smooth sin)) 10 0.0001)
==> procedure expects 2 arguments, given 1: #<promise:temp6>

So can anyone tell me where is my problem? Thank you in advance !!!

PS:this is apart of exercise 1.44 in SICP

© Stack Overflow or respective owner

Related posts about Scheme

About "If.." in Scheme (plt-scheme)

as seen on Stack Overflow - Search for 'Stack Overflow'
I had a pretty simple requirement in my Scheme program to execute more than one statement, in the true condition of a 'if'. . So I write my code, something like this: (if (= 1 1) ((expression1) (expression2)) ; these 2 expressions are to be executed when the condition is true (expression3)… >>> More
Detecting EOF in a Binary File using Scheme

as seen on Stack Overflow - Search for 'Stack Overflow'
(define (read-all-input) (local ((define line (bytes->list (read-bytes 4)))) (if (eof-object? line) empty (cons line (read-all-input))))) (void (read-all-input)) The above code fails because bytes-list expects an argument of type byte string, but is given # >>> More
Scheme: Detecting duplicate elements in a list

as seen on Stack Overflow - Search for 'Stack Overflow'
Does R6RS or Chez Scheme v7.9.4 have a library function to check if a list contains duplicate elements? Alternatively, do either have any built in functionality for sets (which dis-allow duplicate elements)? So far, I've only been able to find an example here. The problem with that is that it doesn't… >>> More
Scheme implementations - what does it mean?

as seen on Stack Overflow - Search for 'Stack Overflow'
Hi, I'm a beginning student in CS, and my classes are mostly in Java. I'm currently going through "Little Schemer" as a self study, and in the process of finding out how to do that I have found numerous references to "implementations" of Scheme. My question is, what are implementations? Are they… >>> More
Traversing Scheme function as a list

as seen on Stack Overflow - Search for 'Stack Overflow'
Isn't it possible to treat functions in Scheme as any other list? Basically, what I want do to is something like this: (define (foo) "hello") (cdr foo) ; or similar, should return the list ((foo) "hello") I've found a similar discussion about this, and I feel a bit disappointed if this is not… >>> More

Related posts about sicp

Approaching SICP in Clojure instead of Scheme

as seen on Programmers - Search for 'Programmers'
I am a third year bachelor student in a software engineering program, and I brought up the idea of reading SICP to an adviser to gain a deeper and more fundamental understanding of the principles behind all this software we engineer. He suggested not to learn Scheme to complete the book (because… >>> More
Does approaching SICP in clojure have a high chance of success? [on hold]

as seen on Programmers - Search for 'Programmers'
I am a third year bachelor student in a software engineering program, and I brought up the idea of reading SICP to an adviser to gain a deeper and more fundamental understanding of the principles behind all this software we engineer. He suggested not to learn scheme to complete the book (because… >>> More
SICP making change

as seen on Stack Overflow - Search for 'Stack Overflow'
So; I'm a hobbiest who's trying to work through SICP (it's free!) and there is an example procedure in the first chapter that is meant to count the possible ways to make change with american coins; (change-maker 100) = 292. It's implemented something like: (define (change-maker amount) (define… >>> More
No idea how to solve SICP exercise 1.11

as seen on Stack Overflow - Search for 'Stack Overflow'
This is not homework. Exercise 1.11: A function f is defined by the rule that f(n) = n if n<3 and f(n) = f(n - 1) + 2f(n - 2) + 3f(n - 3) if n 3. Write a procedure that computes f by means of a recursive process. Write a procedure that computes f by means of an iterative process. Implementing… >>> More
In SICP exercise 2.26 using DrScheme, why does cons return a list, instead of a pair of lists?

as seen on Stack Overflow - Search for 'Stack Overflow'
In SICP exercise 2.26, this Scheme code is given: (define x (list 1 2 3)) (define y (list 4 5 6)) Then this cons call is given: (cons x y) I expected a pair of lists would result, ((1 2 3) (4 5 6)) but the interpreter gives, ((1 2 3) 4 5 6) ...a list with 4 elements, the first being a list.… >>> More