Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!sdd.hp.com!uakari.primate.wisc.edu!zaphod.mps.ohio-state.edu!sol.ctr.columbia.edu!ira.uka.de!fauern!opal!small05
From: small05@opal.cs.tu-berlin.de (Christoph Breitkopf)
Newsgroups: comp.lang.scheme
Subject: SCOOPS method calls (tail-recursive?)
Message-ID: <2619@dolphin.cs.tu-berlin.de>
Date: 12 Feb 91 12:01:37 GMT
Sender: small05@opal.cs.tu-berlin.de
Organization: Technical University of Berlin, Germany
Lines: 28


   I have a question about the semantics of SCOOPS
method calls.  In the SCOOPS implementation I'm using
(TI PC-Scheme 3.01) method calls don't seem to be
tail-recursive.  The program I used to test this is:

(define-class foo)     ; a VERY simple class

(define-method (foo bar) ()
  (send instance baz))

(define-method (foo baz) ()
  (send instance bar))

(define instance (make-instance foo))

(send instance bar)


The last expression causes a stack overflow in PC-Scheme.

Question: Is this non tail-recursive behavior normal
(necessary) SCOOPS sematics?  If not, I would consider
this a bug in TI's implementation.

Any comments?

- Chris