Journal: SIGPLAN Notices

Volume 20, Issue 9

11 -- 20Michael P. Barnett. The primitive string manipulation (PRISM) language
21 -- 26Carl Binding. Cheap concurrency in C
27 -- 31A. Toni Cohen, Thomas J. Myers. Information sharing
32 -- 42Bleicke Eggers. The towers of Hanoi: yet another nonrecursive solution
43 -- 51C. Hornsby, C. H. C. Leung. The design and implementation of a flexible retrieval language for a Prolog database system
52 -- 76David C. J. Matthews. Poly manual
77 -- 85Stef. W. Postma. Proposed data structures for QL/Bn
86 -- 93J. Shao, G. E. Quick. Implementation considerations of mapping LISP onto a cellular computer system
94 -- 0Jonathan Thornburg. Further notes on the modulo operator

Volume 20, Issue 8

28 -- 31Michael A. Covington. A further note on looping in Prolog
32 -- 37Donald Nute. A programming solution to certain problems with loops in Prolog
38 -- 40David Poole, Randy Goebel. On eliminating loops in Prolog
41 -- 50Miren Begoña Albizuri-Romero. Internal representation of programs in GRASE
51 -- 59Edward G. Amoroso. The formal specification and prototype implementation of a simple editor
60 -- 63Coenraad Bron, E. J. Dijkstra, T. J. Rossingh. A note on the checking of interfaces between separately compiled modules
64 -- 70A. J. Gerber. The trouble with mutual recursion in Concurrent Euclid
71 -- 72Morton Goldberg. A response to "some concerns about Modula-2"
73 -- 77Lawrence A. Harris, Yannich Wets. Resetting displays
78 -- 81Vladimir Jares. Work with strings of variable length in COBOL
82 -- 87Neil D. Jones, Peter Sestoft, Harald Søndergaard. An experiment in partial evaluation: the generation of a compiler generator
88 -- 92Wilf R. LaLonde, John R. Pugh. Specialization, generalization and inheritance teaching objectives beyond data structures and data types
93 -- 98Thomas N. Turba. The Pascal exception handling proposal
99 -- 106M. W. Whitelaw. Some ramifications of the EXIT statement in loop control
107 -- 112H. Zedan. Safety decomposition of distributed programs

Volume 20, Issue 7

1 -- 11Mark R. Laff, Brent Hailpern. SW 2 - An object-based programming environment
12 -- 18James M. Purtilo. Polylith: An environment to support management of tool interfaces
19 -- 27John T. O'Donnell. Dialogues: A basis for constructing programming environments
28 -- 33Rolf Bahlke, Gregor Snelting. The PSG - Programming System Generator
34 -- 42George McArthur Beshers, Roy H. Campbell. Maintained and constructor attributes
43 -- 59Alan J. Demers, Anne Rogers, Frank Kenneth Zadeck. Attribute propagation by message passing
60 -- 68Cordelia V. Hall, John T. O'Donnell. Debugging in a side effect free programming environment
69 -- 73Daniel Le Métayer. Mechanical analysis of program complexity
74 -- 82R. Kent Dybvig, Bruce T. Smith. A semantic editor
83 -- 91Mark B. Wells, Margaret A. Hug, Rollo Silver. Libraries as programs preserved within compiler continuations
93 -- 106Susan Horwitz, Tim Teitelbaum. Relations and attributes: A symbiotic basis for editing environments
107 -- 116Keith D. Cooper, Ken Kennedy, Linda Torczon. The impact of interprocedural analysis and optimization on the design of a software development environment
117 -- 130Snorri Agnarsson, Mukkai S. Krishnamoorthy. Towards a theory of packages
131 -- 139David Gries, Jan Prins. A new notion of encapsulation
140 -- 147Michael A. Caplinger. Structured Editor Support for Modularity and Data Abstraction
148 -- 160Mark Moriconi, Dwight F. Hare. PegaSys: A system for graphical explanation of program designs
161 -- 170Bent Bruun Kristensen, Ole Lehrmann Madsen, Birger Møller-Pedersen, Kristen Nygaard. An algebra for program fragments
171 -- 178Robert Hood. Efficient abstractions for the implementation of structured editors
179 -- 190Nissim Francez, Shalom Goldenberg, Ron Y. Pinter, Michael L. Tiomkin, Shalom Tsur. An environment for logic programming
191 -- 198Henryk Jan Komorowski, Shigeo Omori. A model and an implementation of a logic programming environment
199 -- 207Bruce J. MacLennan. A simple software environment based on objects and relations
208 -- 215Stephen Fickas. Design issues in a Rule-Based System
216 -- 229Richard E. Sweet. The Mesa programming environment
230 -- 244Daniel C. Swinehart, Polle T. Zellweger, Robert B. Hagmann. The structure of Cedar
245 -- 251James E. Donahue. Integration mechanisms in Cedar

Volume 20, Issue 6

16 -- 19K. John Gough. A new method of generating LL(1) lookahead sets
20 -- 25Chingmin Jim Lo. Simple patches to Modula-2 text IO
26 -- 32Richard A. O'Keefe. Alternatives to keyword parameters
33 -- 38Richard A. O'Keefe. Finding smallTalk methods
39 -- 46Michael H. Rosenbloom. M'PAL: a programming language based on natural English definitions
47 -- 55Piotr Rudnicki. On the organization of Pascal blocks
56 -- 64Richard S. Wiener, Richard F. Sincovec. Two approaches to implementing generic data structures in Modula-2

Volume 20, Issue 5

8 -- 15Michael R. Dunlavey. A progress report on D: a compiled language featuring continuations
16 -- 20Stepan Maziar. Solution of the Tower of Hanoi problem using a binary tree
21 -- 30Richard R. Ragan. CYBIL: cyber implementation language
31 -- 35Lidia Segre, Michael Stanton. "Some concerns about Modula-2" considered unwarranted
36 -- 44Robert E. Strom, Shaula Yemini. The NIL distributed systems programming language: a status report
45 -- 47Jan Vanthienen. A note on English for decision tables considered harmful and the nested IF-THEN-ELSE

Volume 20, Issue 4

19 -- 23A. P. Chang. A note on the MODULO operation
24 -- 32Harvey Glass. Threaded interpretive systems and functional programming environments
33 -- 41Jan E. Jonak. Pascal and comms programming
42 -- 56Michael F. Kilian. A conditional critical region pre-processor for C based on the Owicki and Gries scheme
57 -- 69Bent Bruun Kristensen, Ole Lehrmann Madsen, Birger Møller-Pedersen, Kristen Nygaard. Multi-sequential execution in the BETA programming language
71 -- 79Salvatore Mamone. Using a PC to increase your odds of winning the lottery
80 -- 86Ivan Sklenár. Programming language assessments using the program profiles
88 -- 95Ivan Tomek, Tomasz Müldner. A CAI implementation of Pascal

Volume 20, Issue 3

9 -- 15Kalyan Dutta. Modular programming in C: an approach and an example
16 -- 31Lem O. Ejiogu. A simple measure of software complexity
32 -- 36Philip Machanick. The case for simplified languages
37 -- 47Uwe Petermann, Andrzej Szalas. A note on PCI: distributed processes communicating by interrupts

Volume 20, Issue 2

7 -- 16Ralph E. Griswold. Rebus: a SNOBOL4/icon hybrid
17 -- 20G. Brun, A. Businger, R. Schoenberger. The token-oriented approach to program editing
21 -- 31Ian D. Cottam. Extending Pascal with one-entry/multi-exit procedures
32 -- 41Peter C. J. Graham. Using BINS for inter-process communication
42 -- 51Warren Harrison, Curtis R. Cook. A method of sharing industrial software complexity data
52 -- 53Warren Harrison, Curtis R. Cook. Software complexity research: a survey
54 -- 57Jerrold Heyman. Software conversion: retargeting from a super-mini to a micro
58 -- 76Lambert G. L. T. Meertens, Steven Pemberton. Description of B
77 -- 79Ludovít Molnár, Pavol Návrat, Jirí Safarík. The programming language Pascal (in teaching perspective): take it or leave it

Volume 20, Issue 12

5 -- 12Michael P. Barnett. A simple mechanism that supports the prism language
13 -- 17Richard Bielak. ADA(*) vs. Modula-2: a view from the trenches
18 -- 25Albert L. Crawford. High level input/output in Modula-2
26 -- 32Jurek Czyzowicz, Michal Iglewski. Implementing generic types in Modula-2
33 -- 38Kio C. Hyun, Ernst-Erich Doberkat. Inline expansion of SETL procedures
39 -- 46Milos Konopasek. The towers of Hanoi from a different viewpoint
47 -- 53Robert W. Sebasta, Mark A. Taylor. Minimal perfect hash functions for reserved word lists
54 -- 63P. D. Terry. CLANG - a simple teaching language

Volume 20, Issue 11

14 -- 22Peter A. Buhr. A case for teaching multi-exit loops to beginning programmers
23 -- 26Neil A. Burkhard. Machine-independent C optimizer
27 -- 29Barry Dwyer. Improving Gough's LL(1) lookahead generator
30 -- 38Rajiv Gupta, Mary Lou Soffa. The efficiency of storage management schemes for Ada programs
39 -- 45David Joslin. Extensions in Pascal implementations
47 -- 48Robert Marcus. Generalized inheritance
49 -- 53Douglas M. Pase. System programming in Modula-2
54 -- 63Antonio C. Silvestri. An IBM-PC numeric I/O interrupt
64 -- 68Michael Wolfe, Thomas Macke. Where are the optimizing compilers?
69 -- 77J. A. Zimmer. A modest Modula wish list

Volume 20, Issue 10

9 -- 13Roger R. Baldwin. A generalization of Neta Amit's statement of the general problem of deeply nested IF-THEN-ELSEs
14 -- 22Malcolm K. Crowe, Clark Nicol, Michael Hughes, David Mackay. On converting a compiler into an incremental compiler
23 -- 35David M. Harland, Martyn W. Szyplewski, John B. Wainwright. An alternative view of polymorphism
36 -- 43Darrel C. Ince, Walton Hall, Milton Keynes. The influence of system design complexity research on the design of module interconnection languages
44 -- 47Randy M. Kaplan. small-X - a language and interpreter for building expert systems
48 -- 59Hidekazu Matsumoto. A static analysis of prolog programs
60 -- 71Walter G. Olthoff. An overview on ModPascal
72 -- 78Jerome A. Otto. Predicting potential COBOL performance on low level machine architectures
79 -- 86Don Rosenthal. Adding meta rules to OPS5 a proposed extension
87 -- 94Thomas J. Sager. A technique for creating small fast compiler frontends
95 -- 104Andrzej Szalas, Danuta Szczepanska. Exception handling in parallel computations
105 -- 110Yoshito Yamane. Some thoughts on the type system of B1

Volume 20, Issue 1

9 -- 10Graham M. Birtwistle. The coroutines of Hanoi
11 -- 19Pierre Breguet, François Grize, Alfred Strohmeier. SARTEX a programming language for graph processing
20 -- 26Michael A. Covington. Eliminating unwanted loops in Prolog
27 -- 30Charles Hammons, Paul Dobbs. Multilevel files for software development