From Wikipedia, the free encyclopedia
Jump to: navigation, search
Developer Cliff Shaw, RAND
First appeared 1966; 51 years ago (1966)
Influenced by
Part of a JOSS session at RAND in 1970.

JOSS (an acronym for JOHNNIAC Open Shop System) was one of the very first interactive, time-sharing programming languages. JOSS I, developed by J. Clifford Shaw at RAND was first implemented, in beta form, on the JOHNNIAC computer in May 1963. The full implementation was deployed in January 1964, supporting five terminals and the final version, supporting ten terminals, was deployed in January 1965.[1][2]

JOSS was written in a symbolic assembly language called EasyFox (E and F in the US military's phonetic alphabet of that time). EasyFox was also developed by Cliff Shaw.

JOSS was dubbed "The Helpful Assistant" for its conversational user interface. Originally green/black typewriter ribbons were used in its terminals with green being used for user input and black for the computer's response. Mathematically, JOSS was interesting because it stored all numbers as an integer and a decimal exponent. This means calculations were exact decimal values, as opposed tp floating point calculations. One third plus one third plus one third was exactly one. Any command that was not understood elicited the response "Eh?" or "SORRY".

JOSS II, was developed by Charles L. Baker, Joseph W. Smith, Irwin D. Greenwald, and G. Edward Bryan for the PDP-6 computer between 1964 and February 1966.

Many variants of JOSS were developed and implemented on a variety of platforms. Some of these variants remained very similar to the original: TELCOMP, FOCAL, CAL, CITRAN, ISIS, PIL/I, JEAN (ICT 1900 series), AID (PDP-10); while others, such as MUMPS, developed in distinctive directions.

Sample program[edit]

1.1 Demand p,q.
1.2 Stop if q<0 or r(q,2)=0.
1.3 Set a=1.
1.4 Do part 2 while q>1 and a~=0.
1.5 Type a in form 3.
1.6 Stop.
2.1  Do part 20.
2.1  Do part 11 if p<0.
2.2  Do part 12 if p>=q.
2.3  Do part 13 if p=0.
2.4  Done if a=0.
2.5  Set p=p/4 while r(p,4)=0.
2.6  Do part 14 if r(p,2)=0.
2.7  Do part 20.
2.8  Set a=-a if r(p,4)=r(q,4)=3.
2.9  Set s=p, p=q, q=s.
2.95 Do part 20.
11.1 Set a=-a if r(q,4)=3.
11.2 Set p=|p|.
11.3 Do part 20.
12.1 Set p=r(p,q).
12.2 Do part 20.
13.1 Set a=0, p=1, q=1.
14.1 Set a=-a if r(q,8)=3 or r(q,8)=5.
14.2 Set p=p/2.
20.1 Type p, q in form 1 if a=1.
20.2 Type p, q in form 2 if a=-1.
Form 1: "  L(%.0f,%.0f)  ="
Form 2: "  -L(%.0f,%.0f)  ="
Form 3: "  %.0f\n"

Note that this is not an original sample, but rather one from a modern simulator. There are some syntactic differences from the original JOSS language.


  1. ^ Wexelblat, Richard L, ed. (1981). History of Programming Languages. New York: Academic Press. ISBN 0-12-745040-8. 
  2. ^ Smith, JW (August 1967). "JOSS: Central Processing Routines" (reference user guide). RAND. RM 5270 PR. Retrieved 2012-04-16.