Version française
Home     About     Download     Resources     Contact us    
Browse thread
[Caml-list] Queens examples
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: -- (:)
From: Frank Atanassow <franka@c...>
Subject: Re: [Caml-list] Queens examples
Gerd Stolpmann wrote (on 26-08-01 13:33 +0200):
> The point is that the recursive call (concmap f t) occurs within an
> expression, and the current execution environment must be saved on the stack
> before the self-invocation such that it is still available when the
> containing expression (f h (concmap f t)) is being evaluated. This is what
> all programming languages do when recursive definitions are executed.

First, stack allocation of activation frames is more usually a property of a
programming language implementation, than of the programming language itself.

Second, the last statement is false. For example, SML/NJ, Stackless Python and
undoubtedly some implementations of Scheme all allocate activation frames on
the heap (in order to support first-class continuations efficiently).

-- 
Frank Atanassow, Information & Computing Sciences, Utrecht University
Padualaan 14, PO Box 80.089, 3508 TB Utrecht, Netherlands
Tel +31 (030) 253-3261 Fax +31 (030) 251-379
-------------------
Bug reports: http://caml.inria.fr/bin/caml-bugs  FAQ: http://caml.inria.fr/FAQ/
To unsubscribe, mail caml-list-request@inria.fr  Archives: http://caml.inria.fr