![[BACK]](/cvsweb/icons/back.gif){kind=icon}
Return to Rv7man CVS log ![[TXT]](/cvsweb/icons/text.gif){kind=icon}
![[DIR]](/cvsweb/icons/dir.gif){kind=icon}
Up to [CSRG BSD Unix] / 43BSDReno / usr.bin / refer / papers|
Return to Rv7man CVS log | Up to [CSRG BSD Unix] / 43BSDReno / usr.bin / refer / papers |
1.1 root 1: %A L. P. Deutsch
2: %A B. W. Lampson
3: %T An online editor
4: %J Comm. Assoc. Comp. Mach.
5: %V 10
6: %N 12
7: %D December 1967
8: %P 793-799, 803
9: %K qed
10:
11: .[
12: %r 17
13: %K cstr
14: %R Comp. Sci. Tech. Rep. No. 17
15: %I Bell Laboratories
16: %C Murray Hill, New Jersey
17: %A B. W. Kernighan
18: %A L. L. Cherry
19: %T A System for Typesetting Mathematics
20: %d May 1974, revised April 1977
21: %J Comm. Assoc. Comp. Mach.
22: %K acm cacm
23: %V 18
24: %P 151-157
25: %D March 1975
26: .]
27:
28: %T U\s-2NIX\s0 Time-Sharing System: Document Preparation
29: %K unix bstj
30: %A B. W. Kernighan
31: %A M. E. Lesk
32: %A J. F. Ossanna
33: %J Bell Sys. Tech. J.
34: %V 57
35: %N 6
36: %P 2115-2135
37: %D 1978
38:
39: %A T. A. Dolotta
40: %A J. R. Mashey
41: %T An Introduction to the Programmer's Workbench
42: %J Proc. 2nd Int. Conf. on Software Engineering
43: %D October 13-15, 1976
44: %P 164-168
45:
46: %T U\s-2NIX\s0 Time-Sharing System: The Programmer's Workbench
47: %A T. A. Dolotta
48: %A R. C. Haight
49: %A J. R. Mashey
50: %J Bell Sys. Tech. J.
51: %V 57
52: %N 6
53: %P 2177-2200
54: %D 1978
55: %K unix bstj
56:
57: %T U\s-2NIX\s0 Time-Sharing System: U\s-2NIX\s0 on a Microprocessor
58: %K unix bstj
59: %A H. Lycklama
60: %J Bell Sys. Tech. J.
61: %V 57
62: %N 6
63: %P 2087-2101
64: %D 1978
65:
66: %T The C Programming Language
67: %A B. W. Kernighan
68: %A D. M. Ritchie
69: %I Prentice-Hall
70: %C Englewood Cliffs, New Jersey
71: %D 1978
72:
73: %T Computer Recreations
74: %A Aleph-null
75: %J Software Practice and Experience
76: %V 1
77: %N 2
78: %D April-June 1971
79: %P 201-204
80:
81: %T U\s-2NIX\s0 Time-Sharing System: The U\s-2NIX\s0 Shell
82: %A S. R. Bourne
83: %K unix bstj
84: %J Bell Sys. Tech. J.
85: %V 57
86: %N 6
87: %P 1971-1990
88: %D 1978
89:
90: %A L. P. Deutsch
91: %A B. W. Lampson
92: %T \*sSDS\*n 930 time-sharing system preliminary reference manual
93: %R Doc. 30.10.10, Project \*sGENIE\*n
94: %C Univ. Cal. at Berkeley
95: %D April 1965
96:
97: %A R. J. Feiertag
98: %A E. I. Organick
99: %T The Multics input-output system
100: %J Proc. Third Symposium on Operating Systems Principles
101: %D October 18-20, 1971
102: %P 35-41
103:
104: %A D. G. Bobrow
105: %A J. D. Burchfiel
106: %A D. L. Murphy
107: %A R. S. Tomlinson
108: %T \*sTENEX\*n, a Paged Time Sharing System for the \*sPDP\*n-10
109: %J Comm. Assoc. Comp. Mach.
110: %V 15
111: %N 3
112: %D March 1972
113: %K tenex
114: %P 135-143
115:
116: %A R. E. Griswold
117: %A D. R. Hanson
118: %T An Overview of SL5
119: %J SIGPLAN Notices
120: %V 12
121: %N 4
122: %D April 1977
123: %P 40-50
124:
125: %A E. W. Dijkstra
126: %T Cooperating Sequential Processes
127: %B Programming Languages
128: %E F. Genuys
129: %I Academic Press
130: %C New York
131: %D 1968
132: %P 43-112
133:
134: %A J. A. Hawley
135: %A W. B. Meyer
136: %T M\s-2UNIX\s0, A Multiprocessing Version of U\s-2NIX\s0
137: %K munix unix
138: %R M.S. Thesis
139: %I Naval Postgraduate School
140: %C Monterey, Cal.
141: %D 1975
142:
143: %T The U\s-2NIX\s0 Time-Sharing System
144: %K unix bstj
145: %A D. M. Ritchie
146: %A K. Thompson
147: %J Bell Sys. Tech. J.
148: %V 57
149: %N 6
150: %P 1905-1929
151: %D 1978
152:
153: %A E. I. Organick
154: %T The M\s-2ULTICS\s0 System
155: %K multics
156: %I M.I.T. Press
157: %C Cambridge, Mass.
158: %D 1972
159:
160: %T UNIX for Beginners
161: %A B. W. Kernighan
162: %D 1978
163:
164: %T U\s-2NIX\s0 Programmer's Man\&ual
165: %A K. Thompson
166: %A D. M. Ritchie
167: %K unix
168: %I Bell Laboratories
169: %O Seventh Edition.
170: %D 1978
171:
172: %A K. Thompson
173: %T The U\s-2NIX\s0 Command Language
174: %B Structured Programming\(emInfotech State of the Art Report
175: %I Infotech International Ltd.
176: %C Nicholson House, Maidenhead, Berkshire, England
177: %D March 1975
178: %P 375-384
179: %K unix
180: %X pwb
181: Brief description of shell syntax and semantics, without much
182: detail on implementation.
183: Much on pipes and convenience of hooking programs together.
184: Includes SERMONETTE:
185: "Many familiar computing `concepts' are missing from UNIX.
186: Files have no records. There are no access methods.
187: There are no file types. These concepts fill a much-needed gap.
188: I sincerely hope that when future systems are designed by
189: manufacturers the value of some of these ingrained notions is re-examined.
190: Like the politician and his `common man', manufacturers have
191: their `average user'.
192:
193: %A J. R. Mashey
194: %T PWB/UNIX Shell Tutorial
195: %D September 30, 1977
196:
197: %A D. F. Hartley (Ed.)
198: %T The Cambridge Multiple Access System \- Users Reference Manual
199: %I University Mathematical Laboratory
200: %C Cambridge, England
201: %D 1968
202:
203: %A P. A. Crisman (Ed.)
204: %T The Compatible Time-Sharing System
205: %I M.I.T. Press
206: %K whole ctss book
207: %C Cambridge, Mass.
208: %D 1965
209:
210: %T LR Parsing
211: %A A. V. Aho
212: %A S. C. Johnson
213: %J Comp. Surveys
214: %V 6
215: %N 2
216: %P 99-124
217: %D June 1974
218:
219: %T Deterministic Parsing of Ambiguous Grammars
220: %A A. V. Aho
221: %A S. C. Johnson
222: %A J. D. Ullman
223: %J Comm. Assoc. Comp. Mach.
224: %K acm cacm
225: %V 18
226: %N 8
227: %P 441-452
228: %D August 1975
229:
230: %A A. V. Aho
231: %A J. D. Ullman
232: %T Principles of Compiler Design
233: %I Addison-Wesley
234: %C Reading, Mass.
235: %D 1977
236:
237: .[
238: %r 65
239: %R Comp. Sci. Tech. Rep. No. 65
240: %K CSTR
241: %A S. C. Johnson
242: %T Lint, a C Program Checker
243: %D December 1977
244: %O updated version TM 78-1273-3
245: %D 1978
246: .]
247:
248: %T A Portable Compiler: Theory and Practice
249: %A S. C. Johnson
250: %J Proc. 5th ACM Symp. on Principles of Programming Languages
251: %P 97-104
252: %D January 1978
253:
254: .[
255: %r 39
256: %K CSTR
257: %R Comp. Sci. Tech. Rep. No. 39
258: %I Bell Laboratories
259: %C Murray Hill, New Jersey
260: %A M. E. Lesk
261: %T Lex \(em A Lexical Analyzer Generator
262: %D October 1975
263: .]
264:
265: .[
266: %r 32
267: %K CSTR
268: %R Comp. Sci. Tech. Rep. No. 32
269: %I Bell Laboratories
270: %C Murray Hill, New Jersey
271: %A S. C. Johnson
272: %T Yacc \(em Yet Another Compiler-Compiler
273: %D July 1975
274: .]
275:
276: %T U\s-2NIX\s0 Time-Sharing System: Portability of C Programs and the U\s-2NIX\s0 System
277: %K unix bstj
278: %A S. C. Johnson
279: %A D. M. Ritchie
280: %J Bell Sys. Tech. J.
281: %V 57
282: %N 6
283: %P 2021-2048
284: %D 1978
285:
286: %T Typing Documents on UNIX and GCOS: The -ms Macros for Troff
287: %A M. E. Lesk
288: %D 1977
289:
290: %A K. Thompson
291: %A D. M. Ritchie
292: %T U\s-2NIX\s0 Programmer's Manual
293: %K unix
294: %I Bell Laboratories
295: %O Sixth Edition
296: %D May 1975
297:
298: %T The Network U\s-2NIX\s0 System
299: %K unix
300: %A G. L. Chesson
301: %J Operating Systems Review
302: %V 9
303: %N 5
304: %P 60-66
305: %D 1975
306: %O Also in \f2Proc. 5th Symp. on Operating Systems Principles.\f1
307:
308: %T Spider \(em An Experimental Data Communications System
309: %Z ctr127
310: %A A. G. Fraser
311: %J Proc. IEEE Conf. on Communications
312: %P 21F
313: %O IEEE Cat. No. 74CH0859-9-CSCB.
314: %D June 1974
315:
316: %T A Virtual Channel Network
317: %A A. G. Fraser
318: %J Datamation
319: %P 51-56
320: %D February 1975
321:
322: .[
323: %r 41
324: %K CSTR
325: %R Comp. Sci. Tech. Rep. No. 41
326: %I Bell Laboratories
327: %C Murray Hill, New Jersey
328: %A J. W. Hunt
329: %A M. D. McIlroy
330: %T An Algorithm for Differential File Comparison
331: %D June 1976
332: .]
333:
334: %A F. P. Brooks, Jr.
335: %T The Mythical Man-Month
336: %I Addison-Wesley
337: %C Reading, Mass.
338: %D 1975
339: %X pwb
340: Readable, classic reference on software engineering and
341: problems of large projects, from someone with experience in them.
342: Required reading for any software engineer, even if conclusions may not
343: always be agreed with.
344: %br
345: "The second is the most dangerous system a man every designs." p.55.
346: %br
347: "Hence plan to throw one away; you will, anyhow." p.116.
348: %br
349: "Cosgrove has perceptively pointed out that the programmer delivers
350: satisfaction of a user need rather than any tangible product.
351: And both the actual need and the user's perception of that need
352: will change as programs are built, tested, and used." p.117.
353: %br
354: "The total cost of maintaining a widely used program is typically 40 percent
355: or more of the cost of developing it." p.121.
356: %br
357: "As shown above, amalgamating prose and program reduces the total
358: number of characters to be stored." p.175.
359:
360: %T A Portable Compiler for the Language C
361: %A A. Snyder
362: %I Master's Thesis, M.I.T.
363: %C Cambridge, Mass.
364: %D 1974
365:
366: %T The C Language Calling Sequence
367: %A M. E. Lesk
368: %A S. C. Johnson
369: %A D. M. Ritchie
370: %D 1977
371:
372: %T Optimal Code Generation for Expression Trees
373: %A A. V. Aho
374: %A S. C. Johnson
375: %D 1975
376: %J J. Assoc. Comp. Mach.
377: %K acm jacm
378: %V 23
379: %N 3
380: %P 488-501
381: %O Also in \f2Proc. ACM Symp. on Theory of Computing,\f1 pp. 207-217, 1975.
382:
383: %A R. Sethi
384: %A J. D. Ullman
385: %T The Generation of Optimal Code for Arithmetic Expressions
386: %J J. Assoc. Comp. Mach.
387: %K acm jacm
388: %V 17
389: %N 4
390: %D October 1970
391: %P 715-728
392: %O Reprinted as pp. 229-247 in \fICompiler Techniques\fR, ed. B. W. Pollack, Auerbach, Princeton NJ (1972).
393: %X pwb
394: Optimal approach for straight-line, fixed
395: number of regs.
396:
397: %T Code Generation for Machines with Multiregister
398: Operations
399: %A A. V. Aho
400: %A S. C. Johnson
401: %A J. D. Ullman
402: %J Proc. 4th ACM Symp. on Principles of Programming Languages
403: %P 21-28
404: %D January 1977
405:
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.