


default search action
ACM SIGPLAN Notices, Volume 21
Volume 21, Number 1, January 1986
- Hal Berghel, Eric Traudt:

Spelling verification in prolog. 19-27 - Daniel Brand:

On typing in prolog. 28-30 - Joseph de Kerf:

APL compared with other languages according to Halstead's theory. 31-39 - Dick Dunn:

Non-technical issues in acceptance of SILs. 40-45 - J. G. Hunt:

Detection of deadlocks in multiprocess systems. 46-48 - Kuo-Cheng Li:

A note on the vector C language. 49-57 - Michael J. Sorens:

A technique for automatically porting dialects of pascal to each other. 58-63 
Volume 21, Number 2, February 1986
- Jan Heering, Paul Klint:

The efficiency of the equation interpreter compared with the UNH Prolog interpreter. 18-21 - W. T. Huang, D. C. You:

Typed functional programming. 22-26 - Jan E. Jonak:

Experience with a FORTH-like language. 27-36 - T. G. Muchnick:

On some extensions of syntactic error recovery technique based on phrase markers. 37-39 - Stan Skelton:

Measurements of migratability and transportability. 40-45 - John Weeks, Hal Berghel:

A comparative feature-analysis of microcomputer prolog implementations. 46-61 
Volume 21, Number 3, March 1986
- Reinhard Männer:

Strong typing and physical units. 11-20 - Mark B. Wells:

A potpourri of notational pet peeves (and their resolution in modcap). 21-30 
Volume 21, Number 4, April 1986
- Paul Rutter:

Book Review: Performance and Evaluation of Lisp Systems by Richard P. Gabriel (MIT Press, 1985). 21 - John Beidler, Paul M. Jackowitz:

Consistent generics in Modula-2. 32-41 - T. Y. Chen, S. C. Kwan:

An analysis of length equation using a dynamic approach. 42-47 - Gerardo Cisneros, Harold V. McIntosh:

Introduction to the programming language convert. 48-57 - Klaus Gröning, Christoph Ohsendoth:

NEMO - A nicely modified YACC. 58-66 - James P. Kelsh, John C. Hansen:

Reasonably priced compilers an interpreters for the IBM PC and compatible computers. 67-69 - Michael Longé:

The line-oriented approach. 70-74 - Kam-Wing Ng, Wai-Yan Ma:

Pitfalls in PROLOG programming. 75-79 
Volume 21, Number 5, May 1986
- Michael B. Feldman:

Ada vs. Modula-2: A response from the ivory tower. 39-44 - James R. Greenwood:

Comments on "A View from the Trenches". Ada vs. Modula-2 vx. Praxis. 45-49 - Vincent Hayward:

Compared anatomy of the programming languages Pascal and C. 50-60 - Mehdi Jazayeri, Mike Haden:

Optimizing compilers are here (mostly). 61-63 - Daniel D. Kary, Paul L. Juell:

TRC: An expert system compiler. 64-68 - Hanspeter Mössenböck:

Alex - A Simple and Efficient Scanner Generator. 69-78 - Will Tracz:

Confessions of a used program salesman - The loves in My Life. 79-81 - James F. Watson:

Recursion: A choice between readability and execution speed. 82-90 - Mark N. Wegman:

What it's like to be a POPL referee; or how to write an extended abstract so that it is more likely to be accepted. 91-95 
Volume 21, Number 6, June 1986
- Martin Gfeller:

APL arrays and their editor. 18-27 - Michael E. Goldsby:

Concurrent use of generic types in MODULA-2. 28-34 - Philip Machanick

:
Are LR parsers too powerful? 35-40 - Dave Taylor:

Visionaries: An interview with professor Michael O'Leary. 41-54 - Jonathan Thornburg:

Keyword input for C. 55-58 - Jonathan Thornburg:

Number crunching in C. 59-60 - Thomas Vasak:

Universal closure operator for prolog. 61-62 - Richard S. Wiener:

Protecting against uninitialized abstract objects in Modula-2. 63-69 - R. J. Zavodnik, M. D. Middleton:

YALE: The design of yet another language-based editor. 70-78 
Volume 21, Number 7, July 1986
- Richard L. Wexelblat:

Proceedings of the 1986 SIGPLAN Symposium on Compiler Construction, Palo Alto, California, USA, June 25-27, 1986. ACM 1986, ISBN 0-89791-197-0 [contents] 
Volume 21, Number 8, August 1986
- John C. Martin:

Book review: Systems Software Tools by Ted J. Biggerstafff: Prentice-Hall, 1986. 11 - Maurice V. Wilkes:

Empiric: a sketch of a programming language designed to facilitate a fine grain of protection. 16-27 - C. Clay:

A new solution to the N <= 8 queens problem. 28-30 - Dick Grune:

Generic packages in C. 31-39 - Pierre Jouvelot:

Designing new languages or new language manipulation systems using ML. 40-52 - David V. Moffat:

Generic data structures in UCSD pascal. 53-61 - Bruce D. Ramsey:

The lion and the unicorn met PROLOG. 62-70 - Xiaolin Zang:

A proposal for implementing the concurrent mechanisms of Ada. 71-79 
Volume 21, Number 9, September 1986
- Terry L. Anderson:

The scope of imported identifiers in Modula-2. 17-21 - Roger R. Baldwin:

Systematic identation in PL/I: minimizing the reduction in horizontal space. 22-26 - H. P. Christiansen, A. Lacroix, K. Lundberg, A. McKeeman, P. D. V. van der Stok:

More or less concerns about MODULA-2. 27-31 - Richard Gisselquist:

An experimental C compiler for the Cray 2 computer. 32-41 - Sharam Hekmatpour, Darrel C. Ince:

Forms as a language facility. 42-48 - Kenneth I. Magel:

Efficient calculation of the scope program complexity metric. 49-56 - Jim R. Parker:

A subset FORTRAN compiler for a modified Harvard architecture. 57-62 - Rollo Silver, Mark B. Wells, Shaun-Inn Wu, Margaret A. Hug:

A concurrent N ≤ 8 Queens' algorithm using modcap. 63-76 - Peter van Eijk:

A useful application of formal procedure parameters. 77-78 
Volume 21, Number 10, October 1986
- Peter Wegner, Bruce D. Shriver:

Proceedings of the 1986 SIGPLAN Workshop on Object-Oriented Programming, OOPWORK 1986, Yorktown Heights, New York, USA, June 9-13, 1986. ACM 1986, ISBN 978-0-89791-205-1 [contents] 
Volume 21, Number 11, November 1986
- Norman K. Meyrowitz:

Conference on Object-Oriented Programming Systems, Languages, and Applications, OOPSLA 1986, Portland, Oregon, USA, Proceedings. ACM 1986, ISBN 0-89791-204-7 [contents] 
Volume 21, Number 12, December 1986
- Jonathan Rees, William D. Clinger:

Revised3 report on the algorithmic language scheme. 37-79 - Tudor Balanescu:

On Hartmann's error-recovery scheme. 80-86 - Harold Boley:

RELFUN: A relational/functional integration with valued clauses. 87-98 - Russell M. Clapp, Trevor N. Mudge, Richard A. Volz:

Solutions to the n Queens problem using tasking in Ada. 99-110 - W. F. Clocksin:

Some comments on "Pitfalls in Prolog Programming". 111-113 - A. Dreiheller, B. Mohr, M. Moerschbacher:

Programming pascal with physical units. 114-123 - Gilbert Gonsalves, Antonio C. Silvestri:

Programming in Smalltalk-80: observations and remarks from the newly initiated. 124-130 - David A. Joslin:

Extended pascal - illustrative features. 131-138 - Hanspeter Mössenböck:

Alex - A simple and efficient scanner generator. 139-148 - Yuh-Huei Shyu:

From semi-syntactic lexical analyzer to a new compiler model. 149-157 - David Turner:

An overview of Miranda. 158-166 - Prescott K. Turner:

Up-down parsing with prefix grammars. 167-174 

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














