Posted
by John
on Stack Overflow
See other posts from Stack Overflow
or by John
Published on 2010-03-30T00:50:01Z
Indexed on
2010/03/30
0:53 UTC
Read the original article
Hit count: 234
Okay this may sound like a ridiculous question, but how do you return a list in scheme.?
© Stack Overflow or respective owner
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'
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
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'
;; structure representing homework points
;; nr: number - the number of the homework
;; points: number - the number of points reached
(define-struct homework (nr points))
;; parse-homework: (list of number pairs) -> (list of homework)
;; The procedure takes a list of number pairs and produces…
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
Okay so I have started a new language in class. We are learning Scheme and i'm not sure on how to do it. When I say learning a new language, I mean thrown a homework and told to figure it out. A couple of them have got me stumped.
My first problem is:
Write a Scheme function that returns true (the…
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
I'm very new to Unix, and currently taking a class learning the basics of the system and its commands.
I'm looking for a single command line to list off all of the user home directories in alphabetical order from the /etc/passwd directory. This applies only to the home directories, and not the contents…
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
Hi,
For a school project i need to write or use a online programming editor. It is a part of a bigger project. I thought of a java application, php/html/javascript or flash.
I have a couple of things i could do:
Find a good working application and edit it so it works with the rest of the project
Find…
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
Consider a disk file containing 100 records
a. How many comparisons would be required on the average to find a record using sequential search, if the record is known to be in the file?
I figured out that this is 100/2 = 50.
b. If the record has a 68% probability of being in the file, how many comparisons…
>>> More
