Groups > comp.lang.forth > #20899

Re: Algorithm design: computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!)

From	Andrew Haley <andrew29@littlepinkcloud.invalid>
Subject	Re: Algorithm design: computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!)
Newsgroups	comp.lang.forth
References	(1 earlier) <920a596a-9d56-43cc-ac6d-6f1758058710@googlegroups.com> <98eb98de-b24c-47bd-9480-37f6bde941d8@googlegroups.com> <ki967o$kc7$1@speranza.aioe.org> <5148759d.489569357@news.demon.co.uk> <kic08e$v5o$1@speranza.aioe.org>
Message-ID	<-aqdnSSujs6nF9TMnZ2dnUVZ_qadnZ2d@supernews.com> (permalink)
Date	2013-03-20 05:06 -0500

Show all headers | View raw

Rod Pemberton <do_not_have@notemailnotq.cpm> wrote:
> "Stephen Pelc" <stephenXXX@mpeforth.com> wrote in message
> news:5148759d.489569357@news.demon.co.uk...
>> On Tue, 19 Mar 2013 04:07:33 -0400, "Rod Pemberton"
>> <do_not_have@notemailnotq.cpm> wrote:
>>
>> >Nearly every commercial Forth processor, if not all of them,
>> >has been a failure in the market place.
>>
>> Nearly every commercial language-specific processor, if not all
>> of them, has been a failure in the market place.
>>
> 
> Well, that could be true, but I don't know about that.  One
> non-Forth design is fairly recent (Java ... ?).  So, I doubt you
> could claim it's a failure already, although maybe the others
> were...

People keep trying.

> Of course, the question you should be asking is how many non-Forth
> language-specific processors have been created versus Forth
> processors?  I can only think of a couple non-Forth
> language-specific processors.  C doesn't need a language-specific
> processor that supports C natively to prove it's effectiveness.

And neither does Forth.

There was a C-language processor, the Hobbit.  I know this because I
am one of the few people in the world actually to have programmed one!

http://en.wikipedia.org/wiki/AT%26T_Hobbit  

> It's effective on whatever platform is available.  Personally, I'd
> say that basically true of Forth too, since many Forths that
> contribute to Forth's ubiquitousness are coded in C.  But, the Forth
> community seems to think otherwise: that a Forth specific processor
> will somehow*prove* the Forth language or philsophy or ideology to
> be "superior" overall.

Oh dear, I think we have an attempt to construct a straw man.  Let's
see...

> There have been numerous Forth processors.  None have proven that.
> Why does there need to be a Forth specific processor in the first
> place?  It's another thing entirely to develop a highly effective
> stack processor, which would happen to run Forth better than it
> would run C.  It would run C worse since it effectively would be
> register crippled.  C's advantage is that it's implementations have
> been a good fit to multiple generations of microprocessor
> architectures from numerous manufacturers over three decades,

I don't think that C is a good fit.  If you look at the ideal C
processor it's not going to look like a typical register machine.
You'd have something more like the Hobbit.  C works well on modern
processors because of heroic efforts by compiler writers.

> whereas Forth needs features not found on most processors: multiple
> stacks, fast stack manipulation operations, a fast instruction for
> implementing NEXT for threaded code, etc.

Andrew.

Back to comp.lang.forth | Previous | Next — Previous in thread | Next in thread | Find similar

Thread

Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) AKE <assadebrahim2000@gmail.com> - 2013-03-17 08:52 -0700
  Re: Algorithm design: computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) Alex McDonald <blog@rivadpm.com> - 2013-03-17 10:41 -0700
    Re: Algorithm design: computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) AKE <assadebrahim2000@gmail.com> - 2013-03-17 11:08 -0700
      Re: Algorithm design: computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) "Elizabeth D. Rather" <erather@forth.com> - 2013-03-17 08:52 -1000
        Re: Algorithm design: computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) AKE <assadebrahim2000@gmail.com> - 2013-03-17 12:28 -0700
          Re: Algorithm design: computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) Alex McDonald <blog@rivadpm.com> - 2013-03-17 13:09 -0700
            Re: Algorithm design: computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) AKE <assadebrahim2000@gmail.com> - 2013-03-17 13:25 -0700
              Re: Algorithm design: computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) Alex McDonald <blog@rivadpm.com> - 2013-03-17 13:53 -0700
                Re: Algorithm design: computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) albert@spenarnc.xs4all.nl (Albert van der Horst) - 2013-03-17 23:31 +0000
                Re: Algorithm design: computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) Alex McDonald <blog@rivadpm.com> - 2013-03-18 02:13 -0700
              Re: Algorithm design: computational cost of ordinary stack operations  (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) anton@mips.complang.tuwien.ac.at (Anton Ertl) - 2013-03-19 16:45 +0000
                Re: Algorithm design: computational cost of ordinary stack operations  (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) rickman <gnuarm@gmail.com> - 2013-03-28 18:58 -0400
            Re: Algorithm design: computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) albert@spenarnc.xs4all.nl (Albert van der Horst) - 2013-03-17 23:27 +0000
              Re: Algorithm design: computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) Alex McDonald <blog@rivadpm.com> - 2013-03-18 02:14 -0700
          Re: Algorithm design: computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) mhx@iae.nl (Marcel Hendrix) - 2013-03-18 00:22 +0200
            Re: Algorithm design: computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) Sieur de Bienville <morrimichael@gmail.com> - 2013-03-20 12:27 -0700
          Re: Algorithm design: computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) "Elizabeth D. Rather" <erather@forth.com> - 2013-03-17 16:19 -1000
            Re: Algorithm design: computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) AKE <assadebrahim2000@gmail.com> - 2013-03-18 00:45 -0700
              Re: Algorithm design: computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) Elizabeth D Rather <erather@forth.com> - 2013-03-19 10:34 -1000
                Re: Algorithm design: computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) AKE <assadebrahim2000@gmail.com> - 2013-03-19 13:49 -0700
  Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) Paul Rubin <no.email@nospam.invalid> - 2013-03-17 13:39 -0700
    Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) AKE <assadebrahim2000@gmail.com> - 2013-03-17 14:42 -0700
      Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) Paul Rubin <no.email@nospam.invalid> - 2013-03-17 14:49 -0700
      Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) Matthias Koch <matthias.koch@hot.uni-hannover.de> - 2013-03-18 11:02 +0100
  Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) Pablo Hugo Reda <pabloreda@gmail.com> - 2013-03-17 15:11 -0700
  Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) "Rod Pemberton" <do_not_have@notemailnotq.cpm> - 2013-03-17 21:40 -0400
    Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) Andrew Haley <andrew29@littlepinkcloud.invalid> - 2013-03-18 04:26 -0500
      Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) Bernd Paysan <bernd.paysan@gmx.de> - 2013-03-18 15:46 +0100
      Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) "Rod Pemberton" <do_not_have@notemailnotq.cpm> - 2013-03-19 04:15 -0400
        Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) Andrew Haley <andrew29@littlepinkcloud.invalid> - 2013-03-19 05:03 -0500
        Re: INTERLUDE SUMMARY  --- Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) AKE <assadebrahim2000@gmail.com> - 2013-03-19 04:07 -0700
        Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) mhx@iae.nl (Marcel Hendrix) - 2013-03-19 20:56 +0200
          Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) stephenXXX@mpeforth.com (Stephen Pelc) - 2013-03-19 21:03 +0000
            Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) "Rod Pemberton" <do_not_have@notemailnotq.cpm> - 2013-03-20 05:53 -0400
  Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) AKE <assadebrahim2000@gmail.com> - 2013-03-18 01:07 -0700
    Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) Paul Rubin <no.email@nospam.invalid> - 2013-03-18 01:53 -0700
      Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) AKE <assadebrahim2000@gmail.com> - 2013-03-18 02:32 -0700
        Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) Paul Rubin <no.email@nospam.invalid> - 2013-03-18 02:45 -0700
          Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) AKE <assadebrahim2000@gmail.com> - 2013-03-18 03:28 -0700
            Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) Paul Rubin <no.email@nospam.invalid> - 2013-03-18 10:20 -0700
      Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) anton@mips.complang.tuwien.ac.at (Anton Ertl) - 2013-03-18 18:23 +0000
  Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) Brad Eckert <hwfwguy@gmail.com> - 2013-03-18 10:19 -0700
    Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) Elizabeth D Rather <erather@forth.com> - 2013-03-18 10:44 -1000
      And what about locals? Zbiggy <zbigniew2011REMOVE@gmail.REMOVE.com> - 2013-03-18 23:28 +0000
        Re: And what about locals? mhx@iae.nl (Marcel Hendrix) - 2013-03-19 01:20 +0200
        Re: And what about locals? Elizabeth D Rather <erather@forth.com> - 2013-03-18 17:17 -1000
          Re: And what about locals? m.a.m.hendrix@tue.nl - 2013-03-19 00:42 -0700
            Re: And what about locals? stephenXXX@mpeforth.com (Stephen Pelc) - 2013-03-19 10:06 +0000
            Re: And what about locals? Alex McDonald <blog@rivadpm.com> - 2013-03-19 12:53 -0700
          Re: And what about locals? Zbiggy <zbigniew2011REMOVE@gmail.REMOVE.com> - 2013-03-19 09:46 +0000
          Re: And what about locals? stephenXXX@mpeforth.com (Stephen Pelc) - 2013-03-19 11:52 +0000
        Re: And what about locals? anton@mips.complang.tuwien.ac.at (Anton Ertl) - 2013-03-19 16:08 +0000
          Re: And what about locals? Bernd Paysan <bernd.paysan@gmx.de> - 2013-03-19 22:40 +0100
            Re: And what about locals? anton@mips.complang.tuwien.ac.at (Anton Ertl) - 2013-03-20 11:43 +0000
              Re: And what about locals? Bernd Paysan <bernd.paysan@gmx.de> - 2013-03-20 19:05 +0100
    Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) AKE <assadebrahim2000@gmail.com> - 2013-03-18 14:24 -0700
      Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) Elizabeth D Rather <erather@forth.com> - 2013-03-18 11:59 -1000
      Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) Brad Eckert <hwfwguy@gmail.com> - 2013-03-18 15:04 -0700
        Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) AKE <assadebrahim2000@gmail.com> - 2013-03-18 15:22 -0700
      Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) "Rod Pemberton" <do_not_have@notemailnotq.cpm> - 2013-03-19 04:07 -0400
        Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) albert@spenarnc.xs4all.nl (Albert van der Horst) - 2013-03-19 12:49 +0000
          Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) "Rod Pemberton" <do_not_have@notemailnotq.cpm> - 2013-03-20 05:33 -0400
            Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) albert@spenarnc.xs4all.nl (Albert van der Horst) - 2013-03-20 19:52 +0000
              Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) "Rod Pemberton" <do_not_have@notemailnotq.cpm> - 2013-03-21 05:53 -0400
        Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) stephenXXX@mpeforth.com (Stephen Pelc) - 2013-03-19 14:27 +0000
          Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) AKE <assadebrahim2000@gmail.com> - 2013-03-19 08:02 -0700
            Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) "Elizabeth D. Rather" <erather@forth.com> - 2013-03-19 08:07 -1000
            Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) stephenXXX@mpeforth.com (Stephen Pelc) - 2013-03-19 20:50 +0000
              Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) "Rod Pemberton" <do_not_have@notemailnotq.cpm> - 2013-03-20 05:47 -0400
                Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) stephenXXX@mpeforth.com (Stephen Pelc) - 2013-03-20 10:28 +0000
              Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) AKE <assadebrahim2000@gmail.com> - 2013-03-20 09:34 -0700
                Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) stephenXXX@mpeforth.com (Stephen Pelc) - 2013-03-20 18:41 +0000
                Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) AKE <assadebrahim2000@gmail.com> - 2013-03-21 00:07 -0700
                Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) AKE <assadebrahim2000@gmail.com> - 2013-03-21 00:16 -0700
                Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) Paul Rubin <no.email@nospam.invalid> - 2013-03-21 00:42 -0700
                Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) "Elizabeth D. Rather" <erather@forth.com> - 2013-03-20 21:55 -1000
                Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) Bernd Paysan <bernd.paysan@gmx.de> - 2013-03-21 16:22 +0100
                Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) AKE <assadebrahim2000@gmail.com> - 2013-03-21 10:59 -0700
                Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) Andrew Haley <andrew29@littlepinkcloud.invalid> - 2013-03-21 04:42 -0500
                Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) stephenXXX@mpeforth.com (Stephen Pelc) - 2013-03-21 10:54 +0000
                Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) Bernd Paysan <bernd.paysan@gmx.de> - 2013-03-21 16:37 +0100
                Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) Brad Eckert <hwfwguy@gmail.com> - 2013-03-22 08:34 -0700
                Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) Andrew Haley <andrew29@littlepinkcloud.invalid> - 2013-03-22 10:44 -0500
                Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) Bernd Paysan <bernd.paysan@gmx.de> - 2013-03-22 21:00 +0100
                Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) Bernd Paysan <bernd.paysan@gmx.de> - 2013-03-22 21:04 +0100
                Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) stephenXXX@mpeforth.com (Stephen Pelc) - 2013-03-22 18:10 +0000
          Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) Bernd Paysan <bernd.paysan@gmx.de> - 2013-03-19 20:30 +0100
            Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) stephenXXX@mpeforth.com (Stephen Pelc) - 2013-03-19 21:05 +0000
              Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) Bernd Paysan <bernd.paysan@gmx.de> - 2013-03-20 01:58 +0100
          Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) "Rod Pemberton" <do_not_have@notemailnotq.cpm> - 2013-03-20 05:43 -0400
            Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) Andrew Haley <andrew29@littlepinkcloud.invalid> - 2013-03-20 05:06 -0500
              Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) anton@mips.complang.tuwien.ac.at (Anton Ertl) - 2013-03-20 10:45 +0000
                Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) Andrew Haley <andrew29@littlepinkcloud.invalid> - 2013-03-20 11:08 -0500
                Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) anton@mips.complang.tuwien.ac.at (Anton Ertl) - 2013-03-20 17:40 +0000
                Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) Andrew Haley <andrew29@littlepinkcloud.invalid> - 2013-03-20 13:25 -0500
                Re: Algorithm design:  computational cost of ordinary stack operations (dup, r kenney@cix.compulink.co.uk - 2013-03-21 05:42 -0500
                Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) anton@mips.complang.tuwien.ac.at (Anton Ertl) - 2013-03-21 18:14 +0000
                Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) Andrew Haley <andrew29@littlepinkcloud.invalid> - 2013-03-21 15:05 -0500
                Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) anton@mips.complang.tuwien.ac.at (Anton Ertl) - 2013-03-30 15:48 +0000
                Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) Andrew Haley <andrew29@littlepinkcloud.invalid> - 2013-03-30 12:00 -0500
                Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) anton@mips.complang.tuwien.ac.at (Anton Ertl) - 2013-03-31 12:36 +0000
                Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) Andrew Haley <andrew29@littlepinkcloud.invalid> - 2013-04-01 04:41 -0500
                Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) anton@mips.complang.tuwien.ac.at (Anton Ertl) - 2013-04-01 14:12 +0000
                Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) albert@spenarnc.xs4all.nl (Albert van der Horst) - 2013-03-21 18:46 +0000
              Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) "Rod Pemberton" <do_not_have@notemailnotq.cpm> - 2013-03-21 05:51 -0400
                Re: Algorithm design: computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) Alex McDonald <blog@rivadpm.com> - 2013-03-21 04:04 -0700
                Re: Algorithm design: computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) "Rod Pemberton" <do_not_have@notemailnotq.cpm> - 2013-03-22 03:15 -0400
                Re: Algorithm design: computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) Paul Rubin <no.email@nospam.invalid> - 2013-03-22 00:16 -0700
                Re: Algorithm design: computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) "Rod Pemberton" <do_not_have@notemailnotq.cpm> - 2013-03-22 04:11 -0400
                Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) Andrew Haley <andrew29@littlepinkcloud.invalid> - 2013-03-21 07:21 -0500
                Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) anton@mips.complang.tuwien.ac.at (Anton Ertl) - 2013-03-21 17:45 +0000
                Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) Andrew Haley <andrew29@littlepinkcloud.invalid> - 2013-03-21 15:13 -0500
                Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) anton@mips.complang.tuwien.ac.at (Anton Ertl) - 2013-03-27 17:38 +0000
                Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) Andrew Haley <andrew29@littlepinkcloud.invalid> - 2013-03-27 13:23 -0500
                Language for implementing other languages (was: Algorithm design ...) anton@mips.complang.tuwien.ac.at (Anton Ertl) - 2013-03-30 11:08 +0000
                Re: Language for implementing other languages Paul Rubin <no.email@nospam.invalid> - 2013-03-30 08:50 -0700
                Re: Language for implementing other languages anton@mips.complang.tuwien.ac.at (Anton Ertl) - 2013-03-31 13:15 +0000
                Re: Language for implementing other languages Paul Rubin <no.email@nospam.invalid> - 2013-03-31 08:03 -0700
                Re: Language for implementing other languages Andrew Haley <andrew29@littlepinkcloud.invalid> - 2013-03-30 11:08 -0500
                Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) "Rod Pemberton" <do_not_have@notemailnotq.cpm> - 2013-03-22 03:52 -0400
                Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) Andrew Haley <andrew29@littlepinkcloud.invalid> - 2013-03-22 04:15 -0500
                Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) "Rod Pemberton" <do_not_have@notemailnotq.cpm> - 2013-03-24 15:03 -0400
                Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) "Elizabeth D. Rather" <erather@forth.com> - 2013-03-24 14:36 -1000
                Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) Andrew Haley <andrew29@littlepinkcloud.invalid> - 2013-03-25 05:05 -0500
                Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) albert@spenarnc.xs4all.nl (Albert van der Horst) - 2013-03-25 12:02 +0000
                Re: Algorithm design: computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) Mark Wills <markrobertwills@yahoo.co.uk> - 2013-03-25 07:26 -0700
                Re: Algorithm design: computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) Alex McDonald <blog@rivadpm.com> - 2013-03-25 08:25 -0700
                Re: Algorithm design: computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) "Rod Pemberton" <do_not_have@notemailnotq.cpm> - 2013-03-29 18:09 -0400
                Re: Algorithm design: computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) Andrew Haley <andrew29@littlepinkcloud.invalid> - 2013-03-30 04:52 -0500
                Re: Algorithm design: computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) anton@mips.complang.tuwien.ac.at (Anton Ertl) - 2013-03-30 10:36 +0000
                Re: Algorithm design: computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) Andrew Haley <andrew29@littlepinkcloud.invalid> - 2013-03-30 10:58 -0500
                Re: Algorithm design: computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) Paul Rubin <no.email@nospam.invalid> - 2013-03-30 09:40 -0700
                Re: Algorithm design: computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) "Rod Pemberton" <do_not_have@notemailnotq.cpm> - 2013-03-29 18:13 -0400
                Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) "Rod Pemberton" <do_not_have@notemailnotq.cpm> - 2013-03-29 18:12 -0400
                Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) anton@mips.complang.tuwien.ac.at (Anton Ertl) - 2013-03-27 17:25 +0000
                Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) Bernd Paysan <bernd.paysan@gmx.de> - 2013-03-27 22:19 +0100
                Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) anton@mips.complang.tuwien.ac.at (Anton Ertl) - 2013-03-28 11:19 +0000
                Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) Andrew Haley <andrew29@littlepinkcloud.invalid> - 2013-03-28 07:19 -0500
                Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) Bernd Paysan <bernd.paysan@gmx.de> - 2013-03-28 17:58 +0100
                Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) Andrew Haley <andrew29@littlepinkcloud.invalid> - 2013-03-28 16:22 -0500
                Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) Bernd Paysan <bernd.paysan@gmx.de> - 2013-03-29 02:06 +0100
                Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) Andrew Haley <andrew29@littlepinkcloud.invalid> - 2013-03-29 04:23 -0500
                Re: Algorithm design: computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) "WJ" <w_a_x_man@yahoo.com> - 2013-03-28 15:41 +0000
                Re: Algorithm design: computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) Bernd Paysan <bernd.paysan@gmx.de> - 2013-03-28 18:00 +0100
                Re: Algorithm design: computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) Andrew Haley <andrew29@littlepinkcloud.invalid> - 2013-03-28 16:26 -0500
                Re: Algorithm design: computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) anton@mips.complang.tuwien.ac.at (Anton Ertl) - 2013-03-29 14:11 +0000
                Re: Algorithm design: computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) anton@mips.complang.tuwien.ac.at (Anton Ertl) - 2013-03-29 14:53 +0000
                Re: Algorithm design: computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) Paul Rubin <no.email@nospam.invalid> - 2013-03-29 08:49 -0700
                Re: Algorithm design: computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) anton@mips.complang.tuwien.ac.at (Anton Ertl) - 2013-03-29 16:54 +0000
                Re: Algorithm design: computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) Paul Rubin <no.email@nospam.invalid> - 2013-03-30 13:06 -0700
                Re: Algorithm design: computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) anton@mips.complang.tuwien.ac.at (Anton Ertl) - 2013-03-31 11:36 +0000
                Re: Algorithm design: computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) Bernd Paysan <bernd.paysan@gmx.de> - 2013-04-01 02:18 +0200
                Re: Algorithm design: computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) Paul Rubin <no.email@nospam.invalid> - 2013-03-31 19:33 -0700
                Re: Algorithm design: computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) Bernd Paysan <bernd.paysan@gmx.de> - 2013-04-01 16:18 +0200
                Re: Algorithm design: computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) Andrew Haley <andrew29@littlepinkcloud.invalid> - 2013-04-01 11:17 -0500
                Re: Algorithm design: computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) Bernd Paysan <bernd.paysan@gmx.de> - 2013-04-02 04:30 +0200
                Re: Algorithm design: computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) anton@mips.complang.tuwien.ac.at (Anton Ertl) - 2013-04-01 15:54 +0000
                Re: Algorithm design: computational cost of ordinary stack operations (dup, ro kenney@cix.compulink.co.uk - 2013-04-01 14:54 -0500
                Re: Algorithm design: computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) Andrew Haley <andrew29@littlepinkcloud.invalid> - 2013-03-30 13:08 -0500
                Re: Algorithm design: computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) anton@mips.complang.tuwien.ac.at (Anton Ertl) - 2013-04-02 16:00 +0000
                Re: Algorithm design: computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) Andrew Haley <andrew29@littlepinkcloud.invalid> - 2013-04-02 16:47 -0500
                Re: Algorithm design: computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) anton@mips.complang.tuwien.ac.at (Anton Ertl) - 2013-04-03 11:27 +0000
                Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) "Rod Pemberton" <do_not_have@notemailnotq.cpm> - 2013-03-23 01:57 -0400
            Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) anton@mips.complang.tuwien.ac.at (Anton Ertl) - 2013-03-20 10:23 +0000
  Re: Algorithm design:  computational cost of ordinary stack operations  (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) anton@mips.complang.tuwien.ac.at (Anton Ertl) - 2013-03-19 17:38 +0000
  Re: Algorithm design:  computational cost of ordinary stack operations (dup, rot, over, swap, etc.) vs. cost of fetch (@) and store (!) Michael L Gassanenko <m_l_g3@yahoo.com> - 2013-03-21 04:53 -0700

csiph-web