Note that there are some explanatory texts on larger screens.

plurals
  1. USmelwasul
    primarykey
    data
    text
    plurals
    1. This table or related slice is empty.
    1. COI'm making my way through The Little Schemer and I'm also trying to translate the functions (e.g. p 132 insert-g) into lambda abstractions as I go along. I see the similarities and wonder if other FP languages can be translated into lc. But then what Don Stewart (and others) seem to say is FP languages leave basic lc behind when real-world tasks need doing, i.e., the whole Peano style of recursive math is not always desirable when you want to code a GUI interface, etc.
      singulars
    2. CO@sepp2k: My dilemma is this: I hear how important lc is and how it is at the root of FP, but then I try to learn FP language x, y, z -- and they all seem to avoid direct comparisons with formal lc. This is troubling and confusing for a beginner.
      singulars
    3. COThank you Jon O. I'm still fuzzy on what happens in the 3rd case, where it's a nested list and not an atom. Let's say input list l is ((2)), which means on the first time through it hits case 3 with: (2) for (car l), and () for (cdr l) and my evens-results for the col -- which then goes first down the recurs. Re-entering evens-only*&co, it is true for the first cond, (null? l), and picks up '(), 1, 0 for dnewl, dproduct, dsum. But this is the very first time where, presumably, newl, product, sum would not have been initialized or even exist. But obviously I'm seeing this wrong. . . .
      singulars
 

Querying!

 
Guidance

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload