SIGPLAN Notices, Volume 17, 1982

Volume 17, Number 1, January 1982

Joseph A. Goguen, José Meseguer: Completeness of many-sorted equational logic. 9-17
Grady Booch: Naming subprograms with clarity. 18-22
D. F. Dixon: A Pascal compiler testing facility. 23-26
Janusz W. Laski: Application of the goal invariant to the structuring of programs. 27-36
Haim Kilov: Guidelines for writing PL/I programs. 37-39
Alex Bykat: An extension to PASCAL input-output procedures. 40-41
Bjarne Stroustrup: Classes: an abstract data type facility for the C language. 42-51

Kuo-Chung Tai: Comments on parameter passing techniques in programming languages. 24-27
W. H. Jessop: Ada packages and distributed systems. 28-36
G. Ford, B. Hansche: Optional, repeatable, and varying type parameters. 41-48
T. N. Roberts: More on bit processing with FORTRAN. 49-52
Mark Scott Johnson: A software debugging glossary. 53-70

Kenneth I. Magel: A theory of small program complexity. 37-45
Ronald Morrison: The string as a simple data type. 46-52
C. E. Prael: PASCAL for operating software? A critical examination. 53-57
N. F. Salt: Defining software science counting strategies. 58-67
R. S. Scowen: A standard syntactic metalanguage. 68-73
R. S. Scowen, Zbigniew Ciechanowicz: Seven sorts of programs. 74-79
David Spector: Minimal overhead garbage collection of complex list structure. 80-82
P. van den Bosch: The translation of programming languages through the use of a graph transformation language. 83-92
P. van der Linden: Ambiguity and orthogonality in Ada. 93-94

Edsger W. Dijkstra: How do we tell truths that might hurt? 13-15
David R. Barach, David H. Taenzer: A Technique for Finding Storage Allocation Errors in C-language Programs. 16-23
Massimo Ancona, Gabriella Dodero, Vittoria Gianuzzi: Building Collections of LR(k) Items with Partial Expansion of Lookahead Strings. 24-28
Mauro Guazzo: APL Fins Its Aplomb. 29-37
Morris E. Kranc: A Separate Compilation Facility for Pascal. 38-46
Gebhard Greiter: A Data Type Theory. 47-53
Breck Carter: On Choosing Identifiers. 54-59
Richard C. Holt: A Short Introduction to Concurrent Euclid. 60-79
Nguyen the Thanh: Indirect Threaded Code used to emulate a virtual machine. 80-89
Harlan K. Seyfer: Compiler Test Sets. 90-97

Proceedings of the SIGPLAN '82 Symposium on Compiler Construction, Boston, Massachusetts, June 23-25, 1982. ACM, ISBN 0-89791-074-5
Contents

Malcolm P. Atkinson, Kenneth Chisholm, W. Paul Cockshott: PS-algol: an Algol with a persistent heap. 24-31
David R. Barach, David H. Taenzer, R. E. Wells: A technique for finding storage allocation errors in C-language programs. 32-38
Richard C. Waters: Program editors should not abandon text oriented commands. 39-46
Joseph C. H. Park: A new LALR formalism. 47-61
David M. Harland, Hamish I. E. Gunn: Another look at enumerated types. 62-71
H. M. Gladney: How to print with style. 72-79
R. Fischer: A note on GOTO-less programming in APL using the unquote-operator. 80-87
Michael Lesk: English for Decision Tables Considered Harmful. 88

M. D. de Jong, Chris Hankin: Structured Data Flow Programming. 18-27
Martin McCaig: Towards a Novel String Processing Language. 28-33
Grady Early: Functional Programming and the Two-Pass Assembler. 34-42
David Spector: Ambiguities and Insecurities in Modula-2. 43-51
Gregory P. Hill: An Improvement Over Deeply Nested IF-THEN-ELSE Control Structures. 52-56
Karel Culík: An Advanced Programming Language Definition and Domain Correctness of Programs. 57-66
Mark A. Jones: A Comparison of LISP Specifications of Function Definition and Argument Handling. 67-73

Alan J. Perlis: Epigrams on Programming. 7-13
Matti O. Jokinen: The Effect of Parameter Passing and Other Implementation Dependent Mechanisms is Undecedable. 16-17
Curtis R. Cook, R. R. Oldehoeft: A Letter Oriented Minimal Perfect Hash Function. 18-27
Roger T. Sumner, R. E. Gleaves: Modula-2 - A Solution to Pascal's Problems. 28-33
Walter W. Wilson: Beyond Prolog: Software Specification by Grammar. 34-43
Paul Piwowarski: A Nesting Level Complexity Measure. 44-50
Tim Rentsch: Object Oriented Programming. 51-57
G. Greiter: Remarks on Language Concepts for specifying Process Synchronization. 58-61
Janusz W. Laski: On Data Flow Guided Program Testing. 62-71
David Marca: A Repetition Construct for UNIX Version 6. 72-75
P. David Stotts: A Comparative Survey of Concurrent Programming Languages. 76-87
Roger G. Stone: Points Recurring - The History of a Railway Problem. 88-94

Malcolm K. Crowe: An Incremental Compiler. 13-22
Kenneth I. Magel: A Report on a PASCAL Questionaire. 23-32
Michael J. Rees: Automatic Assessment Aids for Pascal Programs. 33-42
Bruce J. MacLennan: A Simple, Natural Notion for Applicative Languages. 43-49
P. David Stotts: A Comparative Survey of Concurrent Programming Languages. 50-61
Hans Meijer, Anton Nijholt: Translator Writing Tools since 1970: A Selective Bibliography (June 1982). 62-72
F. E. J. Kruseman Aretz: Syntax diagrams for ISO Pascal standard. 73-78

Paul D. Gootherts: Common Programming Language Ambiguity. 7-10
Karl L. Pentzlin: Syntax of Comments: Discussion and a Proposal. 11-13
Kent Karlsson, Kent Petersson: Notes from: The Aspenäs Symposium on Functional Languages and Computer Architecture. 14-23
Steven G. Duff: The Case for Buffers in SNOBOL4. 24-30
Lindsay Groves: Using Simple English Sentences to Call Procedures. 31-38
Eric B. Levy: The Case against Pascal as Teaching Tool. 39-41
A. J. Payne: A Basis for the Rate of Change in Programs. 42-44
Ellis Cohen: Text-Oriented Structure Commands for Structure Editors. 45-49
Yury Litvin: Parallel Evolution Programming Language for Data Flow Machines. 50-58

Colin Burgess, Laurence James: A Revised Indexed Bibliography for LR Grammars and Parsers. 18-26
David E. Boddy: A Style for Structured APL. 27-30
Robert Cailliau: How to avoid getting schlonked by Pascal. 31-40
Robert Paul Corbett: Enhanced Arithmetic for Fortran. 41-48
Leo Geurts: An Overview of the B Programming Language - or: B without Tears. 49-58
H. M. Gladney: A Note on Enumerations. 59-64
David M. Harland: Subtypes versus Cell Constancy With Subrange Constraints. 65-69
Bruce J. MacLennan: Values and Objects in Programming Languages. 70-79
Michael J. Wise: EPILOG = PROLOG + Data Flow: Arguments for Combining PROLOG with a Data Driven Mechanism. 80-86