HDTenEightyP/NetNews huggingface dataset:
From: keivan@wuphys.wustl.edu (Keivan Esfarjani)
Newsgroups: fj.mail-lists.parallel
Subject: Biblio. on supercomputing & parallel processing
Date: 9 Sep 92 12:24:00 GMT
Distribution: fj

Thanx everybody for your replies concerning a bibliography
of supercomputers and parallel processing.
So this is the list of the books and journals that I got
from some of you.

* Review articles:

	- the August 1992 edition of Communications of ACM.
	- the August 1992 edition of Byte (I do not recommend!)

* Books:

	- George Almasi and Allan Gottlieb's "Highly Parallel Computing"
	  Benjamin/ Cummings Pub.
	- K. Hwang, F. A. Briggs' "Computer Architecture & Parallel
	  processing" . Mc Graw Hill Pub.
	-  F.T. Leighton's "Introduction To Parallel Algorithms &
	  Architectures" . Morgan Kaufmann Pub.
	- Greg Wilson's "Past, Present, Parallel: A Survey Of Parallel
	  Computing". Springer Pub.
        - Dongarra, J., Duff, I., Gaffney, P., McKee, S.'s "Vector 
	  and Parallel Computing : issues in applied research and 
	  development", Ellis Horwood Series in Computers and their 
	  Applications, John Wiley & Sons, England, 1989.
	 
* Technical Journals:

	- SIAM (but these are technical and very specific papers,
	  I did not find any review article on para. processing)
	- Parallelogram Magazine (btw, I didn't get the sample copy 
	  you promised Damon!)

* From the net:

	- Some pepole at siam.com
	- SuperNet:
	    SuperNet International is an internet service which provides 
	    on-line information about supercomputers.  

	    To access SUPERNET INT'L:
	    telnet or rlogin: supernet.ans.net or 147.225.1.51
	    (Remember! At the initial <login:> prompt, always enter as supernet, 
	    your <user name> will be prompted for later.)

	    Modem Dial-Up:    (408) 428-2565 vt100 N81
	    Support:          (800) 234-7977
From: pratt@cs.Stanford.EDU
Newsgroups: fj.mail-lists.types
Subject: Re: quantum logics
Date: 10 Sep 92 15:05:27 GMT
Distribution: fj

To: linear@cs.stanford.edu
Date: 09 Sep 92 17:01:22 PDT (Wed)

	Date: Wed, 9 Sep 92 09:55 BST
	From: Thomas Forster <T.Forster@pmms.cam.ac.uk>
	Does anybody know anything about sequent calculi for quantum logics?

There is a fleeting reference to sequent calculi on p.451 of M.L. Dalla
Chiara's survey article "Quantum Logic" in Vol. III of the Handbook of
Philosophical Logic.  She gives 12 rules for "a QL-calculus (in the
natural deduction style) which is a slight modification of a calculus
proposed by Goldblatt [J.Phil.Logic 1974, 19-35]", and proves its
soundness and completeness with respect to a Kripke semantics whose
relation is symmetric and irreflexive (QL: orthoframe; LL: web).

One algorithm for tracking down quantum logic topics is to look in the
index to Pavicic's recent "Bibliography on Quantum Logics and Related
Structures", Int.J.Theor.Physics 31:3373-461 (1992).  Following the
bibliography proper (1851 entries) is an index of all nontrivial words
appearing in the titles.  I looked in vain for sequent, calculus,
Gentzen, natural, and deduction.  Quantum logicians appear to hew to
the Birkhoff-von Neumann algebraic perspective and thus far seem to
have had little motivation to explore the world of sequent calculi.

So for this topic a better algorithm is apparently to look in survey
articles like Dalla Chiara's.

Some statistics on QL cited by Pavicic: 1851 papers in the
bibliography, involving 575 authors, only 112 of whom participated in
five or more papers (Pavicic infers that QL has a high turnover).
Average number of authors per paper: 1.3.

	Vaughan Pratt
From: jack@dcs.gla.ac.uk
Newsgroups: fj.mail-lists.types
Subject: sequent calculi for quantum logics
Date: 12 Sep 92 17:43:06 GMT
Distribution: fj

Date: Fri, 11 Sep 92 13:27:30 BST
To: linear@cs.stanford.edu

Thomas Forster asks:
> Does anybody know anything about sequent calculi for quantum logics?

Two references I know of:

  Hirokazu Nishimura: "Sequential method in quantum logic", Journal of
  Symbolic Logic, volume 45 number 2, 1980, pp. 339-352.

  N.J. Cutland and P.F. Gibbins: "A regular sequent calculus for quantum
  logic in which /\ and \/ are dual", Logique et Analyse, volume 25, 1982,
  pp. 221-248.

(Note, the paper by E.-W. Stachow in Beltrametti and van Fraassen with
the title "Sequential quantum logic" is *not* about sequent calculi - it's
about a logic for temporally sequenced experiments).

--  Jack Campin    room G092, Computing Science Department, Glasgow University,
17 Lilybank Gardens, Glasgow G12 8RZ, Scotland   TEL: 041 339 8855 x6854 (work)
INTERNET: jack@dcs.glasgow.ac.uk or via nsfnet-relay.ac.uk    FAX: 041 330 4913
BANG!net: via mcsun and uknet     BITNET: via UKACRL    UUCP: jack@glasgow.uucp
From: girard@logique.jussieu.fr
Newsgroups: fj.mail-lists.types
Subject: About the questions by S. Courtenage
Date: 14 Sep 92 22:44:39 GMT
Distribution: fj

Date: Mon, 14 Sep 92 15:41:38 +0200
To: linear@cs.stanford.edu

		About the questions by S. Courtenage


		Concerning the translation(s) of IL into LL the
following remarks mught be of interest :
	 i)LL is not the result of abstract philosophical
speculations; concretely studying the denotational semantics of
intuitionistic logic, (coherence spaces) i found out that that the
intuitionistic arrow was not primitive, but could be decomposed into
two steps (bang and -o). Therefore LL has been built along this
translation.
	ii) as long as we are interested in provability (Lindenbaum
algebras etc) surely many other translations are possible ; as noticed
by Vaughan, there is an esthetical malaise in front of unnecessary
bangs that occur in these alternative translations.
	iii) beyond esthetics we have to remember that the viewpoint
which is the most relevant to constructivism puts proofs at the
prominent place : one is not interested in knowing whether or not A is
provable, but how it is provable... This leads to denotational
semantics, geometry of interaction etc. In this respect we become
interested in more than mere equivalence of formulas. We get
interested in synonymy -a vague notion which can be approximated by
the idea of denotational isomorphism. Therefore one must read
translations as proposing isos. My translation has the advantage of
preserving the CCC properties of IL. This is the the strongest
argument for it.
	iv) however it might be of interest to try other translations
and to study them in the spirit of denotational semantics. The
translation by means of !(A -o B) is far from preserving the usual CCC
isos, but it has its own virtues. Let us just mention one : models of
lambda-calculus can be indifferently described as fixpoints of !X -o X
or of !(Y -o Y)... the second choice is in the spirit of lazy
lambda-calculi and is reminiscent of the modelisation by means of
strictness/lifting proposed by Abramsky (i remember a talk, not a
paper, sorry).
	This to say that there are very few good translations, that
the one i proposed will presumably remain the standard one, but that
for specific purposes (eg lazyness) it might be worth studying
alternatives. 


Jean-Yves Girard

new address : 122E Bd Perier 13008 MARSEILLE (private : the address of
the Lab of Discrete Maths is not yet in use)

for the moment i am keeping my usual Email addresses
girard@margaux.inria.fr
girard@logique.jussieu.fr
From: sa@doc.ic.ac.uk
Newsgroups: fj.mail-lists.types
Subject: Re: About the questions by S. Courtenage
Date: 15 Sep 92 16:13:00 GMT
Distribution: fj

Date: Tue, 15 Sep 1992 11:23:20 +0100 (BST)

Here is the reference to a paper describing my work on the lazy lambda
calculus which Jean-Yves alluded to in his message:
``The lazy lambda calculus'' in Research Topics in Functional
Programming, ed. D. Turner, Addison Wesley 1990, pages 65-117.
There is also a joint paper with Luke Ong on ``Full Abstraction in
theLazy lambda Calculus'', which is to appear in Information and
Computation next year. It is currently available as a U. Cambridge
Computer laboratory report (No. 259).

On the matter of different translations of lambda calculus, it might be
worth mentioning that it is the one based on the recursive type 
	D = !(D -o D)
and NOT 
	D = !D -o D,
which is used by Gonthier, Abadi and Levy in their ``rational
reconstruction'' of Lamping's algorithm for optimal reduction in the
lambda calculus.  (See their POPL paper of this year). The former
translation seems to allow more sharing than the latter.

This seems to me to be an excellent example of the way in which the
finer-grained Linear connectives allow important operational
distinctions to be reflected in the logic, and studied in a structural
way.

Samson Abramsky
Return-Path: <hearn@hilbert.rand.org>
From: ruiz_velasco@ccucvx.unican.es (Carlos Ruiz de Velasco)
Subject: Matrix inversion
Original-To: reduce-forum@rand.org
Date: Tue, 08 Sep 92 09:28:40 -0700
Newsgroups: fj.mail-lists.reduce
Distribution: fj

I have found the following problem working with matrix inversion
in positive characteristic:

REDUCE 3.4, 15-Jul-91 ...

1: on modular;setmod 12;

1

3: a:=mat((6,1),(5,0));
     [6  1]
A := [    ]
     [5  0]


4: b:=a**(-1);
     [0  7]
B := [    ]
     [1  6]


5: a*b;
[1  0 ]
[     ]
[0  11]


6: off modular;
7: c:=a**(-1);
     [     1   ]
     [0   ---  ]
     [     5   ]
C := [         ]
     [     - 6 ]
     [1  ------]
     [     5   ]


8: on modular;
9: d:=c;
     [0  5]
D := [    ]
     [1  6]


10: a*d;
[1  0]
[    ]
[0  1]


11: bye;

Clearly, matrix A is regular in M2x2(Z/12) and A**(-1) is D in that ring.
What happens?
Best regards
             Carlos Ruiz de Velasco
Return-Path: <hearn@hilbert.rand.org>
From: herbert@dagobert.zib-berlin.de (Herbert Melenk)
Subject: Re: loop with out
Original-To: ZIEMEK@plwrtu11.BITNET (Z.Popowicz)
Original-Cc: reduce-forum@rand.org
Date: Mon, 07 Sep 92 11:19:45 -0700
Newsgroups: fj.mail-lists.reduce
Distribution: fj

> 
> Who knows how to construct the loop with output files.?
> In the loop in the every step the new output file should be opened.
> The following example is wrong but it describes what I want
> 
> for k:=1 : 1000 do << out "**/f(k)";sentence;shut "**/f(k)";>>;
> 
> ***************************************************************
> Z.Popowic
> 

The following model should work if you have REDUCE under PSL
(I know, you have!):

share j;
for j:= .......
  <<out lisp bldmsg("/tmp/hugo.%w",j);
     do something
    shut lisp bldmsg("/tmp/hugo.%w",j);
    >>;

The PSL function "bldmsg" allows to fill a string with format
slots, which are given by %w . In order to pass the value of j
from algebraic mode to symbolic mode you better declare the variable
j share (allthough that might be superfluous in some cases).

--
Herbert Melenk
Konrad-Zuse-Zentrum fuer Informationstechnik
Heilbronner Str 10, D 1000 Berlin 31, Germany
e-mail:  melenk@sc.zib-berlin.de
Return-Path: <hearn@hilbert.rand.org>
From: ZIEMEK@plwrtu11.BITNET ("Z.Popowicz")
Subject: loop with out
Original-To: forum <REDUCE-FORUM@rand.org>
Date: Mon, 07 Sep 92 08:24:11 -0700
Newsgroups: fj.mail-lists.reduce
Distribution: fj

Who knows how to construct the loop with output files.?
In the loop in the every step the new output file should be opened.
The following example is wrong but it describes what I want

for k:=1 : 1000 do << out "**/f(k)";sentence;shut "**/f(k)";>>;

***************************************************************
Z.Popowic
Return-Path: <hearn@hilbert.rand.org>
From: herbert@dagobert.zib-berlin.de (Herbert Melenk)
Subject: new book
Original-To: reduce-forum@rand.org
Date: Mon, 07 Sep 92 08:23:03 -0700
Newsgroups: fj.mail-lists.reduce
Distribution: fj

Today a book has been delivered which might be of interest for
many people among the REDUCE users:

@BOOK{Steeb:91a,
 AUTHOR = "Willi-Hans Steeb and Dirk Lewien",
 TITLE = "Algorithms and Computation with {REDUCE}",
 PUBLISHER = "BI-Wissenschaftsverlag, Mannheim", YEAR = 1992,
 ABSTRACT ={This book gives a collection of 75 standard methods
 in mathematics, physics and engineering together with their
 programs in {REDUCE} 3.4. Each item consists of a one page mathematical
 description and one page {REDUCE} algebraic source text (in most cases
 a few lines only). The book is an introduction by example
 to algebraic programming in {REDUCE} and a collection of
 ready to use solutions for many mathematical subtasks}

Allthough printed by a German publisher this book is in English.

--
Herbert Melenk
Konrad-Zuse-Zentrum fuer Informationstechnik
Heilbronner Str 10, D 1000 Berlin 31, Germany
e-mail:  melenk@sc.zib-berlin.de
Return-Path: <hearn@hilbert.rand.org>
From: fjw@cbpfsu1.cat.cbpf.br (Francis J Wright)
Original-To: adler@risc1.acc.uri.edu, reduce-forum@rand.org,
        ruiz_velasco@ccucvx.unican.es
Subject: Re:  Matrix inversion
Date: Thu, 10 Sep 92 09:28:04 -0700
Newsgroups: fj.mail-lists.reduce
Distribution: fj

	Maybe the exponent -1 is being evaluated mod 12. There are a lot of
	problems like that with modular stuff, e.g. if you have a 5x5 matrix
	and you are working mod 3, you will have trouble referencing the
	(3,4) element correctly.

	When I have to invert a matrix in positive characteristic, I first
	turn modular mode off, then invert the matrix, then return to
	modular.

	Allan Adler
	adler@risc1.acc.uri.edu

I think powers are one of the few things that are not affected by on
modular.  Having tried tracing multm and matinverse, I think that the
matrix is being inverted and not multiplied, so it appears that the
problem is that the inversion routine assumes that it is working in
characteristic 0, and does not work correctly if it is not.
Otherwise, I agree with you.

Francis
Return-Path: <hearn@hilbert.rand.org>
From: fjw@cbpfsu1.cat.cbpf.br (Francis J Wright)
Original-To: REDUCE-FORUM@rand.org, ZIEMEK@plwrtu11.BITNET
Subject: Re:  loop with out
Date: Thu, 10 Sep 92 08:59:24 -0700
Newsgroups: fj.mail-lists.reduce
Distribution: fj

	From: "Z.Popowicz" <ZIEMEK@plwrtu11.bitnet>

	Who knows how to construct the loop with output files.?
	In the loop in the every step the new output file should be opened.
	The following example is wrong but it describes what I want

	for k:=1 : 1000 do << out "**/f(k)";sentence;shut "**/f(k)";>>;

	***************************************************************
	Z.Popowic

Here is another solution.  It works under PSL (on a SUN), and I think
has some chance of being portable.  The explicit call of mkfil may not
be necessary under other Lisps, but it should do no harm.  This is
similar to the suggestion by Rainer Schoepf, but it does not involve
writing any new procedures.

If I recall correctly, we suggested this technique in our book but
without the mkfil.  I think that version will work in implementations
that use the standard REDUCE code for in, out and shut, which calls
mkfil internally, whereas I think that PSL-REDUCE uses its own code.


symbolic operator mkfil;

for i := 1:3 do   % write some files
   begin scalar file;
      file := mkid(fjw, i);
      out <<mkfil file>>;
      write file;
%      write "END$";  % stops the read loop!
      shut <<mkfil file>>
   end;

for i := 1:3 do   % read them back
   begin scalar file;
      file := mkid(fjw, i);
      in <<mkfil file>>
   end;

END$


Dr. Francis J. Wright
Visiting from August 1992 to July 1993:	|  EMail: fjw@cbpfsu1.cat.cbpf.br
Centro Brasileiro de Pesquisas Fisicas	|  Phone: +55 (21) 541-0337 R 176
Rua Dr. Xavier Sigaud 150,  Botafogo	|  FAX:   +55 (21) 541-2047
22290 Rio de Janeiro - RJ,  BRAZIL	|  Telex: 21-22563 CBPQ BR
Return-Path: <schoepf@sc.ZIB-Berlin.DE>
Date: Mon, 7 Sep 92 17:34:17 +0200
From: schoepf@sc.ZIB-Berlin.DE (Rainer Schoepf)
Original-To: reduce-forum@RAND.org
Subject: Re: loop with out
Reply-To: Schoepf@sc.ZIB-Berlin.DE
Organization: Konrad-Zuse-Zentrum fuer Informationstechnik Berlin
Newsgroups: fj.mail-lists.reduce
Distribution: fj

"Z.Popowicz" writes:

 > Who knows how to construct the loop with output files.?
 > In the loop in the every step the new output file should be opened.
 > The following example is wrong but it describes what I want
 > 
 > for k:=1 : 1000 do << out "**/f(k)";sentence;shut "**/f(k)";>>;

The following rather arcane construction does what you want from
algebraic mode:

procedure do_out(file); out file;

procedure do_shut(file); shut file;

for k :=1 :10 do << do_out(mkid(xx,k)); write k; do_shut(mkid(xx,k))>>;


   Rainer Schoepf
   Konrad-Zuse-Zentrum                       ,,Ich mag es nicht, wenn
    fuer Informationstechnik Berlin            sich die Dinge so frueh
   Heilbronner Strasse 10                      am Morgen schon so
   W-1000 Berlin 31                            dynamisch entwickeln!''
   Federal Republic of Germany
   <Schoepf@sc.ZIB-Berlin.de> or <Schoepf@sc.ZIB-Berlin.dbp.de>
Return-Path: <hearn@hilbert.rand.org>
From: adler@risc1.acc.uri.edu (Allan Adler)
Original-To: reduce-forum@rand.org, ruiz_velasco@ccucvx.unican.es
Subject: Re:  Matrix inversion
Date: Tue, 08 Sep 92 10:46:48 -0700
Newsgroups: fj.mail-lists.reduce
Distribution: fj

Maybe the exponent -1 is being evaluated mod 12. There are a lot of
problems like that with modular stuff, e.g. if you have a 5x5 matrix
and you are working mod 3, you will have trouble referencing the
(3,4) element correctly.

When I have to invert a matrix in positive characteristic, I first
turn modular mode off, then invert the matrix, then return to
modular.

Allan Adler
adler@risc1.acc.uri.edu
From: logic@mtak.bsj.com (Masami Takikawa)
Newsgroups: fj.lang.forth
Subject: Re: Inverse Polish notation (Re: Introduction to FORTH)
Date: 10 Sep 92 04:42:12 GMT
	<1992Sep6.200659.26799@iris.is.tsukuba.ac.jp>
Reply-To: logic@mtak.bsj.com (Masami Takikawa)
Followup-To: fj.lang.forth
Distribution: fj
Organization: The Takikawa, Corvallis, Oregon, U.S.A.
Posting-Front-End: Terakoya-u kaku 2.04 March 31, 1990

In article <1992Sep6.200659.26799@iris.is.tsukuba.ac.jp>
	yas@softlab.is.tsukuba.ac.jp (Yasushi Shinjo) writes:
>> $BKM$O7k6IBLL\$G$7$?!#%9%?%C%/$K2?$,@Q$s$G$"$k$N$+!"3P$($i$l$J$$(J
>> $B$7!":.Mp$7$F$7$^$&$N$G$9!#$d$O$j!"#C$N$h$&$K%9%?(J
>> $B%C%/>e$NJQ?t$KL>A0$r$D$1$F$7$^$&$N$,!"@52r$@$H;W$$$^$9!#(J
>
>$B:G6a$N(JForth$B$K$O!"%9%?%C%/$KL>A0$,IU$1$i$l$k$b$N$,$"$j$^$9!#(J
>$B#G#N#U%=%U%H%&%'%"$H$7$FG[$i$l$F$$$k(J Tile Forth $B$,$=$&$G$9!#(J

$B$=$l$OJXMx!#8zN($O$I$&$J$s$G$7$g$&!)$d$C$Q$j!"(Jframe pointer
$B$r;H$C$F%"%/%;%9$9$k$N$+$J!)(J


>$BNY$N(J fj.lang.postscript $B$K$O!"(JPostScirpt $B$N;H$$<j$NJ}$,$?$/(J
>$B$5$s$$$i$C$7$c$$$^$9$,!"$I$&$J$s$G$7$g$&$M!#(JPostScript $B$N>l(J
>$B9g!"5U%]!<%i%s%I5-K!$KG:$^$5$l$F$$$k46$8$O$7$J$$$N$G$9$,!#(J
>$B!V5U%]!<%i%s%I$$$d$G!"(JPostScript $B$r;H$&$N$r$d$a$^$7$?!W$H$$(J
>$B$&?M$NOC$rJ9$$$?$3$H$,$"$j$^$;$s!#(J

Postscript $B$O(J Smalltalk $B$d(J Lisp $B$HF1$8$G%V%m%C%/(J(closure)$B$,;H(J
$B$($k$N$,JXMx$G$9$M!#(J
--
$B$?$-$+$o!w$*$l$4$s(J
Xref: sparky fj.lang.forth:13 fj.lang.postscript:277
From: yas@softlab.is.tsukuba.ac.jp (Yasushi Shinjo)
Newsgroups: fj.lang.forth,fj.lang.postscript
Subject: Inverse Polish notation (Re: Introduction to FORTH)
Date: 6 Sep 92 20:06:59 GMT
Followup-To: fj.lang.forth
Organization: Inst. of Info. Sci. & Elec., Univ. of Tsukuba, Ibaraki, Japan.

$@?7>k!wC^GHBg3X$G$9!#$3$s$A$K$O!#(J

From article <GFJmA.908@mtak.bsj.com>,
	by logic@mtak.bsj.com (Masami Takikawa):
> forth $@Bg9%$-$NBl@n$G$9!#@$4VOC%b!<%I$G$9!#(J

$@!J%"%9%-!<$N!V%Q%=%3%s8@8l3X!W$H$$$&K\$K$O!K(J
>>Forth$@$N%W%m%0%i%`$,F|K\8l$G=q$+$l$F$$$^$9!#(JForth
>>$@$O!"5U%]!<%i%s%I5-K!$@$H$+8@$o$l$F4w$_7y$o$l$F$$$k$H$3$m$,$"(J
>>$@$j$^$9$,!"$=$l$OBg$-$J8m2r$G$9!#$?$@8l=g$,F|K\8l$HF1$8$G$"$k!"(J
>>$@$H$$$&$3$H$@$1$G$9!#F|K\8l$,Jl9q8l$N?M$J$i!"A4A3J?5$$G$9!#(J

> $@KM$O7k6IBLL\$G$7$?!#%9%?%C%/$K2?$,@Q$s$G$"$k$N$+!"3P$($i$l$J$$(J
> $@$7!":.Mp$7$F$7$^$&$N$G$9!#(J
> $@$d$O$j!"#C$N$h$&$K%9%?(J
> $@%C%/>e$NJQ?t$KL>A0$r$D$1$F$7$^$&$N$,!"@52r$@$H;W$$$^$9!#(J

$@:G6a$N(JForth$@$K$O!"%9%?%C%/$KL>A0$,IU$1$i$l$k$b$N$,$"$j$^$9!#(J
$@#G#N#U%=%U%H%&%'%"$H$7$FG[$i$l$F$$$k(J Tile Forth $@$,$=$&$G$9!#(J

$@NY$N(J fj.lang.postscript $@$K$O!"(JPostScirpt $@$N;H$$<j$NJ}$,$?$/(J
$@$5$s$$$i$C$7$c$$$^$9$,!"$I$&$J$s$G$7$g$&$M!#(JPostScript $@$N>l(J
$@9g!"5U%]!<%i%s%I5-K!$KG:$^$5$l$F$$$k46$8$O$7$J$$$N$G$9$,!#(J
$@!V5U%]!<%i%s%I$$$d$G!"(JPostScript $@$r;H$&$N$r$d$a$^$7$?!W$H$$(J
$@$&?M$NOC$rJ9$$$?$3$H$,$"$j$^$;$s!#(J

$@$"$H!"%O!<%I%&%'%"J}LL$N?M$K$b5U%]!<%i%s%I5-K!$OFk@w$_$,?<$$(J
$@$H;W$$$^$9!#$?$H$($P!"(J

       A  ___
       ===|  )---+
       B  ---    | ___
	  AND    ==)  >--
                 | ---
       ----------+  OR
       C

$@$N$h$&$J5-K!$O!"<B$O!"5U%]!<%i%s%I$J$s$G$9$M!#@h$K%G!<%?$r=q(J
$@$$$F!"8e$G1i;;;R!J(JAND, OR$@!K$r=q$$$F$$$k$G$7$g!#(JTile Forth $@$@(J
$@$H(J

    locals
    : f { a b c } a b and c or ;

$@$3$s$J46$8$G!"=q$1$^$9!#(J locals $@$H$$$&$N$,!"6I=jJQ?t$r;H$&$?(J
$@$a$N<vJ8$N(J vocabulary $@$G$9!#6I=jJQ?t$H$$$&$0$i$$$G$9$+$i!"%9(J
$@%?%C%/$KL>A0$rIU$1$k$@$1$G$J$/!"6I=jJQ?t$K$b;H$($=$&$G$9!#(J

$@!@!@!!?7>k!!Lw!!!J$7$s$8$g$&!!$d$9$7!K!!!@!@(J
$@!@!@!!C^GHBg3X!!EE;R!&>pJs!!!!!!!!!!!!!!!@!@(J
PostScript
$@$7$P$i$/N9$K=P$^$9!#(Jspool $@$K5-;v$,;D$C$F$$$k4V$/$i$$$K$O!"JV$C(J
$@$F$/$k$H;W$$$^$9!#JV$C$F$/$k$H!"3h$-$?2=@P$K$J$C$F$$$k$+$J!#(J
From: logic@mtak.bsj.com (Masami Takikawa)
Newsgroups: fj.lang.forth
Subject: Re: Internal interpreter (Re: Introduction to FORTH)
Date: 10 Sep 92 04:37:52 GMT
	<1992Sep6.194248.26684@iris.is.tsukuba.ac.jp>
Reply-To: logic@mtak.bsj.com (Masami Takikawa)
Distribution: fj
Organization: The Takikawa, Corvallis, Oregon, U.S.A.
Posting-Front-End: Terakoya-u kaku 2.04 March 31, 1990

fj.lang.* $B$O3Z$7$$$J!"$NBl@n$G$9!#(J

In article <1992Sep6.194248.26684@iris.is.tsukuba.ac.jp>,
 yas@softlab.is.tsukuba.ac.jp (Yasushi Shinjo) writes:
>$B;d$N>l9g$O!"$3$NK\$,=P$k$N$rBT$A$-$l$:$K!J$H8@$C$F$b!"$3$NK\(J
>$B$,=P$k$HCN$C$F$$$?$o$1$G$O$J$$$N$@$1$l$I$b!K!"<!$N;(;o$NFC=8(J
>$B$r2?EY$b2?EY$bFI$_$^$7$?!#(J
>
>    $B%^%$%3%s%T%e!<%?!!#N#o!%#3!!FC=8!'$9$0F0$/#F#O#R#T#H(J
>    $B86F;9(!":4F#@6Ci!"5H@n85=_!">.CS?50l!"(J
>    $B#C#Q=PHG!"#1#9#8#1G/(J

$B$*$*!"KM$,$^$@%Q%T%3%s$GM7$s$G$$$?$3$m$@$"!*$=$N:"$O9b5i8@8l(J
$B$O%Y!<%7%C%/$7$+CN$j$^$;$s$G$7$?!#(J


>Forth $B$N=hM}7O$O!"LLGr$$$G$9$h$M!#4V@\K%$$;e%3!<%I!J(Jindirect
>threaded code$B!#(Jcall $BL?Na$,>JN,$5$l$F!"%5%V%k!<%A%s$NHVCO$@$1(J
>$B$,JB$s$G$$$k$h$&$J$b$N!K$NFbIt%$%s%?%W%j%?$d%V!<%H!&%9%H%i%C(J
>$B%W$N;EAH$_$K$O!"46?4$7$^$7$?!#FbIt%$%s%?%W%j%?$O!"$$$/$D$+$N(J
>CPU$B$K$D$$$F!">e$N!VI8=`(JFORTH$B!W$N4,Kv$K$b=P$F$$$^$9!#(J

$BKM$N(J 386 forth $B$O!"$3$l0J>eC;$$%$%s%?!<%W%j%?$O$J$$$@$m!*$H$$(J
$B$&$b$N$G$9!JH?O@4?7^(J :-$B!K!#(J

	lodsd
	jmp	eax

$B$3$l$@$1$G$9!#C;$$$N$G!"FHN)$7$?%$%s%?!<%W%j%?$K$;$:$K!"$9$Y$F(J
$B$N%o!<%I$N:G8e$K>e$N#29T$r=q$-$^$9!#Nc$($P!"(J+ $B$O!"0J2<$N$h$&$K(J
$B$J$j$^$9!#(J
	dd		$B<!$N%o!<%I$N%"%I%l%9(J
	db		1           ; $BL>A0$ND9$5(J
	db		'+'         ; $BL>A0(J
	pop		eax			; $B%9%?%C%/$+$iCM$r<h$C$F$/$k(J
	add		ecx, eax	; TOS $B$KB-$9(J
	lodsd				; $B%$%s%?%W%j%?$rD>@\=q$$$A$c$&!*(J
	jmp		eax

TOS $B$b%l%8%9%?$KF~$C$F$$$^$9$N$G!"9bB.$G$9!#(J


>$B$7$P$i$/N9$K=P$^$9!#(J

Take care!

>$BN9$+$i5"$C$F$/$k$^$G(J fj.lang.forth $B$,B8:_$9$k$3$H$r4j$C$F!#(J

$B$O$O!#(J
--
$B$?$-$+$o!w$*$l$4$s(J