SIGPLAN Notices, Volume 18

Volume 18, Number 1, January 1983

• 
  Joe Celko, John S. Davis, John Mitchell:
  A Demonstration of Three Requirements Language Systems. 9-14
• 
  Brad J. Cox:
  The Object Oriented Pre-Compiler. 15-22
• 
  Karel Culík:
  On Formal and Informal Proofs for Program Correctness. 23-28
• 
  Dan R. Olsen:
  A Subset Algorithm for Deterministic FSMs within Deterministic PDAs. 29-34
• 
  Uri Shani:
  Should Program Editors not Abandon Text Oriented Commands? 35-41
• 
  David Spector:
  The Simplest Functional Programming Language. 42-46

Volume 18, Number 2, February 1983

• 
  Arol Ambler, Robert Trawick:
  Chatin's Graph Coloring Algorithm as a Method for Assigning Positions to Diana Attributes. 37-38
• 
  Hans W. Barz:
  Implementing Semaphores by Binary Semaphores. 39-45
• 
  Daniel M. Berry:
  A New Methodology for Generating Test Cases for a Programming Language Compiler. 46-56
• 
  F. D. Boswell, M. J. Carmody, T. R. Grove:
  A String Extension for Pascal. 57-61
• 
  Raphael A. Finkel:
  Run-time Print Values. 62-64
• 
  Manfred Jackel:
  Context Senitive Formatting. 65-68
• 
  E. M. J. C. Van Oost:
  DUIF: A Data-Oriented Flowchart Environmemnt. 69-75

Volume 18, Number 3, March 1983

• 
  Giovanni Cantone, Aniello Cimitile, Lucio Sansone:
  Complexity in Program Schemes: The Characteristic Polynomial. 22-31
• 
  E. H. den Hertog, H. J. C. Gerbscheid, Martin L. Kersten:
  Do-Select Reconsidered. 32-35
• 
  Bruce J. MacLennan:
  Overview of Relational Programming. 36-45
• 
  Desiré Vermaak:
  PROGEN: A Programming Environment. 46-47

Volume 18, Number 4, April 1983

• 
  Stowe Boyd:
  Modular C. 45-54
• 
  Elfriede Fehr:
  The "Simplest Functional Programming Language" is neither Simple nor Functional. 55-57
• 
  Rhys S. Francis:
  Containment Defines a Class of Recursive Data Structures. 58-64
• 
  Norman Hardy:
  Nested Scopes in Pascal and Algol 68. 65
• 
  Alfred Laut:
  An Algebraic Specification of Pascal's File Type. 66-68
• 
  David May:
  OCCAM. 69-79
• 
  Karl L. Pentzlin:
  Discussion of Statement Labels; Proposal of a "Transfer/Junction" Construct as Alternative to "Goto". 80-81
• 
  F. Teiyeira de Queiroz:
  The Next Control Structure That I Need. 82-85
• 
  Howard E. Tompkins:
  In Defense of Teaching Structured COBOL as Computer Science (or, Notes on being Sage Struck). 86-94

Volume 18, Number 5, May 1983

• 
  Sergio Antoy, Giuliana Dettori:
  Is Pascal suitable for GKS? 11-14
• 
  David E. Boddy:
  Implementing data abstractions and monitors in UCSD Pascal. 15-24
• 
  James Harle:
  The proposed standard for Basic. 25-40
• 
  Arun Lakhotia:
  An improvement over: "an improvement over deeply nested IF-THEN-ELSE control structure". 41-43
• 
  Philip Machanick:
  A note on C. S. Wetherell's "Problems with the Ada reference grammar". 44-45
• 
  Richard A. O'Keefe:
  Prolog compared with LISP? 46-56
• 
  Michael Lee Scott:
  Messages vs. remote procedures is a false dichotomy. 57-62

Volume 18, Number 6, June 1983

• 
  Butler W. Lampson, Eric E. Schmidt:
  Organizing software in a distributed environment. 1-13
• 
  Michael L. Powell, Mark A. Linton:
  Visual abstraction in an interactive programming environment. 14-21
• 
  U. Honschopp, Wolfram-Manfred Lippe, Friedemann H. Simon:
  Compiling functional languages for von Neumann machines. 22-27
• 
  Rodney Farrow:
  Attribute grammars and data-flow languages. 28-40
• 
  Juha Heinänen:
  A programmer controlled approach to data and control abstraction. 41-52
• 
  William E. Weihl, Barbara Liskov:
  Specification and implementation of resilient, atomic data types. 53-64
• 
  Thomas J. LeBlanc, Robert P. Cook:
  An analysis of language models for high-performance communication in local-area networks. 65-72
• 
  Robert E. Strom, Shaula Yemini:
  NIL: An integrated language and system for distributed programming. 73-82
• 
  Joachim W. Schmidt, Manuel Mall:
  Abstraction mechanisms for database programming. 83-93
• 
  Dzenan Ridjanovic, Michael L. Brodie:
  Action and transaction skeletons: : High level language constructs for database transactions. 94-99
• 
  Mary Shaw, Ellen Borison, Michael Horowitz, Tom Lane, David Nichols, Randy Pausch:
  Descartes: A programming-language approach to interactive display interfaces. 100-111
• 
  Dan R. Olsen Jr., Elizabeth P. Dempsey:
  Syntax directed graphical interaction. 112-117
• 
  Michel Pilote:
  A programming language framework for designing user interfaces. 118-136
• 
  Harold L. Ossher, Brian K. Reid:
  Fable: A programming-language solution to IC process automation problems. 137-148
• 
  Stephen W. Smoliar, David R. Barstow:
  Who needs languages, and why do they need them? or no matter how high the level, it's still programming. 149-157
• 
  Marc D. Donner:
  The design of OWL a language for walking. 158-165
• 
  Richard Zippel:
  Capsules. 166-169
• 
  Gordon S. Novak Jr.:
  Data abstraction in GLISP. 170-177
• 
  Antonio Albano:
  Type hierarchies and Semantic Data Models. 178-186
• 
  Gordon V. Cormack:
  Extensions to static scoping. 187-191
• 
  Isabel Gouveia Lima, Richard P. Hopkins, Lindsay Marshall, David Mundy, Philip C. Treleaven:
  Decentralised control flow - based on UNIX. 192-201
• 
  Jon Shultis:
  A functional shell. 202-211
• 
  Christopher W. Fraser, David R. Hanson:
  A high-level programming and command language. 212-219

Volume 18, Number 7, July 1983

Technical contributions

• 
  Jacques Calmet, Robert-Michel di Scala:
  Pascal as host language of computer algebra systems. 15-24
• 
  Harry Feldmann:
  Acceptive grammars. 25-44
• 
  Gebhard Greiter:
  Comparing two definitions for the notion "data type". 45-49
• 
  Kurt Guntheroth:
  The new ANSI BASIC standard. 50-59
• 
  Steven Gutfreund:
  Tracing offensive values from exceptions. 60-61
• 
  Edward G. Nilges:
  On bugs and swarms: towards a sociobiology of programming? 62-64
• 
  Ikuo Takeuchi, Hiroshi G. Okuno, Nobuyasu Ohsato:
  TAO: a harmonic mean of Lisp, Prolog and Smalltalk. 65-74
• 
  John R. Thompson:
  The use and abuse of formal proofs. 75-79

Volume 18, Number 8, August 1983

Proceedings of the ACM SIGSOFT/SIGPLAN software engineering symposium on high-level debugging Debugging methodology

• 
  Wayne C. Gramlich:
  Debugging methodology: session summary. 1-3
• 
  Dick Hamlet:
  Debugging "level": step-wise debugging. 4-8
• 
  Rich Seidner, Nick Tindall:
  Interactive debug requirements. 9-22

Knowledge-based debugging

• 
  Mark A. Linton, Robert Balzer, R. J. Cunningham, C. Cordell Green, Robert Sedlmeyer, Elliott Solloway, William R. Swartout, Pamela Zave:
  Knowledge-based debugging: session summary. 23-24
• 
  Robert L. Sedlmeyer, William B. Thompson, Paul E. Johnson:
  Knowledge-based fault localization in debugging: preliminary draft. 25-31

Requirements/design debugging

• 
  Peter Bates:
  Requirements/design debugging: session summary. 32-33
• 
  Bernd Bruegge, Peter G. Hibbard:
  Generalized path expressions: a high level debugging mechanism. 34-44
• 
  Lori A. Clarke, Debra J. Richardson:
  The application of error-sensitive testing strategies to debugging. 45-52
• 
  Claude Jard, Gregor von Bochmann:
  An approach to testing specifications. 53-59

Integrated environments

• 
  Insup Lee:
  Integrated environments. 60-62
• 
  Zen Kishimoto:
  An experimental debugger in a limited programming environment. 63-66
• 
  Michael L. Powell, Mark A. Linton:
  A database model of debugging. 67-70
• 
  Martin Mikelsons:
  Interactive program execution in Lispedit. 71-80
• 
  Monika Müllerburg:
  The role of debugging within software engineering environments. 81-90
• 
  Harald Wertz:
  An integrated Lisp programming environment. 91-95

Distributed debugging

• 
  Thomas R. Gross:
  Distributed debugging: session summary. 96-97
• 
  Fabrizio Baiardi, Nicoletta De Francesco, E. Matteoli, S. Stefanini, Gigliola Vaglini:
  Development of a debugger for a concurrent language. 98-106
• 
  Peter C. Bates, Jack C. Wileden:
  An approach to high-level debugging of distributed systems: preliminary draft. 107-111
• 
  Jonice Cynthia Weber:
  Interactive debugging of concurrent programs. 112-113

Implementation issues

• 
  Janice Cynthia Weber:
  Implementation issues: session summary. 114-116
• 
  Michael S. Kenniston, Russ Atkinson:
  Implementation issues II. 117-120
• 
  Knut Barra, Hans Petter Dahle:
  SIMOB: a portable toolbox for observation of SIMULA executions. 121-122
• 
  Jeanne Ferrante:
  High level language debugging with a compiler. 123-129
• 
  Peter Fritzson:
  A systematic approach to advanced debugging: incremental compilation. 130-139
• 
  W. Morven Gentleman, Henry Hoeksma:
  Hardware assisted high level debugging: preliminary draft. 140-144
• 
  Charles R. Hill:
  A real-time microprocessor debugging technique. 145-148
• 
  John D. Johnson, Gary W. Kenney:
  Implementation issues for a source level symbolic debugger. 149-151
• 
  Karl J. Ottenstein, Linda M. Ottenstein:
  High-level debugging assistance via optimizing compiler technology. 152-154
• 
  Ron Tischler, Robin Schaufler, Charlotte Payne:
  Static analysis of programs as an aid to debugging. 155-158
• 
  Polle T. Zellweger:
  An interactive high-level debugger for control-flow optimized programs. 159-172

Demonstrations

• 
  Bert Beander:
  VAX DEBUG: an interactive, symbolic, multilingual debugger. 173-179
• 
  James R. Cardell:
  Multilingual debugging with the SWAT high-level debugger. 180-189
• 
  Thomas A. Cargill:
  The blit debugger: preliminary draft. 190-200
• 
  Robert P. Cook, Insup Lee:
  DYMOS: a dynamic modification system. 201-202
• 
  Carol K. Walter:
  DELTA: the Universal Debugger for CP-6. 203-205
• 
  Mark Scott Johnson:
  Summary of evaluation and comments. 206

Volume 18, Number 9, September 1983

Technical contributions

• 
  Rommert J. Casimir:
  Collections of variables. 26-30
• 
  Darrel C. Ince:
  A compatibility software tool for use with separately compiled languages. 31-34
• 
  Fahimeh Jalili:
  A general linear-time evaluator for attribute grammars. 35-44
• 
  B. A. E. Meekings:
  Style analysis of Pascal programs. 45-54
• 
  Huub Mulders:
  Some observations on the in- and output in high-level languages. 55-58
• 
  David Spector:
  Language features to support reusability. 59-61
• 
  Jacques J. Tamine:
  On the use of tree-like structures to symplify measures of complexity. 62-69
• 
  C. K. Yuen:
  The programmer as navigator: a discourse on program structure. 70-78

Volume 18, Number 10, October 1983

Technical contributions

• 
  K. S. Bhaskar:
  How object-oriented is your system? 8-11
• 
  Jan van Katwijk:
  A preprocessor for YACC or a poor man's approach to parsing attributed grammars. 12-15
• 
  Edward Reid:
  Fighting the disease: more comments after Dijkstra and Tompking. 16-21
• 
  Michael H. Rosenbloom:
  Deeply nested IF-THEN-ELSE's. 22-24
• 
  David Spector:
  Lexing and parsing Modula-2. 25-32
• 
  David Taylor:
  An improvement to the 'if-then-else' and 'select' clauses, and some comments on Arun Lakhotias' an improvement over . . . 33-37
• 
  Robert D. Tennent:
  An alternative to conformant-array parameters in Pascal. 38-43
• 
  Joseph B. Weinman:
  Nestable bracketed comments. 44-47

Volume 18, Number 11, November 1983

Technical contributions

• 
  Alan Burns:
  Enhanced input/output on Pascal. 24-33
• 
  Stefano Ceri, Stefano Crespi-Reghizzi:
  Relational data bases in the design of program construction systems. 34-44
• 
  Jason Gait:
  Command level software tools. 45-53
• 
  Rainer Woitok:
  Abstracting linked data structures using incremental records. 54-63

Volume 18, Number 12, December 1983

Technical contributions

• 
  E. J. Brown:
  On the application of Rothon diagrams to data abstraction. 17-24
• 
  James R. Comer:
  An experimental natural-language processor for generating data type specifications. 25-33
• 
  Joëlle Despeyroux:
  An algebraic specification of a Pascal compiler. 34-48
• 
  Harley Flanders:
  Coroutines in Pascal. 49-56
• 
  W. M. Evangelist:
  Relationships among computational, software, and intuitive complexity. 57-59
• 
  Josef Grosch:
  Type derivation graphs: a way to visualize the type building possibilities of programming languages. 60-68
• 
  Leon S. Levy:
  A walk through AWK. 69-85
• 
  Bruce J. MacLennan:
  Abstraction in the Intel iAPX-432 prototype systems implementation language. 86-95
• 
  Gary H. Merrill:
  Proofs, program correctness, and software engineering. 96-105
• 
  Paula S. Newman:
  IF-THEN-ELSE, again. 106-111
• 
  Olle Olsson:
  The memory usage of a LISP system: the Belady life-time function. 112-119
• 
  B. Srinivasan:
  Is nested control structure more complex? 120-121
• 
  R. Michael Wharton:
  A note on types and prototypes. 122-126