Path: news.net.uni-c.dk!newsfeeds.net.uni-c.dk!news1.ebone.net!news.ebone.net!news.tele.dk!193.251.151.101!opentransit.net!jussieu.fr!univ-lyon1.fr!unice.fr!not-for-mail
From: Philippe TEISSIER <teissier@chez.com>
Newsgroups: comp.lang.beta
Subject: Making a simple program to learn
Date: Thu, 15 Feb 2001 22:17:55 +0100
Organization: University of Nice-Sophia Antipolis
Lines: 25
Message-ID: <3A8C4777.A078783F@chez.com>
NNTP-Posting-Host: adp-22.unice.fr
Mime-Version: 1.0
Content-Type: text/plain; charset=us-ascii; x-mac-type="54455854"; x-mac-creator="4D4F5353"
Content-Transfer-Encoding: 7bit
X-Trace: malibu.unice.fr 982271839 26242 134.59.69.31 (15 Feb 2001 21:17:19 GMT)
X-Complaints-To: usenet@malibu.unice.fr
NNTP-Posting-Date: 15 Feb 2001 21:17:19 GMT
X-Mailer: Mozilla 4.7 (Macintosh; I; PPC)
X-Accept-Language: en
Xref: news.net.uni-c.dk comp.lang.beta:12712

Hi

I 'm learning Scheme, and I visited Beta Homepage because my teacher
advised me to do so

what would be a small pattern giving the product of the n first odd
numbers as a result.

I thought of

prod_imp:  (# n: @integer;
                  enter (n)
                  (if n mod 2 = 0 then exit (n-1) else exit (n *
((n)->prod_imp)) if)
                  #);

But the compiler is to big to DL for my small modem.
Is this expression correct, if not, could you explain what correction I
need to do?

Thanx a lot

Philippe TEISSIER
philippe.teissier@unice.fr