HDTenEightyP/NetNews huggingface dataset:
From: pds@epcc.edinburgh.ac.uk
Newsgroups: fj.mail-lists.parallel
Subject: Re: Synchonizing watches
Date: 4 Sep 92 14:08:56 GMT
Distribution: fj

> Unless I'm missing something, this is fairly straightforward.
> 
> 1) A zeroes watch, calls B and hangs up.
B hears ring at t=AB.
> 2) B waits till phone ends ringing then calls A and hangs up.
B calls at t=AB. A hears phone at t=AB+BA (so A knows AB+BA)
> 3) B calls A again and hangs up.

What does this mean?  Does B call back again at t=AB (that doesn't make
sense) or are you assuming that B can instantaneously "hear" the ring
from A's end at the first call and so calls A at t=AB+BA ringing at
A's end at AB+2BA?  I think this is where this method comes apart.

Patrick

---------------------------------------------------------------------------
 Engineers  think that theory  approximates reality | Mathematicians never
 Physicists think that reality approximates theory  | make the connection
---------------------------------------------------------------------------
 Patrick Surry, JCMB 2254, Edinburgh, Scotland   e||)   Edinburgh Parallel  
 EMail: pds@epcc.ed.ac.uk  Tel: (031) 650-5960   c||c   Computing Centre    
---------------------------------------------------------------------------
From: yvent@theseas.ntua.gr (Yiannis Ventikos)
Newsgroups: fj.mail-lists.parallel
Subject: MARKET SURVEY FOR MASS. PARALLEL MACHINES
Date: 1 Sep 92 12:44:28 GMT
Distribution: fj


            MARKET SURVEY FOR MASS. PARALLEL MACHINES

We are checking the market for a massiv. parallel machine. We got no specs so
far, just price ranges:

Class a) Up to two  million US dollars ($2 000 000)
Class b) Up to four million US dollars ($4 000 000)
Class c) Up to six  million US dollars ($6 000 000)

Since this is an initial survey, we do not want to exclude anything, so the
definition "massiv. parallel machine" is to be taken in the broadest sence.
Any input is wellcomed, ranging from simple info like :
"XYZ  costs $2.3M"
to
"ABC with n processors, M Mbytes, G Gigaflops..."
up to 
"We have purchased a FGH and have been using it for... Our experience..."

Any and all answers will be appreciated. 
E-mail at the address at the end of this message is better, if too 
difficult just followup.
-------

******************************************************************************
* Yiannis Ventikos                              *        DISCLAIMER          *
* Viscous Flows Group,                          * Any and all opinions that  *
* Dept. of Naval Arch. & Marine Eng.,           * I have  expressed  so far  *
* National Technical University of Athens,      * reflect  thoughts of mine  *
* P.O. Box 64070, GR-15710, Zografos, GREECE    * and  mine alone and  have  *
* Voice: (301) 7700405                          * nothing  to do  with  the  *
* Fax:   (301) 7774478                          * policy of the  Department  *
* e-mail: yvent@areti.marinentua.ariadne-t.gr   * I currently belong to.     *
******************************************************************************
From: dhenrich@ira.uka.de
Newsgroups: fj.mail-lists.parallel
Subject: Refs. for load balancing
Date: 31 Aug 92 17:59:40 GMT
Distribution: fj

Hi,

I would appreciate if anyone could give me some general
references concerning load balancing. I am looking for 
something like a review article that would summerize this subject.

Thanx in advance,

Dominik.

**************************************************************
  Dominik Henrich, Dipl.-Inform.

  Institute for Real-time Computer Systems and Robotics (IPR)
  University of Karlsruhe (TH)

  P 69 80, Kaiserstrasse 12     phone:      +49 721 608-4265
  D-7500 Karlsruhe-1            telefax:    +49 721 60 67 40
  F. R. of Germany              e-mail:  dhenrich@ira.uka.de
**************************************************************
From: lka@lems1alems.brown.edu (Lalit K. Agarwal)
Newsgroups: fj.mail-lists.parallel
Subject: Constructing Control Flow Graph
Date: 25 Aug 92 13:09:05 GMT
Distribution: fj

Hi !

I'm looking for any published material on actual
implementation methods & data-structures for constructing 
control-flow & dependence graphs of a c-program. All
responses will be greatly appreciated.

thanks in advance,

-Lalit K Agarwal   ( lka@lems.brown.edu )
 Brown University
 Providence, RI-02912
From: pds@epcc.edinburgh.ac.uk
Newsgroups: fj.mail-lists.parallel
Subject: Re: Synchonizing watches
Date: 4 Sep 92 14:08:47 GMT
Distribution: fj

In article <1992Sep3.201917.25468@hubcap.clemson.edu>, mailrus!samsung!ulowell!cs.ulowell.edu!wex@uunet.UU.NET (Paul M. Wexelblat) writes:

> OK A --->B:  "I'm going to say "BONG" as soon as my second hand
> reaches the 12, when you hear the "BONG", start counting seconds
> on your watch out loud.
> 
> A says "BONG" and times AB+BA seconds; at the end of that time the number
> B has reached is the BA delay

I don't think so.  A says "BONG" at t=0.  At t=AB, B hears "BONG" and
starts counting, saying "zero" at t=AB, "one" at t=AB+1, ...
A will hear "zero" at time AB+BA  - there is no way for A to know
what number B has reached because A won't hear it for another BA seconds.

I think the earlier proof that no solution exists looked right.

Patrick

---------------------------------------------------------------------------
 Engineers  think that theory  approximates reality | Mathematicians never
 Physicists think that reality approximates theory  | make the connection
---------------------------------------------------------------------------
 Patrick Surry, JCMB 2254, Edinburgh, Scotland   e||)   Edinburgh Parallel  
 EMail: pds@epcc.ed.ac.uk  Tel: (031) 650-5960   c||c   Computing Centre    
---------------------------------------------------------------------------
From: Simon.Moore@cl.cam.ac.uk (Simon Moore)
Newsgroups: fj.mail-lists.parallel
Subject: Re: Synchonizing watches
Date: 4 Sep 92 12:32:20 GMT
Distribution: fj

In article <1992Sep3.201927.25562@hubcap.clemson.edu>, leo@nas.nasa.gov
(Leo Dagum) writes:
|> In article <1992Sep3.123226.14205@hubcap.clemson.edu>
steve@hubcap.clemson.edu ("Steve" Stevenson) writes:
|> >[I saw this on sci.logic. I thought it was a nice problem for this group.
|> >  steve]
|> >>From: dougs@tvnews.tv.tek.com (Doug Stevens)
|> >>Message-ID: <1992Sep1.234452.26917@tvnews.tv.tek.com>
|> >
|> >[....]
|> 
|> Unless I'm missing something, this is fairly straightforward.
|> 
|> 1) A zeroes watch, calls B and hangs up.
|> 2) B waits till phone ends ringing then calls A and hangs up.
|> 3) B calls A again and hangs up.
|> 4) A times the first call back, and now knows (AB + BA), when he gets
|>    the second call back, he now knows BA as well (and therefore AB).
|> 5) A sets his watch back by AB, and calls B
|> 6) B picks up the phone and zeroes his watch, they now have (approximately)
|>    synchronized watches.
|> 7) Bob's your uncle.

I have a problem with this - B could place the second call (number 3) at
any time and therefore A is unable to determine the delay BA.  For example,
if B places the second call to A 1 second after the first, then all A will
see is two calls 1 second apart.

Bob isn't my uncle?

 - Simon

[Simon Moore][University of Cambridge, Computer Laboratory][swm11@uk.ac.cam.cl]
From: bcp@dcs.ed.ac.uk
Newsgroups: fj.mail-lists.types
Subject: Two papers on object-oriented programming
Date: 31 Aug 92 17:07:18 GMT
Distribution: fj

Date: Mon, 31 Aug 92 12:56:22 +0100

Two new papers on type systems for object-oriented programming are now
available for anonymous ftp; abstracts and ftp instructions follow.

The postscript sources can be emailed to sites without convenient FTP
access.  Paper copies are also available on request; they should be
printed in a few weeks.

Cheers,

        Benjamin Pierce

------------------------------------------------------------------------

	Object-Oriented Programming Without Recursive Types

            Benjamin C. Pierce  and  David N. Turner
                         ECS-LFCS-92-226

It is widely agreed that the full complexity of recursive types is
inherent in the essential mechanisms of object-oriented programming:
encapsulation, message passing, subtyping, and inheritance.  We show
here that modeling object encapsulation in terms of existential types
yields a substantially more straightforward explanation of these
features in a simpler type theory without recursive types.

File names in FTP archive:  oopsansrec    (summary)
                            oop           (expanded version)



             An Abstract View of Objects and Subtyping

               Martin Hofmann  and  Benjamin Pierce
                        ECS-LFCS-92-226

We give a direct type-theoretic characterization of the basic
mechanisms of object-oriented programming -- objects, methods, message
passing, and subtyping -- by introducing an explicit Object type
constructor together with suitable introduction, elimination, and
equality rules.  The resulting abstract framework represents a first
step towards a high-level axiomatization of object-oriented
programming, and provides a common basis for justifying and comparing
known encodings of objects in terms of the seemingly diverse machinery
of recursive record types, F-bounded quantification, and existential
types.

File name in FTP archive:  abstroop

------------------------------------------------------------------------

SAMPLE FTP SCRIPT
-----------------

ftp ftp.dcs.ed.ac.uk                [or 129.215.160.5]
login: anonymous
password: <your mail address>
binary			            [don't forget this!]
cd pub/bcp
get oop.ps.Z 
get abstroop.ps.Z
From: sanjiva@ecrc.de
Newsgroups: fj.mail-lists.types
Subject: Type Inference using Sequent Calculus formulation of IPL
Date: 27 Aug 92 15:53:21 GMT
Distribution: fj

Date: Thu, 27 Aug 92 14:53:27 +0200

Is there a reference in the existing literature where a type
inference algorithm for a functional language (with ML-like
polymorphism) is based on the Sequent Calculus formulation
of Intuitionistic Propositional Logic, rather than on the
Natural Deduction formulation?  If yes, how does it handle the
cases where the subformula property doesn't hold (in the
Implies-left rule for example)?

Thanks,
Sanjiva				sanjiva@ecrc.de
From: dmjones@theory.lcs.mit.edu (David M. Jones)
Newsgroups: fj.mail-lists.types
Subject: Online LICS bibliography
Date: 31 Aug 92 23:11:39 GMT
Distribution: fj

The online bibliography for the Annual IEEE Symposium on Logic in Computer
Science has now been updated to include all of the papers published in the
proceedings of the Seventh meeting, which took place in June 1992.  The
bibliography contains abstracts for all of the papers from the 1992
meeting.

The bibliography, which is in BibTeX format, is available via anonymous ftp
and mail server from theory.lcs.mit.edu [18.52.0.92] in the file
pub/meyer/lics.bib.

To retrieve the file via ftp, connect to theory using "anonymous" as the
login name and "guest" as the password.

To retrieve the file via mail server, send a message to the address
archive-server@theory.lcs.mit.edu with the following line in the body:

        send meyer lics.bib

An index of other available files can be retrieved with the command

        send meyer Index

More information on the archive-server can be obtained by sending a message
with only the word "help" in the body.

David M. Jones
MIT Lab for Computer Science
Administrator, {types,logic,concurrency}@theory.lcs.mit.edu
Return-Path: <hearn@hilbert.rand.org>
Subject: Problem in PSL VMS REDUCE
From: herbert@dagobert.zib-berlin.de (Herbert Melenk)
Original-To: reduce-forum@rand.org
Date: Fri, 28 Aug 92 08:53:03 -0700
Newsgroups: fj.mail-lists.reduce
Distribution: fj

 Some automatism has invented a module "pipes.b" in the directory
 "rpsl:" allthough VMS does not support Unix type pipes. That
 causes problems if you try to run the REDUCE GunPlot interface
 which then believes to find pipes and tries to use them.
 
 Please delete this file.
 
--
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>
Original-To: reduce-forum@rand.org
Subject: New and Updated Packages in the Network Library
Date: Wed, 02 Sep 92 10:13:15 -0700
From: hearn@rand.org (Tony Hearn)
Newsgroups: fj.mail-lists.reduce
Distribution: fj

The CRACK package by Andreas Brand, Friedrich Schiller University, Jena, and
Thomas Wolf, Queen Mary and Westfield College, London, has now been added to
the "de" library.  This package looks for solutions of overdetermined
systems of ordinary or partial differential equations with at most
polynomial nonlinearities.  To obtain a listing of the relevant files, send
the message "send index for de" to one of the REDUCE Network Library servers
(e.g., reduce-netlib@rand.org).  The ASSIST package by Hubert Caprasse,
University of Liege, in the util library, has also been updated.

Tony Hearn
Return-Path: <hearn@hilbert.rand.org>
From: WHEREMAN@mines.BITNET
Subject: change of email address
Original-To: reduce-forum@rand.org
Date: Sun, 30 Aug 92 12:43:30 -0700
Newsgroups: fj.mail-lists.reduce
Distribution: fj

Dear colleagues:

Many of you have contacted me in the last year with questions about
Macsyma and Reduce programs for symmetries and about various other issues.
Should you like to contact me in the future, please take note of the
following change of email address:

We no longer have bitnet available at the Colorado School of Mines.
Please do NO longer use  whereman@mines (bitnet)  but use

WHEREMAN@FLINT.MINES.COLORADO.EDU

Thanks. Sincerely yours,

Willy


Willy A. Hereman
Department of Mathematical and Computer Sciences
Colorado School of Mines
Golden, CO 80401-1887

Phone: (303) 273-3881 (O) or 440-6089 (H)
FAX: (303) 273-3278 (mention for Dr. Hereman at Ext. 3881)
From: kaneko@ICSI.Berkeley.EDU (Seiji Kaneko)
Newsgroups: fj.lang.forth
Subject: Re: Introduction to FORTH
Date: 4 Sep 1992 00:56:05 GMT
Organization: international computer science institute
NNTP-Posting-Host: axiom.icsi.berkeley.edu

$B$+$M$3!w$R$?$A$G$9!#$A$c$A$c$G$9!#(B
In article <GFJmA.908@mtak.bsj.com> logic@mtak.bsj.com (Masami Takikawa) writes:
>In article <1992Sep2.170546.11244@iris.is.tsukuba.ac.jp>
>	yas@softlab.is.tsukuba.ac.jp (Yasushi Shinjo) writes:
>>> $BI8=`#F#O#R#T#H!!0f>e30;VM:Cx!!6&N)=PHG(B
>>> $B!!(BFORTH $B8@8l$N5,3J$N2r<a$H%$%s%W%j%a%s%H$K$D$$$F=q$+$l$F$$$k!#(B

$B$&$`!";d$O$3$l$,=P$k$^$($KB-$r@v$C$F$7$^$$$^$7$?!#=hM}7O$,4JC1$K(B
$B$+$1$k$N$,L#A9$G!"(Bforth$B<+?H!"(BZ80$B$N5!3#8l!"(BBasic($BM7$S(B (;^_^))$B$N;0(B
$B<o$G=q$$$?$3$H$,M-$j$^$9!#$b$R$H$D!"F|K\EE5$$NBg@N$N(BCPU$B!"&L(BCOM-16
$B$N%^%$%/%m%W%m%0%i%`$G(B forth $B$N%$%s%?!<%W%j%?$r=q$$$FM7$s$G$$$?(B
$B;~4|$bM-$j$^$9!#(B

>forth $B$N0lHV$$$$E@$O!"=hM}7O$,4JC1$K$G$-$F$7$^$&E@$G$7$g$&$M!#(B
>$B$^$@!"(BDOS Extender $B$,<j$KF~$i$J$+$C$?;~$K!"(BPC9801 $B$G(B 80386
>native $B$GF0$/(B 32bit forth interpreter $B$r:n$C$FM7$s$G$$$^$7$?!#(B
>$B$=$N$h$&$K!"?7$7$$(B CPU $B$GF0$/9b5i8@8l$,$9$0$KM_$7$$;~$O!"(Bforth
>$B$,$$$$$H;W$$$^$9!#(B

$BEv$?$C$F$$$k$H;W$$$^$9!#(Bforth $B$@$H!"%/%m%9$N%3%s%Q%$%i$r4JC1$K(B
$B:n$l$F$7$^$&$N$,Bg$-$$!#0l<!8l$r%A%g%3%A%g%3=q$$$F!"(Bforth $B$G=q(B
$B$+$l$?(B forth compiler $B$K$A$g$C$H<j$rF~$l$FFs2s%3%s%Q%$%k$9$k$@(B
$B$1$G(B Native $B$N%3%s%Q%$%i$rEG$-$^$9$+$i!#$G$b!"5-=R@-$O0-$$$G$9(B
$B$M!##O#O#P#S$G4hD%$k$h$j!"5!3#8l$N$D$b$j$G$$$?$[$&$,$$$$$s$8$c(B
$B$J$$$N$+$J!#(B
-- 
                                               $@G-$+$V$j(J$@!w$R$?$A(J
From: uchi@ssel.toshiba.co.jp (Uchihira Naoshi)
Newsgroups: fj.lang.forth
Subject: Re: Introduction to FORTH
Date: 4 Sep 92 02:33:06 GMT
	<5792@pfrad.pfu.fujitsu.co.jp>
Reply-To: uchi@ssel.toshiba.co.jp
Distribution: fj
Organization: Systems & Software Engineering Laboratory, TOSHIBA Corporation,
	JAPAN



$@FbJ?!wEl<G$G$9!#(J

In article <5792@pfrad.pfu.fujitsu.co.jp>, gojira@pfu.fujitsu.co.jp (Yuuichi YASUDA) writes:

>> $@N>J}$H$bB?>/8E$$K\$G@dHG$+$bCN$l$^$;$s$,!"0J2<$NFs:}$r?dA&$7$^$9!#(J

>> $@#F#O#R#T#HF~Lg(J$@!!%l%*!&%V%m%G%#Cx!!86F;9(Lu!!9)3X<R(J

>> $@!!Cx<T!"Lu<T6&$KK\Ev$K(JFORTH $@8@8l$rCN$C$F$$$k$N$G%?%$%H%kDL$j(J$@$o$+(J
>> $@$j$d$9$$!#2?$h$j(JFORTH $@$N%W%m%0%i%_%s%0%9%?%$%k$K$D$$$FM}2r$G$-$k!#(J

$@>pJs$"$j$,$H$&$4$6$$$^$9!#(J
$@$3$NK\$O!"(JLeo Brodie: Starting FORTH (Prentice-Hall, 1982)$@$NLuK\$G$9$+!)(J
$@LuK\$,$"$k$H$OCN$i$:$K!"4{$K(J$@86=q$rCmJ8$7$F$7$^$$$^$7$?!#(J

$@$^$5$+!"(JLeo Brodie: Thinking FORTH$@$NLuK\$b=PHG$5$l$F$$$?$j$7$F(J.....
--

$@!!!!!!!!(J   $@!!!!FbJ?!!D>;V(J
 
     $@!J3t!KEl<G!!!!%7%9%F%`!&%=%U%H%&%'%"5;=Q8&5f=j(J
$@!!!!!!!!!!(Jtel. (044)548-5474
          fax. (044)533-3593
$@!!(J        E-mail: uchi@ssel.toshiba.co.jp$@!!(J
From: gojira@pfu.fujitsu.co.jp (Yuuichi YASUDA)
Newsgroups: fj.lang.forth
Subject: Re: Introduction to FORTH
Date: 1 Sep 92 04:44:58 GMT
Distribution: fj
X-Newsreader: Tin 1.1 PL5

Uchihira Naoshi (uchi@ssel.toshiba.co.jp) wrote:

: $@FbJ?!wEl<G$G$9!#(J
: 
: FORTH$@$N=i?4<T$G$9!#(JFORTH$@$K4X$9$kF|K\8l$N2r@b=q$G!"$*4+$a$J$b$N$r65$($F(J
: $@2<$5$$!#(J

$@%*%V%8%'%/%H;X8~$K4X$9$kOCBj$K$D$$$F$O?7>1@h@8$,=q$$$F$*$i$l$k$N(J
$@$G!"F|K\8l$N2r@b=q$NJ}$r=q$-$^$9!#(J

$@N>J}$H$bB?>/8E$$K\$G@dHG$+$bCN$l$^$;$s$,!"0J2<$NFs:}$r?dA&$7$^$9!#(J

$@#F#O#R#T#HF~Lg!!%l%*!&%V%m%G%#Cx!!86F;9(Lu!!9)3X<R(J

$@!!Cx<T!"Lu<T6&$KK\Ev$K(JFORTH $@8@8l$rCN$C$F$$$k$N$G%?%$%H%kDL$j$o$+(J
$@$j$d$9$$!#2?$h$j(JFORTH $@$N%W%m%0%i%_%s%0%9%?%$%k$K$D$$$FM}2r$G$-$k!#(J

$@I8=`#F#O#R#T#H!!0f>e30;VM:Cx!!6&N)=PHG(J

$@!!(JFORTH $@8@8l$N5,3J$N2r<a$H%$%s%W%j%a%s%H$K$D$$$F=q$+$l$F$$$k!#(J

$@$3$l0J30$"$^$j$*4+$a$N$b$N$O$J$$$N$G$9$,#C#Q=PHG$d!"6aBe2J3X<R$+(J
$@$i?t:}=PHG$5$l$F$^$9!#(J
From: yas@softlab.is.tsukuba.ac.jp (Yasushi Shinjo)
Newsgroups: fj.lang.forth
Subject: Re: Object-Oriented Forth
Date: 2 Sep 92 17:31:37 GMT
Organization: Inst. of Info. Sci. & Elec., Univ. of Tsukuba, Ibaraki, Japan.

$@?7>k!wC^GHBg3X$G$9!#$3$s$K$A$O!#(J
$@%*%V%8%'%/%H;X8~(J Forth $@$N7o$NJdB-D{@5$G$9$,!"(J

From article <1992Aug29.175551.17313@iris.is.tsukuba.ac.jp>,
	by yas@softlab.is.tsukuba.ac.jp (Yasushi Shinjo):
> $@$?$7$+!"#1#9#8#6G/!J:#$+$i#6G/A0!*!K$N(J Byte $@;o$KFC=8$,$"$j$^(J
> $@$7$?!#F1$8G/$N#1#27n$4$m$K!"F|7P%P%$%H$K$b$=$NK]Lu$,$N$j$^$7(J
> $@$?!#(J

$@$3$l$O!"%*%V%8%'%/%H;X8~8@8l$NFC=8$G$9!#(JByte$@$G$O!"(J1986$@G/(J8$@7n(J
$@9f!"F|7P%P%$%H$G$O!"(J1986$@G/(J12$@7n9f$K$"$j$^$9!#Am3g$N5-;v$G$O!"(J
$@%*%V%8%'%/%H;X8~(J Forth $@$H$7$F(J Neon $@$,>R2p$5$l$F$$$^$9!#$=$N(J
$@B>$K!"(JDick Pountain $@$K$h$k(J Object-oriented Forth $@$N<B8=$N5-(J
$@;v$,$"$j$^$9!#(J

$@$3$N<B8=$NLLGr$$=j$O!"%*%V%8%'%/%H$NJ]8n!JDj5A$5$l$F$$$J$$%a(J
$@%=%C%I8F=P$7$N6X;_!K$K(J Forth $@$,$b$H$b$H;}$C$F$$$k(JVOCABULARY 
$@$N5!G=$r;H$C$F$$$k$H$3$m$G$9!#%$%s%9%?%s%9@8@.$N5!G=$O!"(J
Forth $@$N(J CREATE DOES> $@$K$"$j$^$7$?!#$3$N#2$D$N5!G=$r9g$;$l$P!"(J
$@%*%V%8%'%/%H;X8~(J Forth $@$N$G$-$"$,$j$G$9!#(J

$@$H$$$&$o$1$G!"(JForth $@$rJY6/$9$k$J$i!"(JVOCABULARY, CREATE,
DOES> $@$^$G9T$+$J$1$l$P!"LLGr$5#2#5#6J,$N#1$G$9!#$3$l$O!"(J
PostScript $@$K$O??;w$,$G$-$^$;$s!#!J$^$"!"(JPostScript $@$N<-=q$O!"(J
Forth $@$N(J VOCABULARY $@$_$?$$$J$b$N$+$J!#!K(J

$@$"$H!"F1$8L>A0$N%o!<%I!J%k!<%A%s!K$rDj5A$9$k$H!":F5"$G$J$/$F(J
$@4{$KDj5A$5$l$F$$$k%o!<%I$r8F$V!"$H$$$&$N$b(J Forth $@$NFCD'$+$J!#(J
$@$3$l$O!"%*%V%8%'%/%H;X8~8@8l$*F@0U$N:9J,%W%m%0%i%`$,!"4JC1$K(J
$@=q$1$^$9!#JQ$JOC$@$1$I!"%a%=%C%I$G$O$J$/IaDL$N%k!<%A%s$G$b;H(J
$@$($k=j$,!"%*%V%8%'%/%H;X8~8@8l$h$j$bM-Fq$$$H8@$($k$G$7$g$&!#(J

$@!@!@!!?7>k!!Lw!!!J$7$s$8$g$&!!$d$9$7!K!!!@!@(J
$@!@!@!!C^GHBg3X!!EE;R!&>pJs!!!!!!!!!!!!!!!@!@(J
From: yas@softlab.is.tsukuba.ac.jp (Yasushi Shinjo)
Newsgroups: fj.lang.forth
Subject: Re: Introduction to FORTH
Date: 2 Sep 92 17:05:46 GMT
Organization: Inst. of Info. Sci. & Elec., Univ. of Tsukuba, Ibaraki, Japan.

$@?7>k!wC^GHBg3X$@$1$I@h@8$8$c$J$$$h!"$G$9!#(J

From article <5792@pfrad.pfu.fujitsu.co.jp>,
	by gojira@pfu.fujitsu.co.jp (Yuuichi YASUDA):
> $@N>J}$H$bB?>/8E$$K\$G@dHG$+$bCN$l$^$;$s$,!"0J2<$NFs:}$r?dA&$7$^$9!#(J
> $@#F#O#R#T#HF~Lg!!%l%*!&%V%m%G%#Cx!!86F;9(Lu!!9)3X<R(J

$@;d$b$3$l$O!"$*A&$a$G$9!#(JSWAP$@%I%i%4%s$H$+!"(JCOMPILE$@JT=8?M$H$+!"(J
EXECUTE$@<99T?M$H$+=P$F$-$F!"9%$-$G$7$?!#!J?^=q4[$K$"$C$?$N$G(J
$@Gc$o$J$+$C$?$N$G$9$,!"@dHG$K$J$C$F$$$?$iGc$C$F$*$/$s$@$C$?$J$"!#!K!!(J

$@$?$@!"K\$NBP>]$H$7$F$$$k(J Forth $@$,!"(JPoly-Forth $@$+$J$s$+$G!"$=(J
$@$l$K0MB8$7$?OC$b:.$6$C$F$$$k$N$,5$$K$J$j$^$9!#<-=q$N9=B$$J$I!"(J
FIG Forth 79, 83 $@$d:G6a$N6H3&I8=`$N(J Forth F83 $@$J$I$H0c$C$F$$(J
$@$^$9!#:#$I$-$N(J Forth $@$O!"D9$$%o!<%IL>$b$A$c$s$H<uIU$1$^$9!#(J
$@D9$5!\@hF,$N#3J8;z!"$J$s$F$;$3$$$^$M$O$7$^$;$s!#(J

> $@I8=`#F#O#R#T#H!!0f>e30;VM:Cx!!6&N)=PHG(J
> $@!!(JFORTH $@8@8l$N5,3J$N2r<a$H%$%s%W%j%a%s%H$K$D$$$F=q$+$l$F$$$k!#(J

$@$3$l$O!";}$C$F$$$^$9!#(JForth$@;H$$$H$7$F$O!"@'Hs$H$b<j85$KCV$$(J
$@$F$*$-$?$$K\$G$9$M!#(J

$@$"$H!";d$,;}$C$F$$$k$N$G$O!"(J

    $@%Q%=%3%s$N$?$a$N%U%)!<%9!!%9%F%#!<%V!&%*!<%1%$Cx!!@P0fL-Lu(J
    $@7<3X=PHG!!#1#9#8#5G/!%(J

$@$G$9!#$3$NK\$N$9$4$$=j$O!"(JBASIC$@!"(JPascal $@$H(J Forth $@$rBPHf$7$F(J
$@$$$k$H$3$m$G$9!#$3$l$r8+$k$H!"(JBASIC $@$H(J Pascal $@$,F1$8$K8+$($^(J
$@$9!#$3$l$i$N8@8l$rCN$C$F$$$k;~$K$O!"$$$$$+$b$7$l$^$;$s!#(J
$@!J$I$&$;$J$i!"(JLisp $@$HHf3S$7$F$[$7$+$C$?$J!#!K(J

$@$"$H!"(JForth $@$@$1$NK\$G$O(J

    $@%Q%=%3%s8@8l3X!!@PED@25WJT!J(JForth $@$N>O$O!"JR6ML@!K(J
    $@%"%9%-!<!"#1#9#8#4G/(J

$@$,$"$j$^$9!#(JForth$@$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

$@$=$N8e!"$=$NF|K\8l(JForth$@$O!"(JMind $@$H$$$&8@8l$K$J$C$FH/E8$7$^$7(J
$@$?!#$=$NB>$K!"(JForth $@$N?F@L$N8@8l$H$7$F$O!"$4B8CN(J PostScrit 
$@$,$"$j$^$9!#KL3$F;Bg3X$G:n$i$l$?(J Laplas $@$H$$$&8@8l$O!"(JForth 
$@$H(J Lisp $@$rM;9g$7$?$h$&$J8@8l$G$9!#(Jsnoc $@$H$$$C$F%9%?%C%/$K(J 
car $@It$H(J cdr $@It$N#2$D$NCM$rJV$94X?t$,$"$j$^$9!#(J

$@$3$s$J$H$3$m$G$7$g$&$+!#(J

$@!@!@!!?7>k!!Lw!!!J$7$s$8$g$&!!$d$9$7!K!!!@!@(J
$@!@!@!!C^GHBg3X!!EE;R!&>pJs!!!!!!!!!!!!!!!@!@(J
Xref: sparky fj.lang.forth:4 fj.comp.oops:143 fj.sys.mac:1928