Description:
The Scheme Programming language.
|
|
|
ANN: hop-2.3.0
|
| |
HOP is a software development kit designed for the Web 2.0. It works
hand by hand with the browsers in order to enhance the capabilities of
the latters. It is designed for programming interactive web
applications such as web agendas, web galleries, music players,
etc. It is compatible with the major modern Web browsers (e.g.,... more »
|
|
|
ANN: bigloo3.8c
|
| |
------------------------------ ------------------------------ ----
Bigloo (3.8c) ,--^,
`a practical Scheme compiler' _ ___/ /|/
Fri Jun 1 10:11:19 CEST 2012 ,;'( )__, ) '
Inria -- Sophia Antipolis ;; // L__.... more »
|
|
|
SICP: orders of growth
|
| |
Hello,
Could you explain the following?
"The tree-recursive Fibonacci computation requires theta(phi^n) steps
and space theta(n), where phi is the golden ratio described in
section 1.2.2." [1]
Why theta(phi^n), not theta(phi^n/sqrt5)?
How to check this?
Could you also comment on the Exercise 1.14?... more »
|
|
|
problem with lat? (TLS 4ed)
|
| |
Hi, I'm just starting out with Scheme (and Lisp) and am going through The Little Schemer.
I'm confused, right at the beginning and wanted to ask, since this seems important (cf. The First Commandment)...
lat? is defined in the book as
(define lat?
(lambda (l)
(cond
((null? l) #t)... more »
|
|
|
ssax-sxml to ignore namespaces
|
| |
I'm using ssax-sxlm to parse Maven's pom.xml files. Some will have namespaces and the rest just a plain project tag. I'd like to get the sxml with the simple local names even when the namespaces are present but haven't figured out how to use ssax-sxml for doing that.
Alternatively, I defined two aliases, for ns and xsi, but can't get the sxpath function to recognize the aliases (I get "unknown namespace ns") using a string path like "//project/dependencies/*".... more »
|
|
|
SICP: Exercise 1.11.
|
| |
Hello,
I've got stuck with another exercise.
"A function f is defined by the rule that f(n) = n if n<3 and f(n) =
f(n - 1) + 2f(n - 2) + 3f(n - 3) if n> 3. Write a procedure that
computes f by means of a recursive process. Write a procedure that
computes f by means of an iterative process." [1]... more »
|
|
|
SICP: Counting change
|
| |
Hello,
"If a is exactly 0, we should count that as 1 way to make change." [1]
Could you explain this? I thought that we should count that as 0 ways
to make a change.
[1] [link]
Regards
|
|
|
