Howdie,
I've been learning the refal language recently
(http://refal.botik.ru/book/html/ )
and I've been wondering, if there's any way
to simulate the behaviour of the refal's pattern
matcher using the Andrew K. Wright's/Alex Shinn's
pattern matcher for Scheme. Namely,
the Refal tutorial presents a
Panicz Maciej Godek writes:
> I don't know whether the Scheme's pattern matcher
> has any notation for getting the last element of a list.
> At first, I thought that maybe it could be done using
> the unquote-splicing operator, so the equivalent code
> would look like this:
> (define (palindrome?
Hi,
The first part of this message may look irrelevent, but you'll
understand why I decided to start this way.
I'm going to write a library.
Here is the list of things I care about (from the most important to
the least important):
- Strict type system;
- Wide community;
- Performance.
There
Hello,
Here are a few random thoughts: I had a project a little while ago to
try to get some of the benefit of static typing in Guile. It never
went very far, but actually some of the same machinery is coming to
the surface in the compiler anyway. I think it could be taken farther,
to the point th
