HDTenEightyP/NetNews huggingface dataset:
From: emclean@sfsuvax1.sfsu.edu (Emmett McLean)
Newsgroups: comp.lang.apl
Subject: Re: can someone please recommend a ftp site for j
Keywords: j
Date: 22 Dec 92 18:54:17 GMT
Organization: San Francisco State University

To: jja@fnbc.com
Subject: Re: can someone please recommend a ftp site for j
Newsgroups: comp.lang.apl
Organization: San Francisco State University
Cc: 
Bcc: 

In article <1992Dec22.161230.28934@fnbc.com> you write:
>greetings,
>
>i am looking for a neXt version of j.   i use it at home
>on the pc and now i want to use it at work.
>
>where can i ftp it from?  or the sources if a neXt version is
>not available.

 Go to :
 watserv1.waterloo.edu
 cd to
 languages/apl/j/exec/NEXT
 or cd to   
 languages/apl/j/source 
 (or is it ?)
 languages/apl/j/src
 for the source? You'll figure it out.

 v6.1 is the most recent version of the source code and v6.0
 is the most recent version of the executable.

For a session manager, under the NeXT, I suggest running J under Emacs.
Do an archie to find the path to get j-interaction-mode.el
and stuff the file with a few changes (read the doc) and
stuff it into your .emacs file. I suggest also including 
the following instructions:

;;; Get rid of that help message for ESC ESC
(put 'eval-expression 'disabled nil)

;;; So I'll scroll for output beyond 80 chars
(setq-default truncate-lines t)

;;; Since take drop,tail, and curtail are {. }. {: and }:
;;; matching parens are meaningless
(setq blink-matching-paren nil)

(setq term-file-prefix nil)

;;; So undo is easy to use
(define-key global-map "\eOB" 'undo )

;;;; So C-x < scrolls as before, but C-u C-x < scrolls to point.
(defun emclean-scroll-left (&optional to-point)
  (interactive "P")
  (scroll-left (if to-point (current-column))))
(global-set-key "\C-x<" (function emclean-scroll-left))

;;;; I find being able to create another shell easily useful so
(defun shell-numbered ()
  "Create a new shell named, *shell1*, *shell2*, *shell3*, ....
Numbers are reused as they become available."
  (interactive)
  (let ((shell-number 1))
    (while (get-buffer (format "*shell%d*" shell-number))
      (setq shell-number (1+ shell-number)))
    (shell)
    (rename-buffer (format "*shell%d*" shell-number))))
    (defun see-chars ()
      "Displays characters typed, terminated by a 3-second timeout."
      (interactive)
      (let ((chars "")
	    (inhibit-quit t))
	(message "Enter characters, terminated by 3-second timeout.")
	(while (not (sit-for 3))
	  (setq chars (concat chars (list (read-char)))
		quit-flag nil))		; quit-flag maybe set by C-g
	(message "Characters entered: %s" (key-description chars))))
(defun shell-numbered ()
  "Create a new shell named, *shell1*, *shell2*, *shell3*, ....
Numbers are reused as they become available."
  (interactive)
  (let ((shell-number 1))
    (while (get-buffer (format "*shell%d*" shell-number))
      (setq shell-number (1+ shell-number)))
    (shell)
    (rename-buffer (format "*shell%d*" shell-number))))
Newsgroups: comp.lang.apl
From: Mike Kent <70530.1226@CompuServe.COM>
Subject: NB. nonce error
Organization: University of Waterloo
Date: Wed, 30 Dec 1992 05:28:59 GMT

In article <1992Dec29.200045.18139@fnbc.com>, jja@fnbc.com (Joseph Alotta)
asks

>> whats a nounce [sic] error

and

>> btw, anyone know what j stands for? or "NB." as in comments?

J (and APL) will signal "NONCE ERROR" when you do something which in
theory should be OK, but which the interpreter can't handle "for the
nonce", that is, until the implementor(s) implement it. 

Yes, someone knows what J stands for, but he ain't saying.  OTOH, Ken is
giving a talk with the suggestive title "From I verson Notation to J".

"NB" is academic-ese for "please note" [ Latin, "nota bene"]. 



	Joshi asked the master "What is the meaning of 'n.b.'?"
      
	The master replied "It is not to be found in any book (q.v.)."

	Joshi departed and wrote the haiku

			Cogent
				lucid
			loc. cit.
			op. cit.
				Ibid.

Newsgroups: comp.lang.apl
From: Mike Kent <70530.1226@CompuServe.COM>
Subject: APL compilers
Organization: University of Waterloo
Date: Thu, 24 Dec 1992 12:09:12 GMT

The Manugistics [STSC] compiler runs on the mainframe and the compiled
code uses interpreter services, and so runs only  from within APL*PLUS;
I believe there are some restrictions on what can be compiled (maybe
just that the execute primitive can't be used).

The IBM compiler marketed by Interprocess Systems also runs on the
mainframe (but probably could be ported, with some effort, to any
environment supporting []NA), produces FORTRAN as its intermediate
code (and so requires a FORTRAN compiler); it compiles classical "flat"
APL -- no nested arrays, also no execute and no shared variables -- but
the compiler itself is written in APL2.
From: ljdickey@math.uwaterloo.ca (L.J. Dickey)
Newsgroups: comp.lang.apl
Subject: Re: What's J, etc.
Date: 23 Dec 92 18:06:40 GMT
Organization: University of Waterloo

In article <1992Dec22.181944.28862@csus.edu> emclean@sfsuvax1.sfsu.edu (Emmett McLean) writes:

>In article <9212221607.AA27593@top.magnus.acs.ohio-state.edu> 
> [ dbrownfi@magnus.acs.ohio-state.edu  writes ]
...
>>     2. Is there a shareware/PD APL interpreter available for MS-DOS?
>      Yes, at watserv1. Check out the file apl-j for details.

There are at least two other APLs at Watserv1, TryAPL2 and I-APL.
Study the index.  It is usually up to date.

>>     3. Has anyone ever come up with an APL compiler?
>      From what I understand, much of Manugistics APL compiles.

I think that to use this compiler (previously known as STSC) you have
to be running on the mainframe.

>      I don't know about IBM's product APL2.

There is a compiler for at least one IBM APL product available from
Interprocess Systems in Atlanta.

There is also the Tim Budd Compiler.  It was documented in a book
published by Springer Verlag.  It is free.  Write to Budd at Oregon
State University (budd@cs.orst.edu>  I think that Sam Sirlin
<sam@kalessin.jpl.nasa.gov> is a regualar user of a modified version of
this tool.

-- 
Prof. Leroy J. Dickey, Faculty of Mathematics, U of Waterloo, Canada  N2L 3G1
   Internet:      ljdickey@math.UWaterloo.ca
                  ljdickey@math.waterloo.edu
   UUCP:          ljdickey@watmath.UUCP
Newsgroups: comp.lang.apl
From: emclean@sfsuvax1.sfsu.edu (Emmett McLean)
Subject: Re:      reply to Emmett McLean
Organization: San Francisco State University
Date: Thu, 24 Dec 1992 06:45:04 GMT

  
NB.   Using the new capabilities of v6.1 I've cooked up the
NB.   following verbs for assignments into rows and columns
NB.   of a matrix.
NB.  
   arow =. >@{:@]`($@[ #. (>@{. ,. i.@$@>@{:)@])`[}
   acol =. >@{:@]`($@[ #. (i.@$@>@{: ,. >@{.)@])`[}

   ] e =. ? 4 3 $ 6
3 4 5
2 1 5
4 4 3
0 3 5
   e arow 2 ; 3 3 3  
3 4 5
2 1 5
3 3 3
0 3 5
   e acol 2 ; 100* i. 4 
3 4   0
2 1 100
4 4 200
0 3 300
Newsgroups:   comp.lang.apl
From:         pow@ipsa@ipsaint.ipsa.reuter.COM (Remote Addressee:)
Subject:      Keyed Files for J
Reply-To:     pow@ipsa@ipsaint.ipsa.reuter.COM (Remote Addressee:)
Organization: Reuters Information Services (Canada)
Date:         21 Dec 92 22:00:04 UT


-----------Message forwarded from IPSA Mailbox-------------


no. 6846418 filed 21.13.59  mon 21 dec 1992
from pow@ipsa
to   uclapl
subj Keyed Files for J

@transferred from ipsa  no. 5456580 filed 21.13.48  mon 21 dec 1992

Below is a delete verb for keyed file access.

My access to InterNet is quite restricted. I can get messages forwarded
on to comp.lang.apl through the charity of Reuters. However, you cannot send
me personal mail by return. And unfortunately all such access is slated to
disappear shortly. (Emmett McLean: that's why pow@ipsa@ipsaint is an invalid
address.)
------------------
NB. key Delete <'filename'
NB.   Removes key from the list of keys.
NB.   Returns boolean (1=deleted, 0=not deleted).

m=.  < 'a=.ev y.,<0 512'
m=.m,< 'b=.ev y.,<0 1{0{a'
m=.m,< 'c=.ev y.,<0 1{1{a'
m=.m,< 'd=.-.b e. <x.'
m=.m,< 'b=.(,0{a) write y.,<rep <''b'' [ b=.d#b'
m=.m,< 'c=.(,1{a) write y.,<rep <''c'' [ c=.d#c'
m=.m,< 'a=.512{.rep<''a'' [ a=.2 3$b,c'
m=.m,< '0 e. d [ a iw y.,<0 512'
Delete =. '' : m


-----------------------------------------------------------
This posting is forwarded from an internal Reuters mailbox.
No statement or opinion contained herein should be taken as
being Reuters policy, or even as being approved by Reuters,
in any way.
Newsgroups: comp.lang.apl
From: jja@fnbc.com (Joseph Alotta)
Subject: eigenvalues in j
Keywords: j
Organization: First National Bank Of Chicago, Chicago IL, USA
Date: Tue, 29 Dec 92 20:00:45 GMT

hi,

whats a nounce error and how does on
use the c. verb?

   a =. 2 2 $ 1 0 1 3
   a
1 0
1 3
   0 c. a
nonce error


btw, anyone know what j stands for? or
"NB." as in comments?   


joe.

--
==============================================================
! joe alotta                                    jja@fnbc.com !                                               
!                                             (312) 732-3439 !
!                                                            !
! "The main thing is to keep the main thing the main thing." !
! Dr. George Sweeney                                         !
==============================================================
Newsgroups: comp.lang.apl
From: Doug Brownfield <dbrownfi@magnus.acs.ohio-state.edu>
Subject: What's J, etc.
Organization: The Ohio State University
Date: Tue, 22 Dec 1992 16:07:29 GMT
X-Mailer: ELM [version 2.3 PL11]

It has been a long time since I've programmed with APL so I have a few 
questions:
     1. What's J?
     2. Is there a shareware/PD APL interpreter available for MS-DOS?
     3. Has anyone ever come up with an APL compiler?
Thanks for any info!



****************************************************************************
Doug Brownfield                         dbrownfi@magnus.acs.ohio-state.edu
Ohio State University                   (614) 292-8199
College of Nursing
220 Newton Hall, 1585 Neil Ave          OSBORNE'S LAW
Columbus, Ohio 43210                    "Variable's won't; constants aren't"
****************************************************************************
Newsgroups:   comp.lang.apl
From:         eem@ipsaint.ipsa.reuter.COM (Mcdonnell, Eugene E.)
Subject:      questions from Emmett McLean
Reply-To:     eem@ipsaint.ipsa.reuter.COM (Mcdonnell, Eugene E.)
Organization: Reuters Information Services (Canada)
Date:         25 Dec 92 01:00:06 UT


-----------Message forwarded from IPSA Mailbox-------------


no. 6853576 filed  0.35.58  fri 25 dec 1992
from eem
to   uclapl
subj questions from Emmett McLean


 A. For gerund m, m`:6 is equivalent to m\ which is equivalent to
 the train of verbs in the gerund m.  For example, if m=.f`g`h
 then m`:6 is equivalent to the train f g h which is a fork, so
 m`:6 y is the same as m\y which is the same as (f g h) y which is
 the same as (f y) g (h y).  

 I don't think J has ever implemented the MIMD construction
 described in the Bernecky-Hui paper "Gerunds & Representations"
 as given by g`:6. I believe the Dictionary of J has always said
 that g`:6 is the same as g\ which is the train of verbs in g. At
 least such is the case in a copy of the Dictionary for version
 3.3. Even though the MIMD control structure would be useful
 notationally even on a single cpu machine, its real importance
would only show up in the greater execution efficiencies possible
 on a real MIMD machine. I expect we'll have to wait until J is
 available on such machines before anyone gets too excited about
 implementing it.  

 B. Regarding your "iteration index" message: If you modify your
 verb r you can achieve the result you desire. By the way, $. is
 not an iteration index, it is a list of statement numbers to be
 executed.  

 Try:
    r=.,1000&*@#

 Then:
    h^:(10) 2
 2 1000 2000 1000 500 5000 2500 5000 10000 9000 4500
    h^:(10) 2
 2 4 2000 3000 1500 5000 10000 20000 8000 4000 8000
    h^:(10) 2
 2 4 2 3000 1500 750 375 7000 8000 4000 2000
    h^:(10) 2
 2 4 2 1 0.5 0.25 6000 7000 14000 28000 56000


-----------------------------------------------------------
This posting is forwarded from an internal Reuters mailbox.
No statement or opinion contained herein should be taken as
being Reuters policy, or even as being approved by Reuters,
in any way.
Newsgroups: comp.lang.apl
From: bathurst@phoenix.Princeton.EDU (Bruce Bathurst)
Subject: Re: eigenvalues in j
Originator: news@nimaster
Keywords: j
Organization: Princeton University
Date: Sat, 2 Jan 1993 02:59:11 GMT

Did someone explain the origin of the term "nonce error"?

The one in my college dictionary isn't quite applicable.  The OED
lists three.  One is underworld slang (cant?) for sexual deviant;
but APL nouns have no gender.  Another is Middle English for "the
purpose at hand"; this meaning evolved a "temporary" connotation.

"Converting the parlour, for the nonce, into a private typing room."
   -Dickens' Dombey and Son, Ch.6.

This is a rough fit for "temporarily an error".  Perhaps nonce is an
acronym for "Not in Cervice"?

Bruce (Gypsy Scholar)
-- 
Department of Geological and Geophysical Sciences
Princeton University, Princeton, NJ 08544
bathurst@phoenix.princeton.edu bathurst@pucc.bitnet !princeton!phoenix!bathurst
Newsgroups: comp.lang.apl
From: emclean@sfsuvax1.sfsu.edu (Emmett McLean)
Subject: Seek examples of >!._  u^: g and g} in J v6.1
Organization: San Francisco State University
Distribution: NA
Date: Tue, 22 Dec 1992 04:12:59 GMT


 The following are implemented in J v6.1 :

 >!._
 u^: g
 g}

 Could someone post some examples using these features?

 Thanks,

 Emmett, emclean@sfsuvax1.sfsu.edu
Newsgroups: comp.lang.apl
Subject: Combinations
From: mclean@futon.SFSU.EDU (Emmett Mclean)
Date: 25 Dec 92 17:55:28 PST
Distribution: NA
Organization: San Francisco State University

NB. I've written the following verb to compute each of the
NB. combinations of n  choose k.  (The verb in Arithmetic 
NB. is slow and eats up memory for values of n greater than 
NB. eight.)
   comb =. i. 0 0
   comb =. comb, ' ".(x. = 1)#''$. =. end [ y. =. i. y.'' '
   comb =. comb, ' u  =. (] , (}: , {:@>:)@{:@])^:({:@[ > {:@{:@])'
   comb =. comb, ' v1 =. (}: , >:@{:)@((~: {:@]) # ({:@]))'
   comb =. comb, ' v2 =. ] , {:@] + >:@i.@(#@[ - #@])'
   comb =. comb, ' v =.  ] , [ v2 [ v1 ]'
   comb =. comb, ' s =.  u`v@.({:@[ = {:@{:@])'
   comb =. comb, ' n  =. x. ! y.'
   comb =. comb, ' x  =.  (y. - x.) }. i. y.'
   comb =. comb, ' y. =. y =. ,: x. {. i. y.'
   comb =. comb, ' loop) y. =. x s y.'
   comb =. comb, ' ".(n ~: # y. )#''$. =. loop '' '
   comb =. comb, ' end) y.'
   comb =. '': comb
NB. So:
   2 comb 4
0 1
0 2
0 3
1 2
1 3
2 3
NB. The way this works is for u to create 
NB. consecutive combinations ;
   ]m=.(2 3) u ,: 0 1
0 1
0 2
0 3
NB. And for v to create non-consecutive combinations.
   (2 3) v m
0 1
0 2
0 3
1 2 NB. The zero is bumped to one.

NB. In "comb" u and v alternate until all combinations are created.
NB.    Naturally, I'd like to take advantage of the new
NB. capabilities of v6.1 and create an tacit implementation
NB. version, something like:
   u  =. (] , (}: , {:@>:)@{:@])^:({:@[ > {:@{:@])
   v1 =. (}: , >:@{:)@((~: {:@]) # ({:@]))
   v2 =. ] , {:@] + >:@i.@(#@[ - #@])
   v =.  ] , [ v2 [ v1 ]
   t=. (( #@[ ! >:@{:@[) ~: #@]) 
   g =. [`t`u

NB. Where t is exit verb for example :
   (2 3) t m
1
NB. And the code for 4 choose 2 would be :
   (2 3) v ^: g (,: 0 1)
0 1
0 2
0 3

NB. But this form invokes "( 2 3) u ( ,: 0 1)"
NB. and terminates, thus failing to provide the combinations.
NB.  Any suggestions?
NB. 
NB. BTW. Great thanks to Eugene McDonnell for his informative
NB.      replies to my questions!
NB. 
NB. Also, if anyone has written their own combinations verb
NB. I'd like to study it.

NB. Thanks,
NB. 
NB. Emmett mclean@futon.sfsu.edu (Till 1.4.93)
Newsgroups:   comp.lang.apl
From:         eem@ipsaint.ipsa.reuter.COM (Mcdonnell, Eugene E.)
Subject:      genealogy of nonce error
Reply-To:     eem@ipsaint.ipsa.reuter.COM (Mcdonnell, Eugene E.)
Organization: Reuters Information Services (Canada)
Date:          2 Jan 93 18:00:02 UT


-----------Message forwarded from IPSA Mailbox-------------


no. 6871877 filed 17.10.58  sat  2 jan 1993
from eem
to   uclapl
subj genealogy of nonce error


Bruce Bathurst asks for more on "nonce error".  

When the APL\360 system was being designed and implemented at IBM Research in 
1966, the implementation often fell behind the design.  The implementers were 
the target of frequent complaints from users inside IBM that certain language 
features described in the documentation (written by the designers) produced no 
result or an incorrect result.  To relieve their frustration the implementers 
introduced a new error, the nonce error, which indicated that the piece of 
syntax attempted would not produce the desired result "for the nonce", with the 
implication that at some future date, when they got good and ready, the given 
feature would appear, to everyone's delight.  After APL became commercially 
available as a more or less IBM product this error was removed, because, as the 
suit and tie types in IBM said, it was tantamount to an announcement of an 
unavailable feature, which was contrary to United States government restrictions 
on IBM, and thus illegal.  

Iverson Software Inc. suffers from no such inhibitions in its J product.  

I once suggested the introduction of a converse to nonce error, the "yore error" 
to indicate a language facility that had been removed (such as monadic 
representation, which in early APL systems gave the binary equivalent to a 
numeric argument, e.g. representation 7 yielded 1 1 1; this facility has been 
reintroduced in J: try #:7), so that a user seeing such an error report would 
know that this facility existed only "in days of yore".  The suggestion was 
vetoed.    


-----------------------------------------------------------
This posting is forwarded from an internal Reuters mailbox.
No statement or opinion contained herein should be taken as
being Reuters policy, or even as being approved by Reuters,
in any way.
Newsgroups: comp.lang.apl
From: sam@csi.jpl.nasa.gov (Sam Sirlin)
Subject: Re: eigenvalues in j
Originator: sam@kalessin
Keywords: j
Organization: Jet Propulsion Laboratory, Pasadena, CA
Date: Wed, 30 Dec 1992 18:37:28 GMT


In article <1992Dec29.200045.18139@fnbc.com>, jja@fnbc.com (Joseph Alotta) writes:
|> hi,
|> 
|> whats a nounce error and how does on
|> use the c. verb?

Now that you've been straightened out on nonces, some simple J code
does exist to do eigen analysis. Lee Dickey posted it here, so it's
probably available from waterloo. I have a copy. Of course if you
really want good stuff you should link in EISPACK or LAPACK routines
(which is where I expect c. will come from via f2c). 

-- 
Sam Sirlin
Jet Propulsion Laboratory         sam@kalessin.jpl.nasa.gov

Newsgroups: comp.lang.apl
From: neitzel@ips.cs.tu-bs.de (Martin Neitzel)
Subject: Re: A verb to trim spaces from a string
Organization: Inst. f. Informatik, TU Braunschweig, FRG
Date: Mon, 21 Dec 1992 17:57:37 GMT


Here's something I immediately had to think of: once you can ltrim,
rtrimming is nothing else than ltrimming under mirroring:

	rtrim =. ltrim &. |.

merry xmas!  (I already have 2 mastermind submissions under my tree.
Anyone else?)

						Martin Neitzel
Newsgroups:   comp.lang.apl
From:         eem@ipsaint.ipsa.reuter.COM (Mcdonnell, Eugene E.)
Subject:      More efficient combinations verb
Reply-To:     eem@ipsaint.ipsa.reuter.COM (Mcdonnell, Eugene E.)
Organization: Reuters Information Services (Canada)
Date:         27 Dec 92 21:00:03 UT


-----------Message forwarded from IPSA Mailbox-------------


no. 6857150 filed 20.45.47  sun 27 dec 1992
from eem
to   uclapl
subj More efficient combinations verb

To Emmett McLean


 Roger Hui has written a considerably more efficient version of
 comb.  A comparison of timings on two cases:

 m  n   m comb n (McLean)  m comb n (Hui)  m comb1 n (Hui)
 5 11         7.583333         0.166667       0.166667
 6 12        89.18333          0.5            0.583333

 Hui's recursive comb is defined as follows:

    start =. i.@-.-
    count =. <:@[ ! <:@[ + |.@start
    index =. ;@:((i.-])&.>)
    recur =. (count#start) ,. (index@count{comb&.<:)
    test  =. *@[ *. <
    basis =. i.@(<: , [)
    comb  =. basis`recur @. test

 He points out that the recursion can be replaced by using power
 (^:), and that m comb1 n is also grow^:m m seed n.  

    seed  =. *@[ i.@{ 1 0&,:@(,&1)@>:@(-~)
    em    =. >:@{:@$
    en    =. 2&+@{:@{:
    g     =. em (count#start) en
    h     =. em (index@count) en
    grow  =. g ,. h { >:
    comb1 =. [ grow@]^:(>{:@$) seed


-----------------------------------------------------------
This posting is forwarded from an internal Reuters mailbox.
No statement or opinion contained herein should be taken as
being Reuters policy, or even as being approved by Reuters,
in any way.
Newsgroups: comp.lang.apl
From:         eem@ipsaint.ipsa.reuter.COM (Mcdonnell, Eugene E.)
Subject:      reply to Emmett McLean
Reply-To:     eem@ipsaint.ipsa.reuter.COM (Mcdonnell, Eugene E.)
Organization: Reuters Information Services (Canada)
Date:         23 Dec 92 03:00:06 UT


-----------Message forwarded from IPSA Mailbox-------------


no. 6849643 filed  2.53.22  wed 23 dec 1992
from eem
to   uclapl
subj reply to Emmett McLean


.In reply to Emmett McLean's inquiry for details of >!._ and u^:g
 and g} :

 A. To understand >!._ you should know that z=. <!.n y for any
 nouns n and y is an atomic encoding of y having class n, so that
 >!._ z is n.  For example,
    y=.123 45 6789
    n=.'social security number'
    z=. <!.n y
    >!._ z
 social security number

 Thus the two verbs <!.n and >!._ allow a noun to be enrolled in
 an arbitrary class n, and for the class of a noun to be
 determined, respectively.  It's not OOP but it has something of
 that flavor.  These are described in J Dictionary Version 5.  

 B. For verbs v0, v1, and v2, and gerund g=.v0`v1`v2, and nouns x
 and y, 
            g} y 
 is defined as 
                     (  v1 y) } (  v2 y)
 and
          x g} y
 is defined as
            (x v0 y) (x v1 y) } (x v2 y)

 Also, for verb f,
       f ^: g y
 is defined as
                f ^: (  v1 y)   (  v2 y)
 and
     x f ^: g y
 is defined as
       (x v0 y) f ^: (x v1 y)   (x v2 y)

 A one- or two-element g is permitted, and expands to 3&$&.|.g. 

 Thus the two forms u^:g and g} are designed to allow a greater
 number of verbs to be specified tacitly than was heretofore
 possible.  Recall section B. of the Hui/Iverson/McDonnell paper
 "Tacit Definition" in APL91 Conference Proceedings (page 204),
 where the translation from explicit to tacit form is permitted
 for a sentence s on nouns x and y provided that s makes no use of
 x or y as argument to an adverb or conjunction.  These two new
 forms provide a way around that restriction for the amend adverb
 } and the power conjunction ^:.  



-----------------------------------------------------------
This posting is forwarded from an internal Reuters mailbox.
No statement or opinion contained herein should be taken as
being Reuters policy, or even as being approved by Reuters,
in any way.
Newsgroups: comp.lang.apl
From: jja@fnbc.com (Joseph Alotta)
Subject: can someone please recommend a ftp site for j
Keywords: j
Organization: First National Bank Of Chicago, Chicago IL, USA
Date: Tue, 22 Dec 92 16:12:30 GMT

greetings,

i am looking for a neXt version of j.   i use it at home
on the pc and now i want to use it at work.

where can i ftp it from?  or the sources if a neXt version is
not available.

thanks,

joe.

--
==============================================================
! joe alotta                                    jja@fnbc.com !                                               
!                                             (312) 732-3439 !
!                                                            !
! "The main thing is to keep the main thing the main thing." !
! Dr. George Sweeney                                         !
==============================================================
Newsgroups: comp.lang.apl