default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSIGPLAN 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 Wilhelm 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. Dave Boswell, Michael J. Carmody, Trevor 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
- John R. White, Lawrence A. Rowe:
Proceedings of the 1983 ACM SIGPLAN Symposium on Programming Language Issues in Software Systems, SIGPLAN 1983, San Francisco, California, USA, June 27-29, 1983. ACM 1983, ISBN 978-0-89791-108-5 [contents]
Volume 18, Number 7, July 1983
- 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
- Richard E. Fairley, Mark Scott Johnson:
Proceedings of the symposium on High-level debugging, SIGSOFT 1983, Pacific Grove, California, USA, March 20-23, 1983. ACM 1983, ISBN 978-0-89791-111-5 [contents]
Volume 18, Number 9, September 1983
- 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
- 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
- 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
- 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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-19 22:17 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
