Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!zaphod.mps.ohio-state.edu!sol.ctr.columbia.edu!ira.uka.de!smurf!artcom0!hb.maus.de!ms.maus.de!Kai_Henningsen
From: Kai_Henningsen@ms.maus.de (Kai Henningsen)
Newsgroups: comp.lang.eiffel
Subject: Re: Functions without side eff
Message-ID: <18038@ms.maus.de>
Date: 22 Jun 91 00:07:00 GMT
Article-I.D.: ms.18038
Distribution: world,comp
Organization: Maus Mailbox Netz - UUCP-Gateway Bremen
Lines: 19


William F Ogden ogden @ seal.cis.ohio-state.edu schrieb am Mo 17.06.1991,
15:34

WF>|Just to add another vision of Stack :-), mine has two operations
WF>|        Push : Stack x Value -> Stack
WF>|        Pop  : Stack -> Stack x Value
WF>|where calls are denoted via equations, and updates via 's (a clumsy
WF>|syntax, admittedly).  Then the usual procedural Push is
WF>|        S' = Push(S,v),
WF>   ...
WF>Boy this version looks like it would involve a lot of gratuitous
WF>stack copying.

If you implement the stack as a list - none at all. Or use reference semantics.
--
Kai Henningsen  Internet: kh@ms.maus.de or kaih@math.uni-muenster.de
Muenster         UUCP: any_backbone_that_knows_domains!ms.maus.de!kh
Germany         Fido: kh%maus ms, 2:242/2.6 or Kai Henningsen, 2:242/2.244