%J Comm. Assoc. Comp. Mach.
%R Comp. Sci. Tech. Rep. No. 17
%C Murray Hill, New Jersey
%T A System for Typesetting Mathematics
%d May 1974, revised April 1977
%J Comm. Assoc. Comp. Mach.
%T U\s-2NIX\s0 Time-Sharing System: Document Preparation
%T An Introduction to the Programmer's Workbench
%J Proc. 2nd Int. Conf. on Software Engineering
%T U\s-2NIX\s0 Time-Sharing System: The Programmer's Workbench
%T U\s-2NIX\s0 Time-Sharing System: U\s-2NIX\s0 on a Microprocessor
%T The C Programming Language
%C Englewood Cliffs, New Jersey
%J Software Practice and Experience
%T U\s-2NIX\s0 Time-Sharing System: The U\s-2NIX\s0 Shell
%T \*sSDS\*n 930 time-sharing system preliminary reference manual
%R Doc. 30.10.10, Project \*sGENIE\*n
%C Univ. Cal. at Berkeley
%T The Multics input-output system
%J Proc. Third Symposium on Operating Systems Principles
%T \*sTENEX\*n, a Paged Time Sharing System for the \*sPDP\*n-10
%J Comm. Assoc. Comp. Mach.
%T Cooperating Sequential Processes
%T M\s-2UNIX\s0, A Multiprocessing Version of U\s-2NIX\s0
%I Naval Postgraduate School
%T The U\s-2NIX\s0 Time-Sharing System
%T The M\s-2ULTICS\s0 System
%T U\s-2NIX\s0 Programmer's Man\&ual
%T The U\s-2NIX\s0 Command Language
%B Structured Programming\(emInfotech State of the Art Report
%I Infotech International Ltd.
%C Nicholson House, Maidenhead, Berkshire, England
Brief description of shell syntax and semantics, without much
detail on implementation.
Much on pipes and convenience of hooking programs together.
"Many familiar computing `concepts' are missing from UNIX.
Files have no records. There are no access methods.
There are no file types. These concepts fill a much-needed gap.
I sincerely hope that when future systems are designed by
manufacturers the value of some of these ingrained notions is re-examined.
Like the politician and his `common man', manufacturers have
%T PWB/UNIX Shell Tutorial
%T The Cambridge Multiple Access System \- Users Reference Manual
%I University Mathematical Laboratory
%T The Compatible Time-Sharing System
%T Deterministic Parsing of Ambiguous Grammars
%J Comm. Assoc. Comp. Mach.
%T Principles of Compiler Design
%R Comp. Sci. Tech. Rep. No. 65
%T Lint, a C Program Checker
%O updated version TM 78-1273-3
%T A Portable Compiler: Theory and Practice
%J Proc. 5th ACM Symp. on Principles of Programming Languages
%R Comp. Sci. Tech. Rep. No. 39
%C Murray Hill, New Jersey
%T Lex \(em A Lexical Analyzer Generator
%R Comp. Sci. Tech. Rep. No. 32
%C Murray Hill, New Jersey
%T Yacc \(em Yet Another Compiler-Compiler
%T U\s-2NIX\s0 Time-Sharing System: Portability of C Programs and the U\s-2NIX\s0 System
%T Typing Documents on UNIX and GCOS: The -ms Macros for Troff
%T U\s-2NIX\s0 Programmer's Manual
%T The Network U\s-2NIX\s0 System
%J Operating Systems Review
%O Also in \f2Proc. 5th Symp. on Operating Systems Principles.\f1
%T Spider \(em An Experimental Data Communications System
%J Proc. IEEE Conf. on Communications
%O IEEE Cat. No. 74CH0859-9-CSCB.
%T A Virtual Channel Network
%R Comp. Sci. Tech. Rep. No. 41
%C Murray Hill, New Jersey
%T An Algorithm for Differential File Comparison
%T The Mythical Man-Month
Readable, classic reference on software engineering and
problems of large projects, from someone with experience in them.
Required reading for any software engineer, even if conclusions may not
"The second is the most dangerous system a man every designs." p.55.
"Hence plan to throw one away; you will, anyhow." p.116.
"Cosgrove has perceptively pointed out that the programmer delivers
satisfaction of a user need rather than any tangible product.
And both the actual need and the user's perception of that need
will change as programs are built, tested, and used." p.117.
"The total cost of maintaining a widely used program is typically 40 percent
or more of the cost of developing it." p.121.
"As shown above, amalgamating prose and program reduces the total
number of characters to be stored." p.175.
%T A Portable Compiler for the Language C
%I Master's Thesis, M.I.T.
%T The C Language Calling Sequence
%T Optimal Code Generation for Expression Trees
%O Also in \f2Proc. ACM Symp. on Theory of Computing,\f1 pp. 207-217, 1975.
%T The Generation of Optimal Code for Arithmetic Expressions
%O Reprinted as pp. 229-247 in \fICompiler Techniques\fR, ed. B. W. Pollack, Auerbach, Princeton NJ (1972).
Optimal approach for straight-line, fixed
%T Code Generation for Machines with Multiregister
%J Proc. 4th ACM Symp. on Principles of Programming Languages