Thread: Scheme

It takes some getting used to, but it can be surprisingly easy to work with compared to C syntax. There's relatively little syntax in Scheme compared to C++, so it's good to learn as a beginner's functional language.

Scheme is not my favorite language i prefer C or Java...

Scheme syntax is much more readable than C syntax. It doesn't help (a) that he didn't use code tags, and (b) if you don't use Scheme much.

(local [(define myvar 0)]

This doesn't look like Scheme to me. At least it isn't revision 5. What is this from?

This is correct syntax in DrScheme, which is what I've been using for the past term. There's probably a few differences from the standard, I'll admit.

Yeah is it just due to my blind dedication to C++, or is Scheme...ugly?

scheme looks better in code tags and with a bracket matching editor such as DrScheme

Code:

(define (nested-reverse l)
  (cond 
    ((null? l) '())
    ((list? (car l)) (append (nested-reverse (cdr l))
                       (list (nested-reverse (car l)))))
    (else (append (nested-reverse (cdr l)) (list (car l))))))

This snippet reverses a list recursively. For instance,

Code:

(nested-reverse '(a b (c d (e f) (g h) i) j k))
would return
(k j (i (h g) (f e) d c) b a)

Originally Posted by JaWiB

Yeah is it just due to my blind dedication to C++, or is Scheme...ugly?

If you don't like the syntax of Scheme, you could always try Haskell. It has order of operations and infix operators (gasp!). The most beautiful language out there, if you ask me.

Factorial function definition:

Code:

factorial 0 = 1
factorial n = n * factorial (n - 1)

Of course, you get to stomach things like infinite-length lists. An infinite-length list of numbers 1,2,3,...

Code:

positives = repeatup 1
    where repeatup n = n : repeatup (n + 1)