Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDACM SIGPLAN Notices, Volume 20
Volume 20, Number 1, January 1985
- Graham M. Birtwistle:
The coroutines of Hanoi. 9-10 - Pierre Breguet, François Grize, Alfred Strohmeier:
SARTEX a programming language for graph processing. 11-19 - Michael A. Covington:
Eliminating unwanted loops in Prolog. 20-26 - Charles Hammons, Paul Dobbs:
Multilevel files for software development. 27-30
Volume 20, Number 2, February 1985
- Ralph E. Griswold:
Rebus: a SNOBOL4/icon hybrid. 7-16 - G. Brun, Arnold Businger, Roger Schoenberger:
The token-oriented approach to program editing. 17-20 - Ian D. Cottam:
Extending Pascal with one-entry/multi-exit procedures. 21-31 - Peter C. J. Graham:
Using BINS for inter-process communication. 32-41 - Warren Harrison, Curtis R. Cook:
A method of sharing industrial software complexity data. 42-51 - Warren Harrison, Curtis R. Cook:
Software complexity research: a survey. 52-53 - Jerrold Heyman:
Software conversion: retargeting from a super-mini to a micro. 54-57 - Lambert G. L. T. Meertens, Steven Pemberton:
Description of B. 58-76 - Ludovít Molnár, Pavol Návrat
, Jirí Safarík:
The programming language Pascal (in teaching perspective): take it or leave it. 77-79
Volume 20, Number 3, March 1985
- Kalyan Dutta:
Modular programming in C: an approach and an example. 9-15 - Lem O. Ejiogu:
A simple measure of software complexity. 16-31 - Philip Machanick:
The case for simplified languages. 32-36 - Uwe Petermann, Andrzej Szalas:
A note on PCI: distributed processes communicating by interrupts. 37-47
Volume 20, Number 4, April 1985
- A. P. Chang:
A note on the MODULO operation. 19-23 - Harvey Glass:
Threaded interpretive systems and functional programming environments. 24-32 - Jan E. Jonak:
Pascal and comms programming. 33-41 - Michael F. Kilian:
A conditional critical region pre-processor for C based on the Owicki and Gries scheme. 42-56 - Bent Bruun Kristensen, Ole Lehrmann Madsen, Birger Møller-Pedersen, Kristen Nygaard:
Multi-sequential execution in the BETA programming language. 57-69 - Salvatore Mamone:
Using a PC to increase your odds of winning the lottery. 71-79 - Ivan Sklenár:
Programming language assessments using the program profiles. 80-86 - Ivan Tomek, Tomasz Müldner:
A CAI implementation of Pascal. 88-95
Volume 20, Number 5, May 1985
- Michael R. Dunlavey:
A progress report on D: a compiled language featuring continuations. 8-15 - Stepan Maziar:
Solution of the Tower of Hanoi problem using a binary tree. 16-20 - Richard R. Ragan:
CYBIL: cyber implementation language. 21-30 - Lidia Segre, Michael Stanton:
"Some concerns about Modula-2" considered unwarranted. 31-35 - Robert E. Strom, Shaula Yemini:
The NIL distributed systems programming language: a status report. 36-44 - Jan Vanthienen:
A note on English for decision tables considered harmful and the nested IF-THEN-ELSE. 45-47
Volume 20, Number 6, June 1985
- K. John Gough:
A new method of generating LL(1) lookahead sets. 16-19 - Chingmin Jim Lo:
Simple patches to Modula-2 text IO. 20-25 - Richard A. O'Keefe:
Alternatives to keyword parameters. 26-32 - Richard A. O'Keefe:
Finding smallTalk methods. 33-38 - Michael H. Rosenbloom:
M'PAL: a programming language based on natural English definitions. 39-46 - Piotr Rudnicki:
On the organization of Pascal blocks. 47-55 - Richard S. Wiener, Richard F. Sincovec:
Two approaches to implementing generic data structures in Modula-2. 56-64
Volume 20, Number 7, July 1985
- Teri F. Payton, L. Peter Deutsch, James Purtilo:
Proceedings of the ACM SIGPLAN 85 Symposium on Language Issues in Programming Environments, SLIPE 1985, Seattle, Washington, USA, June 25-28, 1985. ACM 1985, ISBN 978-0-89791-165-8 [contents]
Volume 20, Number 8, August 1985
- Michael A. Covington:
A further note on looping in Prolog. 28-31 - Donald Nute:
A programming solution to certain problems with loops in Prolog. 32-37 - David Poole, Randy Goebel:
On eliminating loops in Prolog. 38-40 - Miren Begoña Albizuri-Romero:
Internal representation of programs in GRASE. 41-50 - Edward G. Amoroso:
The formal specification and prototype implementation of a simple editor. 51-59 - Coenraad Bron, E. J. Dijkstra, T. J. Rossingh:
A note on the checking of interfaces between separately compiled modules. 60-63 - A. J. Gerber:
The trouble with mutual recursion in Concurrent Euclid. 64-70 - Morton Goldberg:
A response to "some concerns about Modula-2". 71-72 - Lawrence A. Harris, Yannich Wets:
Resetting displays. 73-77 - Vladimir Jares:
Work with strings of variable length in COBOL. 78-81 - Neil D. Jones, Peter Sestoft, Harald Søndergaard:
An experiment in partial evaluation: the generation of a compiler generator. 82-87 - Wilf R. LaLonde, John R. Pugh:
Specialization, generalization and inheritance teaching objectives beyond data structures and data types. 88-92 - Thomas N. Turba:
The Pascal exception handling proposal. 93-98 - M. W. Whitelaw:
Some ramifications of the EXIT statement in loop control. 99-106 - H. Zedan:
Safety decomposition of distributed programs. 107-112
Volume 20, Number 9, September 1985
- Michael P. Barnett:
The primitive string manipulation (PRISM) language. 11-20 - Carl Binding:
Cheap concurrency in C. 21-26 - A. Toni Cohen, Thomas J. Myers:
Information sharing. 27-31 - Bleicke Eggers:
The towers of Hanoi: yet another nonrecursive solution. 32-42 - C. Hornsby, C. H. C. Leung:
The design and implementation of a flexible retrieval language for a Prolog database system. 43-51 - David C. J. Matthews:
Poly manual. 52-76 - Stef. W. Postma:
Proposed data structures for QL/Bn. 77-85 - J. Shao, Gerry E. Quick:
Implementation considerations of mapping LISP onto a cellular computer system. 86-93 - Jonathan Thornburg:
Further notes on the modulo operator. 94
Volume 20, Number 10, October 1985
- Roger R. Baldwin:
A generalization of Neta Amit's statement of the general problem of deeply nested IF-THEN-ELSEs. 9-13 - Malcolm K. Crowe, Clark Nicol, Michael Hughes, David Mackay:
On converting a compiler into an incremental compiler. 14-22 - David M. Harland, Martyn W. Szyplewski, John B. Wainwright:
An alternative view of polymorphism. 23-35 - Darrel C. Ince, Walton Hall, Milton Keynes:
The influence of system design complexity research on the design of module interconnection languages. 36-43 - Randy M. Kaplan:
small-X - a language and interpreter for building expert systems. 44-47 - Hidekazu Matsumoto:
A static analysis of prolog programs. 48-59 - Walter G. Olthoff:
An overview on ModPascal. 60-71 - Jerome A. Otto:
Predicting potential COBOL performance on low level machine architectures. 72-78 - Don Rosenthal:
Adding meta rules to OPS5 a proposed extension. 79-86 - Thomas J. Sager:
A technique for creating small fast compiler frontends. 87-94 - Andrzej Szalas, Danuta Szczepanska:
Exception handling in parallel computations. 95-104 - Yoshito Yamane:
Some thoughts on the type system of B1. 105-110
Volume 20, Number 11, November 1985
- Peter A. Buhr:
A case for teaching multi-exit loops to beginning programmers. 14-22 - Neil A. Burkhard:
Machine-independent C optimizer. 23-26 - Barry Dwyer:
Improving Gough's LL(1) lookahead generator. 27-29 - Rajiv Gupta, Mary Lou Soffa:
The efficiency of storage management schemes for Ada programs. 30-38 - David Joslin:
Extensions in Pascal implementations. 39-45 - Robert Marcus:
Generalized inheritance. 47-48 - Douglas M. Pase:
System programming in Modula-2. 49-53 - Antonio C. Silvestri:
An IBM-PC numeric I/O interrupt. 54-63 - Michael Wolfe, Thomas Macke:
Where are the optimizing compilers? 64-68 - J. Adrian Zimmer:
A modest Modula wish list. 69-77
Volume 20, Number 12, December 1985
- Michael P. Barnett:
A simple mechanism that supports the prism language. 5-12 - Richard Bielak:
ADA(*) vs. Modula-2: a view from the trenches. 13-17 - Albert L. Crawford:
High level input/output in Modula-2. 18-25 - Jurek Czyzowicz, Michal Iglewski:
Implementing generic types in Modula-2. 26-32 - Kio C. Hyun, Ernst-Erich Doberkat:
Inline expansion of SETL procedures. 33-38 - Milos Konopasek:
The towers of Hanoi from a different viewpoint. 39-46 - Robert W. Sebasta, Mark A. Taylor:
Minimal perfect hash functions for reserved word lists. 47-53 - P. D. Terry:
CLANG - a simple teaching language. 54-63
a service of 
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-04-18 21:10 CEST 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:
