-
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
-
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
-
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
-
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
-
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
