Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • SEARCH
  • Home
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 802673
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 14, 20262026-05-14T23:38:33+00:00 2026-05-14T23:38:33+00:00

In SICP 1.2.1 there is a function that makes a rational number, as follow:

  • 0

In SICP 1.2.1 there is a function that makes a rational number, as follow:

(define (make-rat n d)
  (let ((g (gcd n d)))
    (cons (/ n g) (/ d g))))

I’m just curious how you can implement the same thing using lambda instead of let, without calling GCD twice. I couldn’t figure it out myself.

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-05-14T23:38:33+00:00Added an answer on May 14, 2026 at 11:38 pm

    Looking at SICP section 1.3.2,

    (let ((<var1> <exp1>)
          (<var2> <exp2>)
          ...
          (<varn> <expn>))
       <body>)
    

    is equivalent to

    ((lambda (<var1> ...<varn>)
        <body>)
     <exp1>
     ...
     <expn>)
    

    So your procedure,

    (define (make-rat n d)
      (let ((g (gcd n d)))
        (cons (/ n g) (/ d g))))
    

    should be equivalent to

    (define (make-rat n d)
      ((lambda (g)
        (cons (/ n g) (/ d g)))
      (gcd n d)))
    
    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

I have read chapter 4 of SICP, and just found that the first section
I'm trying to learn scheme via SICP. Exercise 1.3 reads as follow: Define a
The function I wrote for SICP 2.20 is: (define (same-parity x . y) (if
Consider the following implementation of a function to compute factorial: [1] (define fac-tail (lambda
In SICP exercise 2.26, this Scheme code is given: (define x (list 1 2
I'm using DrScheme to work through SICP, and I've noticed that certain procedures (for
I can see 2 ways of implementing let bindings. First, as known from SICP
I'm starting to learn Lisp with a Java background. In SICP's exercise there are
My iterative solution to SICP 1.37 is (define (con-frac n d k) (define (iter
I want to write a procedure (function) that checks if a string contains another

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.