Scheme follows a minimalist design philosophy specifying a small standard core with powerful tools for language extension. Its compactness and elegance have made it popular with educators, language designers, programmers, implementors, and hobbyists. The main feature of scheme when compared to ...
2
votes
0answers
29 views
Insert-everywhere
This is HTDP Excercise 12.4.2 :- Page 161
Develop a function insert-everywhere. It consumes a symbol and a list
of words. The result is a list of words like its second argument, but
with the ...
1
vote
0answers
53 views
SICP ex. 2.42 “eight queens puzzle”
The problem can be found online here.
In short, we're given the following function definition, that will recursively generate all the possible solutions for the "eight-queen-problem".
(define ...
1
vote
0answers
32 views
Implementing buffered channels in Guile
I was looking for a way of doing simple message passing in Guile and found some references to the module (ice-9 occam-channel) which is a pretty nifty, but undocumented, module for occam-like ...
3
votes
2answers
77 views
A newbie's Program to sort a list in scheme (DrRacket)
Here's a program I wrote to sort a list of numbers in increasing order (without using inbuilt sort function).
(define (sort-list l)
(define first-element (if (not (null? l)) (car l) 0))
(cond ...
2
votes
1answer
51 views
An in-nested sequence generator for racket scheme
I've been learning about racket sequences and noticed a hole where nested iteration is concerned. We have the in-parallel construct but no in-nested construct. There's the for*/... family, but ...
3
votes
0answers
54 views
A weblog, implemented in Scheme
It has been said that Lisp - family languages, though not often used to implement web applications, are actually very well-suited to that task, and that all the libraries you need already exist. To ...
2
votes
1answer
225 views
A list builder or list accumulator
Imagine a UTF-8 decoder that takes a list of bytes and
returns humman readable code points like:
> (utf-8->human-readable-code-points '(32 32 195 160 160))
("u+0020" "u+0020" "u+00E0" ("Error: ...
1
vote
0answers
387 views
integrating SFML and Box2D lib, and a Mass Production Shape Factory
i just wrote two new headers: one that integrates Box2D and SFML by a class called BodyRep which creates/ is a graphic representation of any body, and one that produces huge amounts of uniform shapes, ...
0
votes
0answers
261 views
GIMP script-fu to export layers
I've written this script for exporting layers from an image in GIMP:
;MIT license.
(define (script-fu-export-layers img drw path outnameformat)
; credit to Vijay Mathew on Stack Overflow for the ...
0
votes
0answers
80 views
Locating a pair in an infinite stream
From SICP:
Exercise 3.66. Examine the stream
(pairs integers integers). Can you
make any general comments about the
order in which the pairs are placed
into the stream? For example, about
...
2
votes
1answer
62 views
Write a procedure stream-limit that finds
From SICP:
Exercise 3.64. Write a procedure
stream-limit that takes as arguments a
stream and a number (the tolerance).
It should examine the stream until it
finds two successive elements ...
0
votes
0answers
24 views
Modify serialized-exchange (from SICP chapter 3) to ensure that accounts are operated on in order of lowest account ID first
From SICP:
Exercise 3.48. Explain in detail why
the deadlock-avoidance method
described above, (i.e., the accounts
are numbered, and each process
attempts to acquire the
...
1
vote
0answers
110 views
Write a definition of a semaphore in terms of test-and-set! operations
From SICP:
Exercise 3.47. A semaphore (of size
n) is a generalization of a mutex.
Like a mutex, a semaphore supports
acquire and release operations, but it
is more general in that up to n
...
1
vote
0answers
98 views
Write a definition of a semaphore in terms of mutexes
From SICP:
Exercise 3.47. A semaphore (of size
n) is a generalization of a mutex.
Like a mutex, a semaphore supports
acquire and release operations, but it
is more general in that up to n
...
0
votes
1answer
89 views
(Scheme) how to create a function that multiplies all numbers between “a” and “b” with do loop
I'm making a function that multiplies all numbers between an "a" input and a "b" input with do loop. If you please, check my function and say what's wrong since I don't know loops very well in Scheme.
...
