The Scheme evaluation rule represents ____ evaluation.
A) applicative order
B) normal order
C) binary order
D) sequential order
Correct Answer:
Verified
Q33: The essential construct of lambda calculus is
Q34: The definition of a language using an
Q35: Given a list L in Scheme with
Q36: Haskell supports a type class inheritance through
Q37: Lists that obey lazy evaluation are called
Q39: Which of the following statements about scoping
Q40: The _ is used in Scheme to
Q41: In lambda calculus,a conversion that allows for
Q42: In lambda calculus,a value can be substituted
Q43: If the ML command val h::t =
Unlock this Answer For Free Now!
View this answer and more for free by performing one of the following actions
Scan the QR code to install the App and get 2 free unlocks
Unlock quizzes for free by uploading documents