How to check if any of the elements in the list of lists in not null in Scheme?

In my Scheme interpreter written in JavaScript, I want to modify the some function that that checks if any of the elements in the list return true. With implementation that allow to pass multiple lists.

Is Reading the Spec Enough? [closed]

It’s difficult to tell what is being asked here. This question is ambiguous, vague, incomplete, overly broad, or rhetorical and cannot be reasonably answered in its current form. For help clarifying this question so that it can be reopened, visit the help center. Closed 12 years ago. This question is centered around Scheme but really […]

What is the meaning of # in R5RS Scheme number literals

There is a partial answer on Stack Overflow, but I’m asking something a teeny bit more specific than the answers there.

SICP – Why use accumulate with cons when filter already passes back a list

In SICP 2nd Edition section 2.2.3,
the authors have the following code:

Applying Denotational Semantics to design of Programs

I’ve read a bit on denotational semantics (DS) and I’m very intrigued about the process of designing computer programs where types and functions have strong and clear mappings to mathematics.

Who first coined the term Higher Order Function and/or First Class Citizen?

I’ve come to understand that long before Haskell, O’Caml or LISP, higher order functions were an academic research subject and in mathematics, Schönfinkel (in 1967) and Haskell Curry (in 1968) already applied techniques such as currying, but that was before it was available in any programming language.

Types in Lisp and Scheme

I see now that Racket has types. At first glance it seems to be almost identical to Haskell typing. But is Lisp’s CLOS covering some of the space Haskell types cover? Creating a very strict Haskell type and an object in any OO language seems vaguely similar. It’s just that I’ve drunk some of the Haskell kool-aid and I’m totally paranoid that if I go down the Lisp road, I’ll be screwed due to dynamic typing.

In Scheme, what is formally a program’s state?

I think i’ve understood more or less what a parsed Scheme program looks like (a binary tree with atomic values on the leaves, if i have understood correctly). Can anybody please define to me, or give a reference, what a state (or a computation) of a Scheme program is? Is it just the current binding plus a position, or a stack of positions, on the syntax tree? (In such a case, i would appreciate a reference for a formal definition of Scheme binding as well :).)

“Final” Scheme REPL definitions: how to save them?

Is there a way to show and save all “final” definitions entered into a Scheme REPL into a text file?

Show all definitions in Scheme?

I want to see all user-made definitions in a Scheme REPL, both loaded from files and entered at the REPL. Is there any way to “dump all definitions”?