%A J.R. Ehrman
%T System design, machine architecture and debugging
%J SIGPLAN Notices
%K programming languages
%V 7
%N 8
%D August 1972
%P 8-23

%A B.A. Wichman
%T Estimating the execution speed of an Algol program
%J SIGPLAN Notices
%K programming languages
%V 7
%N 8
%D August 1972
%P 24-44

%A J.E. Sammet
%T Roster of programming languages
%J SIGPLAN Notices
%K programming languages
%V 7
%N 9
%D September 1972
%P 3-12

%A E.J. Krall
%T An implementation of on-conditions in LISP
%J SIGPLAN Notices
%K programming languages
%V 7
%N 9
%D September 1972
%P 13-20

%A B.M. Schwarz
%T Design and implementation of PL/I preprocessor-based systems
%J SIGPLAN Notices
%K programming languages
%V 7
%N 9
%D September 1972
%P 21-36

%A W.A. Wulf
%T The problem of the definition of subroutine calling conventions
%J SIGPLAN Notices
%K programming languages
%V 7
%N 12
%D December 1972
%P 3-8

%A B.N. Dickman
%T Subroutine interface primitives for ETC
%J SIGPLAN Notices
%K programming languages
%V 7
%N 12
%D December 1972
%P 9-19

%A H.D. Baecker
%T On a missing mode in Algol 68
%J SIGPLAN Notices
%K programming languages
%V 7
%N 12
%D December 1972
%P 20-30

%A M. Rain
%T Storage control in MARY
%J SIGPLAN Notices
%K programming languages
%V 7
%N 12
%D December 1972
%P 31-39

%A E. Wegner
%T Tree-structured programs
%J SIGPLAN Notices
%K programming languages
%V 7
%N 12
%D December 1972
%P 40-41

%A P. Holager
%T A consolidation of synchronization primitives
%J SIGPLAN Notices
%K programming languages
%V 7
%N 12
%D December 1972
%P 42-50

%A B.L. Clark
%A J.J. Horning
%T Reflections on a language designed to write an operating system
%J SIGPLAN Notices
%K programming languages
%V 8
%N 9
%D September 1973

%A D. Beech
%A M. Marcotty
%T Unfurling the PL/I standard
%J SIGPLAN Notices
%K programming languages
%V 8
%N 10
%D October 1973
%P 12-43

%A F.G. Pagan
%T On the teaching of disciplined programming
%J SIGPLAN Notices
%K programming languages
%V 8
%N 10
%D October 1973
%P 44-48

%A R.C.L. Martin
%T Preferring to crawl after you can walk
%J SIGPLAN Notices
%K programming languages
%V 8
%N 12
%D December 1973
%P 3-4

%A J.J. Martin
%T The 'natural' set of basic control structures
%J SIGPLAN Notices
%K programming languages
%V 8
%N 12
%D December 1973
%P 5-14

%A R.A. Krutar
%T Restricted global variables in Algol 60
%J SIGPLAN Notices
%K programming languages
%V 8
%N 12
%D December 1973
%P 15-17

%A J.E. George
%A G.R. Sager
%T Variables - bindings and protection
%J SIGPLAN Notices
%K programming languages
%V 8
%N 12
%D December 1973
%P 18-29

%A S. Cohen
%T TSO speakeasy newsletter #7
%J SIGPLAN Notices
%K programming languages
%V 8
%N 12
%D December 1973
%P 30-32

%A F.L. Friedman
%A V.B. Schneider
%T A programming language for mini-computer systems
%J SIGPLAN Notices
%K programming languages
%V 9
%N 1
%D January 1974
%P 8-32

%A R.E. Griswold
%T Suggested revisions and additions
to the syntax and control mechanisms of SNOBOL4
%J SIGPLAN Notices
%K programming languages
%V 9
%N 2
%D February 1974
%P 7-23

%A J. Palme
%T Simula as a tool for extensible program products
%J SIGPLAN Notices
%K programming languages
%V 9
%N 2
%D February 1974
%P 24-40

%A N. Bulut
%A M.H. Halstead
%T Impurities found in algorithm implementation
%J SIGPLAN Notices
%K programming languages
%V 9
%N 3
%D March 1974
%P 9-11

%A R.H. Karpinski
%T An unstructured view of structured programming
%J SIGPLAN Notices
%K programming languages
%V 9
%N 3
%D March 1974
%P 12-19

%A B. Liskov
%A S. Zilles
%T An introduction th CLU
%J SIGPLAN Notices
%K programming languages
%V 9
%N 4
%D April 1974

%A P.W. Abrahams
%T Improving the control structure of SNOBOL4
%J SIGPLAN Notices
%K programming languages
%V 9
%N 5
%D May 1974
%P 10-12

%A W. Bilofsky
%T Syntax extension and the IMP72 programming language
%J SIGPLAN Notices
%K programming languages
%V 9
%N 5
%D May 1974
%P 13-30

%A A.N. Gileadi
%A H.F. Ledgard
%T On a proposed measure of program structure
%J SIGPLAN Notices
%K programming languages
%V 9
%N 5
%D May 1974
%P 31-36

%A H.W. Besel
%T After the goto debate
%J SIGPLAN Notices
%K programming languages
%V 9
%N 6
%D June 1974
%P 13-16

%A B.N. Dickman
%T More fuel for the goto controversy
%J SIGPLAN Notices
%K programming languages
%V 9
%N 6
%D June 1974
%P 17

%A D.L. Ostapko
%T On deriving a relation between circuits and input/output
by analyzing an equivalent program
%J SIGPLAN Notices
%K programming languages
%V 9
%N 6
%D June 1974
%P 18-24

%A L. Weissman
%T Psychological complexity of computer programs:
an experimental methodology
%J SIGPLAN Notices
%K programming languages
%V 9
%N 6
%D June 1974
%P 25-36

%A D.P. Friedman
%A S.C. Shapiro
%T A case for while-until
%J SIGPLAN Notices
%K programming languages
%V 9
%N 7
%D July 1974
%P 7-14

%A O. Lecarme
%T Structured programming, programming teaching and the language Pascal
%J SIGPLAN Notices
%K programming languages
%V 9
%N 7
%D July 1974
%P 15-21

%A S.H. Sanfield
%T The scope of variable concept: the key to structured programming ?
%J SIGPLAN Notices
%K programming languages
%V 9
%N 7
%D July 1974
%P 22-29

%A J. van Peschke
%T Syntactic rules embedded in PL/I
%J SIGPLAN Notices
%K programming languages
%V 9
%N 7
%D July 1974
%P 30-38

%A J.M. Watt
%A J.E.L. Peck
%A M. Sintzoff
%T Revised Algol 68 syntax chart
%J SIGPLAN Notices
%K programming languages
%V 9
%N 7
%D July 1974
%P 39

%A D.W. Bray
%T Dynamic storage routines for fortran programs
%J SIGPLAN Notices
%K programming languages
%V 9
%N 9
%D September 1974
%P 2-13

%A H. Kleine
%A R.V. Morris
%T Modern programming: a definition
%J SIGPLAN Notices
%K programming languages
%V 9
%N 9
%D September 1974
%P 14-17

%A A.G. Middleton
%T A structured model of programs suitable for analysing time/storage
trade-offs
%J SIGPLAN Notices
%K programming languages
%V 9
%N 9
%D September 1974
%P 18-28

%A M.V. Zelkowitz
%T Interactive PL/I
%J SIGPLAN Notices
%K programming languages
%V 9
%N 9
%D September 1974
%P 29-31

%A J.F. Gimpel
%T Some highlights of the SITBOL language extensions to SNOBOL4
%J SIGPLAN Notices
%K programming languages
%V 9
%N 10
%D October 1974
%P 11-20

%A O. Lecarme
%A P. Desjardins
%T Reply to a paper by A.N. Habermann on the programming language Pascal
%J SIGPLAN Notices
%K programming languages
%V 9
%N 10
%D October 1974
%P 21-27

%A K.C. McCoy
%T Testing the readability and composability of computer programs:
methodology
%J SIGPLAN Notices
%K programming languages
%V 9
%N 10
%D October 1974
%P 28

%A L.P. Meissner
%T A compatible "structured" extension to fortran
%J SIGPLAN Notices
%K programming languages
%V 9
%N 10
%D October 1974
%P 29-36

%A P.J. Denning
%T Is "structured programming" any longer the right term ?
%J SIGPLAN Notices
%K programming languages
%V 9
%N 11
%D November 1974
%P 4-5

%A B.K. Rosen
%T Note on semantics and optimization
%J SIGPLAN Notices
%K programming languages
%V 9
%N 11
%D November 1974
%P 6-10

%A J.E. Sammet
%T Roster of programming languages for 1973
%J SIGPLAN Notices
%K programming languages
%V 9
%N 11
%D November 1974
%P 18-31

%A W.C.M. Vaughan
%T Another look at the CASE statement
%J SIGPLAN Notices
%K programming languages
%V 9
%N 11
%D November 1974
%P 31-36

%A R.R. Korfhage
%T On the development of data structures
%J SIGPLAN Notices
%K programming languages
%V 9
%N 12
%D December 1974
%P 14-21

%A D.M. O'Neill
%T SFOR - a precompiler for the implementation
of a fortran-based structured language
%J SIGPLAN Notices
%K programming languages
%V 9
%N 12
%D December 1974
%P 22-28

%A B. Shneidermaan
%T The chemistry of control structures
%J SIGPLAN Notices
%K programming languages
%V 9
%N 12
%D December 1974
%P 29-34

%A N. Terashima
%T SYSL - system description language
%J SIGPLAN Notices
%K programming languages
%V 9
%N 12
%D December 1974
%P 35-44

%A A. Beckman
%T Secondary effects
%J SIGPLAN Notices
%K programming languages
%V 10
%N 2
%D February 1975
%P 10-11

%A D.P. Geller
%T How bad can it get?
%J SIGPLAN Notices
%K programming languages
%V 10
%N 2
%D February 1975
%P 12-13

%A I.D. Hill
%A R.S. Scowen
%A B.A. Wichmann
%T Writing algorithms in Algol 60
%J SIGPLAN Notices
%K programming languages
%V 10
%N 2
%D February 1975
%P 14-31

%A T.W.S. Plum
%T Mathematical overkill and the structure theorem
%J SIGPLAN Notices
%K programming languages
%V 10
%N 2
%D February 1975
%P 32-33

%A E. Wegner
%T Control constructs for programming languages
%J SIGPLAN Notices
%K programming languages
%V 10
%N 2
%D February 1975
%P 34-41

%A D.S. Higgins
%T A structured fortran translator
%J SIGPLAN Notices
%K programming languages
%V 10
%N 2
%D February 1975
%P 42-48


%A P. Abrahams
%T "Structured programming" considered harmful
%J SIGPLAN Notices
%K programming languages
%V 10
%N 4
%D April 1975
%P 13-24

%A C.L. McClure
%T Structured programming in cobol
%J SIGPLAN Notices
%K programming languages
%V 10
%N 4
%D April 1975
%P 25-33

%A R.F. Mathis
%T Flow trace of a structured program
%J SIGPLAN Notices
%K programming languages
%V 10
%N 4
%D April 1975
%P 33-36

%A N.H. Weiderman
%A B.M. Rawson
%T Flowcharting loops without cycles
%J SIGPLAN Notices
%K programming languages
%V 10
%N 4
%D April 1975
%P 37-45

%A B.L. Wolman
%T Reply to "Interactive PL/1"
%J SIGPLAN Notices
%K programming languages
%V 10
%N 4
%D April 1975
%P 46-48

%A S.H. Kamnitzer
%T Bootstrapping XPL from IBM/360 to Univac 1100
%J SIGPLAN Notices
%K programming languages
%V 10
%N 5
%D May 1975
%P 14-20

%A D. McQuillan
%T Transaction diagrams - a design tool
%J SIGPLAN Notices
%K programming languages
%V 10
%N 5
%D May 1975
%P 21-26

%A L.P. Meissner
%T Fortran development newsletter, no 2
%J SIGPLAN Notices
%K programming languages
%V 10
%N 5
%D May 1975
%P 27-28

%A D.L. Parnas
%T On the need for fewer restrictions
in changing compile-time environments
%J SIGPLAN Notices
%K programming languages
%V 10
%N 5
%D May 1975
%P 29-35

%A G.D. Ripley
%A R.E. Griswold
%T Tools for the measurement of SNOBOL4 programs
%J SIGPLAN Notices
%K programming languages
%V 10
%N 5
%D May 1975
%P 36-52

%A H. Witt
%T Pun-dora's box
or how to produce enough papers to wrap up structured programming
%J SIGPLAN Notices
%K programming languages
%V 10
%N 8
%D August 1975
%P 10

%A J.A. Mason
%T Some user-defined control functions for more readable APL programs
%J SIGPLAN Notices
%K programming languages
%V 10
%N 8
%D August 1975
%P 11-19

%A A. Salvadori
%A J. Gordon
%A C. Capstick
%T Static profile of cobol programs
%J SIGPLAN Notices
%K programming languages
%V 10
%N 8
%D August 1975
%P 20-33

%A G.M. Weinberg
%A D.P. Geller
%A T.W.S. Plum
%T IF-THEN-ELSE considered harmful
%J SIGPLAN Notices
%K programming languages
%V 10
%N 8
%D August 1975
%P 34-44

%A P.J. Denning
%T Comments on mathematical overkill
%J SIGPLAN Notices
%K programming languages
%V 10
%N 9
%D September 1975
%P 10

%A C.R. Foulf
%T The DO trace:
a simple and effective method for debugging GOTO-free programs
%J SIGPLAN Notices
%K programming languages
%V 10
%N 9
%D September 1975
%P 11-18

%A L.P. Meissner
%T On extending fortran control structures
to facilitate structured programming
%J SIGPLAN Notices
%K programming languages
%V 10
%N 9
%D September 1975
%P 19-29

%A F.G. Sayward
%T A correctness criterion for CSP parallel programs
%J SIGPLAN Notices
%K programming languages
%V 10
%N 9
%D September 1975
%P 30-38

%A B.J. MacLennan
%T A note on dynamic arrays in Pascal
%J SIGPLAN Notices
%K programming languages
%V 10
%N 9
%D September 1975
%P 39-40

%A R. Bond
%T Free form structured fortran translator
%J SIGPLAN Notices
%K programming languages
%V 10
%N 10
%D October 1975
%P 12-15

%A L. Flon
%T On research in structured programming
%J SIGPLAN Notices
%K programming languages
%V 10
%N 10
%D October 1975
%P 16

%A L.E. Gales
%T Structured fortran with no preprocessor
%J SIGPLAN Notices
%K programming languages
%V 10
%N 10
%D October 1975
%P 17-24

%A R.J. Lambird
%A L.E. Cornish
%T The Exec 8 implementation of list processor-N
%J SIGPLAN Notices
%K programming languages
%V 10
%N 10
%D October 1975
%P 25-36

%A D.M. Berry
%T Structured documentation
%J SIGPLAN Notices
%K programming languages
%V 10
%N 11
%D November 1975
%P 7-12

%A F.P. Coakley
%T Experience with the use of the case statement with a M.O.L.
%J SIGPLAN Notices
%K programming languages
%V 10
%N 11
%D November 1975
%P 13-16

%A W.H. Dailey
%T A tabular approach to program optimization
%J SIGPLAN Notices
%K programming languages
%V 10
%N 11
%D November 1975
%P 17-21

%A S. Leibowitz
%T Memory optimization using block structures
%J SIGPLAN Notices
%K programming languages
%V 10
%N 11
%D November 1975
%P 22-24

%A A.G. Middleton
%T Connector functions - another view of the goto
%J SIGPLAN Notices
%K programming languages
%V 10
%N 11
%D November 1975
%P 25-37

%A M.H. Williams
%T A note on the ambiguity of the common statement
%J SIGPLAN Notices
%K programming languages
%V 10
%N 11
%D November 1975
%P 38-40

%A W.H. Dailey
%T On generating binary decision trees with minimum nodes
%J SIGPLAN Notices
%K programming languages
%V 10
%N 12
%D December 1975
%P 14-21

%A J.B. Holton
%T Toward efficient programming in virtual systems
%J SIGPLAN Notices
%K programming languages
%V 10
%N 12
%D December 1975
%P 22-25

%A T.D. Lassagne
%T Recursive definitions for iterative algorithms
%J SIGPLAN Notices
%K programming languages
%V 10
%N 12
%D December 1975
%P 26-38

%A L.P. Meisser
%T On preprocessors
%J SIGPLAN Notices
%K programming languages
%V 10
%N 12
%D December 1975
%P 39

%A G. Yuval
%T A SNOBOL 4 execution profile
%J SIGPLAN Notices
%K programming languages
%V 10
%N 12
%D December 1975
%P 40

%A L.P. Meissner
%T Proposed control structures for extended fortran
%J SIGPLAN Notices
%K programming languages
%V 11
%N 1
%D January 1976
%P 16-21

%A D.W. Embley
%A W.J. Hansen
%T The KAIL selector - a unified control construct
%J SIGPLAN Notices
%K programming languages
%V 11
%N 1
%D January 1976
%P 22-29

%A C. Landau
%T On high-level languages for system programming
%J SIGPLAN Notices
%K programming languages
%V 11
%N 1
%D January 1976
%P 30-31

%A G. Winiger
%T A note on one-pass CASE statement compilation
%J SIGPLAN Notices
%K programming languages
%V 11
%N 1
%D January 1976
%P 32-36

%A N. Wirth
%T Comment on a note on dynamic arrays in Pascal
%J SIGPLAN Notices
%K programming languages
%V 11
%N 1
%D January 1976
%P 37-38

%A S. Worona
%T PL/CT, another approach to two problems in PL/I
%J SIGPLAN Notices
%K programming languages
%V 11
%N 1
%D January 1976
%P 39-44

%A P.W. Abrahams
%T On realism in programming example
%J SIGPLAN Notices
%K programming languages
%V 11
%N 2
%D February 1976
%P 17-19

%A H.W. Lawson
%A D.R. Doucette
%T A translation machine with automated top-down parsing
%J SIGPLAN Notices
%K programming languages
%V 11
%N 2
%D February 1976
%P 20-29

%A D.J. Reifer
%T The structured fortran dilemma
%J SIGPLAN Notices
%K programming languages
%V 11
%N 2
%D February 1976
%P 30-32

%A G.H. Richmond
%T Pascal newsletter
%J SIGPLAN Notices
%K programming languages
%V 11
%N 2
%D February 1976
%P 33-48

%A R. Bond
%T An intuitive translation technique
%J SIGPLAN Notices
%K programming languages
%V 11
%N 5
%D May 1976
%P 33-36

%A O. Buchegger
%A N.E. Fuchs
%T If 'ELSE' then 'CASE'
%J SIGPLAN Notices
%K programming languages
%V 11
%N 5
%D May 1976
%P 37

%A J.L. Elshoff
%T Measuring commercial PL/I programs using Halstead's criteria
%J SIGPLAN Notices
%K programming languages
%V 11
%N 5
%D May 1976
%P 38-46

%A R. Hamlet
%T The PDP-11 as B5500 in teaching systems programming
%J SIGPLAN Notices
%K programming languages
%V 11
%N 5
%D May 1976
%P 47-51

%A W.T. Hardgrave
%T Positional versus keyword parameter communication
in programming languages
%J SIGPLAN Notices
%K programming languages
%V 11
%N 5
%D May 1976
%P 52-58

%A J. Palme
%T New feature for module protection in Simula
%J SIGPLAN Notices
%K programming languages
%V 11
%N 5
%D May 1976
%P 59-62

%A J. Steensgaard-Madsen
%T More on dynamic arrays in PASCAL
%J SIGPLAN Notices
%K programming languages
%V 11
%N 5
%D May 1976
%P 63

%A A.S. Tanenbaum
%T In defence of program testing
or correctness proofs considered harmful
%J SIGPLAN Notices
%K programming languages
%V 11
%N 5
%D May 1976
%P 64-68

%A J.A. Archibald
%T Towards a dynamic (Fortran) programming system
%J SIGPLAN Notices
%K programming languages
%V 11
%N 7
%D July 1976
%P 17-24

%A D. Allison
%A happy Lady
%A and friends
%T Design notes for Tiny BASIC
%J SIGPLAN Notices
%K programming languages
%V 11
%N 7
%D July 1976
%P 25-33

%A R.K. Bennett
%T Build: a primitive approach
to the design of computer languages and their translators
%J SIGPLAN Notices
%K programming languages
%V 11
%N 7
%D July 1976
%P 34-40

%A R.E. Brown
%T Toward a better language for structured programming
%J SIGPLAN Notices
%K programming languages
%V 11
%N 7
%D July 1976
%P 41-54

%A R.G. Ward
%T A non-iterative situation case statement
%J SIGPLAN Notices
%K programming languages
%V 11
%N 7
%D July 1976
%P 55-62

%A M.H. Williams
%T A question-answering system for automatic program synthesis
%J SIGPLAN Notices
%K programming languages
%V 11
%N 7
%D July 1976
%P 63-68

%A M. Feurman
%A M.R. Dallal
%A L. Liebling
%T Structured programming in COBOL
%J SIGPLAN Notices
%K programming languages
%V 11
%N 8
%D August 1976
%P 16-30

%A C.W. Barth
%T STRCMACS - macros for structured programming
in 360/370 assembly language
%J SIGPLAN Notices
%K programming languages
%V 11
%N 8
%D August 1976
%P 31-35

%A D. Matuszek
%T The case for the assert statement
%J SIGPLAN Notices
%K programming languages
%V 11
%N 8
%D August 1976
%P 36-37

%A G. Misuri
%T Survey of existing programming aids
%J SIGPLAN Notices
%K programming languages
%V 11
%N 8
%D August 1976
%P 38-41

%A S. Matwin
%A M. Missala
%T A simple, machine independent tool
for obtaining rough measures of PASCAL programs
%J SIGPLAN Notices
%K programming languages
%V 11
%N 8
%D August 1976
%P 42-45

%A C.L. McClure
%T Ordering control data in structured COBOL
%J SIGPLAN Notices
%K programming languages
%V 11
%N 8
%D August 1976
%P 46-51

%A R.F. Bridge
%A E.W. Thompson
%T BRIDGES - a tool for increasing
the reliability of references to fortran variables
%J SIGPLAN Notices
%K programming languages
%V 11
%N 9
%D September 1976
%P 2-9

%A A.J. Cook
%T Experience with extensible, portable fortran extensions
%J SIGPLAN Notices
%K programming languages
%V 11
%N 9
%D September 1976
%P 10-17

%A G. Musstoph
%T The programming system POLYP - structure and experience
%J SIGPLAN Notices
%K programming languages
%V 11
%N 9
%D September 1976
%P 18-24

%A M.B. Wells
%T Preprocessing of typed two-dimensional mathematical expressions
%J SIGPLAN Notices
%K programming languages
%V 11
%N 9
%D September 1976
%P 25-37

%A J.D. Woolley
%A L.R. Miller
%A C.M. Bernstein
%T LINUS: an experiment in language preprocessing
%J SIGPLAN Notices
%K programming languages
%V 11
%N 9
%D September 1976
%P 38-48

%A R.A. DeMillo
%A S.C. Eisenstat
%A R.J. Lipton
%T Can structured programming be efficient ?
%J SIGPLAN Notices
%K programming languages
%V 11
%N 10
%D October 1976
%P 12-18

%A J.L.W. Kessels
%T Parallel programming concepts in a definitional language
%J SIGPLAN Notices
%K programming languages
%V 11
%N 10
%D October 1976
%P 19-31

%A E.N. Kittlitz
%T Block statements and synonyms in Pascal
%J SIGPLAN Notices
%K programming languages
%V 11
%N 10
%D October 1976
%P 32-35

%A S. Pokrovsky
%T Formal types and their application to dynamic arrays in Pascal
%J SIGPLAN Notices
%K programming languages
%V 11
%N 10
%D October 1976
%P 36-42

%A S.W. Rowland
%T Some comments on structured fortran
%J SIGPLAN Notices
%K programming languages
%V 11
%N 10
%D October 1976
%P 43-48

%A J. Simon
%T A comment on do traces
%J SIGPLAN Notices
%K programming languages
%V 11
%N 10
%D October 1976
%P 49-52

%A R. Conradi
%T Further critical comments on Pascal,
particularly as a systems programming language
%J SIGPLAN Notices
%K programming languages
%V 11
%N 11
%D November 1976
%P 8-25

%A R.W. Goodell
%T A generalized approach to interpretation machines
%J SIGPLAN Notices
%K programming languages
%V 11
%N 11
%D November 1976
%P 26-37

%A A.C. Fleck
%T On the impossibility of content exchange
through the by-name parameter transmission mechanism
%J SIGPLAN Notices
%K programming languages
%V 11
%N 11
%D November 1976
%P 38-41

%A L.T. Love
%A A.B. Bowman
%T An independent test of the theory of software physics
%J SIGPLAN Notices
%K programming languages
%V 11
%N 11
%D November 1976
%P 42-49

%A C.D. Marlin
%T An experiment with the extensibility of Simula
%J SIGPLAN Notices
%K programming languages
%V 11
%N 11
%D November 1976
%P 50-57

%A P. Roy
%T Linear flowchart generator for a structured language
%J SIGPLAN Notices
%K programming languages
%V 11
%N 11
%D November 1976
%P 58-64

%A R. Conway
%T PL/CS - a highly disciplined subset of PL/C
%J SIGPLAN Notices
%K programming languages
%V 11
%N 12
%D December 1976
%P 21-24

%A S.I. Feldman
%T A fortranner's lament:
comments on the draft proposed ANSI fortran standard
%J SIGPLAN Notices
%K programming languages
%V 11
%N 12
%D December 1976
%P 25-34

%A A. Gottlieb
%T A flowcharting proposal
%J SIGPLAN Notices
%K programming languages
%V 11
%N 12
%D December 1976
%P 35-37

%A L. Kahn
%T Program structure definition using binary relations
%J SIGPLAN Notices
%K programming languages
%V 11
%N 12
%D December 1976
%P 38-55

%A A.R. Korncoff
%T SAGES: system adding the generation of engineering software
%J SIGPLAN Notices
%K programming languages
%V 11
%N 12
%D December 1976
%P 56-73

%A W.C. Nylin
%T Multiple tense computer programming
%J SIGPLAN Notices
%K programming languages
%V 11
%N 12
%D December 1976
%P 74-93

%A D. Schwabe
%A C.J. Lucena
%T Specification and uniform reference to data structures in PL/I
%J SIGPLAN Notices
%K programming languages
%V 11
%N 12
%D December 1976
%P 94-104

%A S.M. Bellovin
%T Alphabetic list of authors and papers permuted KWIC index
%J SIGPLAN Notices
%K programming languages
%V 12
%N 1
%D January 1977
%P 18-39

%A R.J. Chevance
%T Design of high level language oriented processors
%J SIGPLAN Notices
%K programming languages
%V 12
%N 1
%D January 1977
%P 40-51

%A R.M. DeMorgan
%A I.D. Hill
%A B.A. Wichman
%T A supplement to the Algol 60 revised report
%J SIGPLAN Notices
%K programming languages
%V 12
%N 1
%D January 1977
%P 52-66

%A M.B. Feldman
%T Embedding extended arithmetic in SNOBOL4
%J SIGPLAN Notices
%K programming languages
%V 12
%N 1
%D January 1977
%P 67-72

%A I. Kimura
%T A report on a symposium on structured programming
and experiences with it
%J SIGPLAN Notices
%K programming languages
%V 12
%N 1
%D January 1977
%P 73-81

%A E.N. Kittlitz
%T Another proposal for variable size arrays in Pascal
%J SIGPLAN Notices
%K programming languages
%V 12
%N 1
%D January 1977
%P 82-86

%A P. Ludemann
%T A language design for program structure
%J SIGPLAN Notices
%K programming languages
%V 12
%N 1
%D January 1977
%P 87-92

%A L.P. Meissner
%T Fortran 77
%J SIGPLAN Notices
%K programming languages
%V 12
%N 1
%D January 1977
%P 93-94

%A D. Salomon
%T A design for fortran to facilitate structured programming
%J SIGPLAN Notices
%K programming languages
%V 12
%N 1
%D January 1977
%P 95-100

%A A. Biedl
%T An extension of programming languages
for numerical computation in science and engineering
with special reference to Pascal
%J SIGPLAN Notices
%K programming languages
%V 12
%N 4
%D April 1977
%P 31-33

%A D.E. Boddy
%T Structured fortran - with or without a preprocessor
%J SIGPLAN Notices
%K programming languages
%V 12
%N 4
%D April 1977
%P 34-39

%A R.E. Griswold
%A D.R. Hanson
%T An overview of SL5
%J SIGPLAN Notices
%K programming languages
%V 12
%N 4
%D April 1977
%P 40-50

%A R. Hamlet
%T Ignorance of ALGOL68 considered harmful
%J SIGPLAN Notices
%K programming languages
%V 12
%N 4
%D April 1977
%P 51-56

%A E.T. Hartnett
%T Star fortran, an overview of essential characteristics
%J SIGPLAN Notices
%K programming languages
%V 12
%N 4
%D April 1977
%P 57-66

%A M. Huybrechts
%T Dynosor, a set of subroutines
for dynamic memory organization in fortran programs
%J SIGPLAN Notices
%K programming languages
%V 12
%N 4
%D April 1977
%P 67-74

%A T. Middleton
%T A macro approach to abstractions of data structures
%J SIGPLAN Notices
%K programming languages
%V 12
%N 4
%D April 1977
%P 75-79

%A S.K. Robinson
%A I.S. Torsun
%T The automatic measurement of the relative merits of student programs
%J SIGPLAN Notices
%K programming languages
%V 12
%N 4
%D April 1977
%P 80-93

%A A. Beckman
%T Comments considered harmful
%J SIGPLAN Notices
%K programming languages
%V 12
%N 4
%D April 1977
%P 94-96

%A R.A. Freiburghouse
%T Proposed extensions to PL/I for real-time applications
%J SIGPLAN Notices
%K programming languages
%V 12
%N 7
%D July 1977
%P 26-42

%A G. Atkinson
%T The non-desirability to structured programming in user languages
%J SIGPLAN Notices
%K programming languages
%V 12
%N 7
%D July 1977
%P 43-50

%A R.J. Cichelli
%A M.J. Cichelli
%T Goal directed programming
%J SIGPLAN Notices
%K programming languages
%V 12
%N 7
%D July 1977
%P 51-59

%A P. Dembinski
%T The taming of the pointer
%J SIGPLAN Notices
%K programming languages
%V 12
%N 7
%D July 1977
%P 60-74

%A D. Grune
%T A view of coroutines
%J SIGPLAN Notices
%K programming languages
%V 12
%N 7
%D July 1977
%P 75-81

%A J. Hueras
%A H. Ledgard
%T An automatic formatting program for Pascal
%J SIGPLAN Notices
%K programming languages
%V 12
%N 7
%D July 1977
%P 82-84

%A P. Karasz
%T An intermediate systems language for the PDP-11
%J SIGPLAN Notices
%K programming languages
%V 12
%N 7
%D July 1977
%P 85-100

%A A. Singer
%A J. Hueras
%A H. Ledgard
%T A basis for executing Pascal programmers
%J SIGPLAN Notices
%K programming languages
%V 12
%N 7
%D July 1977
%P 101-105

%A C.M. Thomson
%T Error checking, tracing and dumping in an Algol 68 checkout compiler
%J SIGPLAN Notices
%K programming languages
%V 12
%N 7
%D July 1977
%P 106-111

%A J.D. Woolley
%T Fortran: a comparison of the new proposed language (1976)
to the old standard (1966)
%J SIGPLAN Notices
%K programming languages
%V 12
%N 7
%D July 1977
%P 112-125

%A M.R. Levy
%T Some remarks on abstract data types
%J SIGPLAN Notices
%K programming languages
%V 12
%N 7
%D July 1977
%P 126-128


%A R.D. Dowsing
%T Structured programming constructs
for concurrency in program optimization
%J SIGPLAN Notices
%K programming languages
%V 12
%N 9
%D September 1977
%P 31-35

%A M. Malkosh
%T Internal procedure parameters in structured Fortran precompilers
%J SIGPLAN Notices
%K programming languages
%V 12
%N 9
%D September 1977
%P 45-51

%A R.F. Keller
%T On control constructs for constructing programs
%J SIGPLAN Notices
%K programming languages
%V 12
%N 9
%D September 1977
%P 46-44

%A P. Rechenberg
%T MUMS - a machine independent programming language
consisting of 360 assembler macro calls
%J SIGPLAN Notices
%K programming languages
%V 12
%N 9
%D September 1977
%P 52-59

%A F.N. Ris
%T A unified decimal floating-point architecture
for the support of high-level languages (Extended abstract)
%J SIGPLAN Notices
%K programming languages
%V 12
%N 9
%D September 1977
%P 60-70

%A P. Rutter
%T Uniform handling of exceptions in a stack based language
%J SIGPLAN Notices
%K programming languages
%V 12
%N 9
%D September 1977
%P 71-76

%A S.M. Silverston
%T Extensions to SNOBOL4 in the snobat implementation
%J SIGPLAN Notices
%K programming languages
%V 12
%N 9
%D September 1977
%P 77-84

%A D.N. Smith
%T Proposals for fortran data structures
%J SIGPLAN Notices
%K programming languages
%V 12
%N 9
%D September 1977
%P 85-102

%A N. Terashima
%T The hierarchical language system
%J SIGPLAN Notices
%K programming languages
%V 12
%N 9
%D September 1977
%P 103-113

%A R.W. Witty
%T The switching reverse polish algorithm
%J SIGPLAN Notices
%K programming languages
%V 12
%N 9
%D September 1977
%P 114-123

%A M. Yasumura
%T Evolution of loop statements
%J SIGPLAN Notices
%K programming languages
%V 12
%N 9
%D September 1977
%P 124-129

%A R.A. Fraley
%T On replacing fortran
%J SIGPLAN Notices
%K programming languages
%V 12
%N 9
%D September 1977
%P 130-132

%A R.J. Chevance
%T Design of high level language oriented processors
%J SIGPLAN Notices
%K programming languages
%V 12
%N 10
%D October 1977
%P 10-32

%A S. Leibowitz
%T Interactive computing
%J SIGPLAN Notices
%K programming languages
%V 12
%N 10
%D October 1977
%P 33-36

%A M.E. Majster
%T Limits of the "algebraic" specification of abstract data types
%J SIGPLAN Notices
%K programming languages
%V 12
%N 10
%D October 1977
%P 37-42

%A T. Middleton
%T Specifying program structure through sequence relationships
%J SIGPLAN Notices
%K programming languages
%V 12
%N 10
%D October 1977
%P 43-47

%A J.E. Musinski
%T Lookahead recall error recovery for LALR parsers
%J SIGPLAN Notices
%K programming languages
%V 12
%N 10
%D October 1977
%P 48-60

%A G.J. Myers
%T An extension to the cyclomatic measure of program complexity
%J SIGPLAN Notices
%K programming languages
%V 12
%N 10
%D October 1977
%P 61-64

%A M.D. Shapiro
%T Fortran 77 input-output seems out of touch
%J SIGPLAN Notices
%K programming languages
%V 12
%N 10
%D October 1977
%P 65-69

%A S.M. Silverston
%T A note on pattern matching under quickscan in SNOBOL4
%J SIGPLAN Notices
%K programming languages
%V 12
%N 10
%D October 1977
%P 70-74

%A A. Filipski
%T Call by restricted memory reference
%J SIGPLAN Notices
%K programming languages
%V 12
%N 10
%D October 1977
%P 75-77

%A G.E. Lindamood
%T What's in a name ?
%J SIGPLAN Notices
%K programming languages
%V 12
%N 10
%D October 1977
%P 78-80

%A D. Bates
%A R. Cailliau
%T Experience with Pascal compilers on mini-computers
%J SIGPLAN Notices
%K programming languages
%V 12
%N 11
%D November 1977
%P 10-22

%A M.N. Condict
%T The Pascal dynamic array controversy
and a method for enforcing global assertions
%J SIGPLAN Notices
%K programming languages
%V 12
%N 11
%D November 1977
%P 23-27

%A D.R. Ditzel
%A P.C. Hutchison
%T Mask and format: operators for editing and formatting
%J SIGPLAN Notices
%K programming languages
%V 12
%N 11
%D November 1977
%P 28-35

%A C.H. Lindsay
%T Structure charts - a structured alternative to flowcharts
%J SIGPLAN Notices
%K programming languages
%V 12
%N 11
%D November 1977
%P 36-49

%A T. Radhakrishnan
%A I.A. Syed
%T Towards a programming language for the implementation
of information storage and retrieval systems
%J SIGPLAN Notices
%K programming languages
%V 12
%N 11
%D November 1977
%P 50-54

%A A. Sedgwick
%T Structuring control in fortran
%J SIGPLAN Notices
%K programming languages
%V 12
%N 11
%D November 1977
%P 55-60

%A G.L. Steele
%T Arithmetic shifting considered harmful
%J SIGPLAN Notices
%K programming languages
%V 12
%N 11
%D November 1977
%P 61-69

%A T.R. Wilcox
%T Aspen language specifications
%J SIGPLAN Notices
%K programming languages
%V 12
%N 11
%D November 1977
%P 70-87

%A M. Arisawa
%T Programming languages with hierarchical structure
%J SIGPLAN Notices
%K programming languages
%V 12
%N 12
%D December 1977
%P 36-38

%Q Department of Defense
%T Department of Defense requirements
for high order computer programming languages
- revised "IRONMAN" July, 1977: the technical requirements
%J SIGPLAN Notices
%K programming languages
%V 12
%N 12
%D December 1977
%P 39-54

%A H. Abramson
%T Ordered types and a generalized for statement
%J SIGPLAN Notices
%K programming languages
%V 12
%N 12
%D December 1977
%P 55-59

%A W. Brainerd
%T A proposal for a fortran loop construct
%J SIGPLAN Notices
%K programming languages
%V 12
%N 12
%D December 1977
%P 60-67

%A G. Chroust
%T Scope conserving expression evaluation:
a class of storage optimal evaluation strategies
for arithmetic expressions
%J SIGPLAN Notices
%K programming languages
%V 12
%N 12
%D December 1977
%P 68-72

%A F. Richard
%A H.F. Ledgard
%T A reminder for language designers
%J SIGPLAN Notices
%K programming languages
%V 12
%N 12
%D December 1977
%P 73-82

%A J.L. Peterson
%T On the formatting of Pascal programs
%J SIGPLAN Notices
%K programming languages
%V 12
%N 12
%D December 1977
%P 83-86

%A M.G. Richardson
%T The use of names
to indicate the scope of structured language constructs
%J SIGPLAN Notices
%K programming languages
%V 12
%N 12
%D December 1977
%P 87

%A O. Benediktsson
%T Notes on argument-parameter association in fortran
%J SIGPLAN Notices
%K programming languages
%V 13
%N 1
%D January 1978
%P 16-20

%A D. Brand
%T A note on data abstraction
%J SIGPLAN Notices
%K programming languages
%V 13
%N 1
%D January 1978
%P 21-24

%A O. Cert
%T Parallelism, control and synchronization expression
in a single assignment language
%J SIGPLAN Notices
%K programming languages
%V 13
%N 1
%D January 1978
%P 25-33

%A O. Ferstl
%T Flowcharting by stepwise refinement
%J SIGPLAN Notices
%K programming languages
%V 13
%N 1
%D January 1978
%P 34-42

%A J. Georges
%A F. Heymans
%T On parametric array expressions
%J SIGPLAN Notices
%K programming languages
%V 13
%N 1
%D January 1978
%P 43-47

%A M. Iglewski
%A J. Madley
%A S. Matwin
%T A contribution to an improvement of Pascal
%J SIGPLAN Notices
%K programming languages
%V 13
%N 1
%D January 1978
%P 48-58

%A A.J. Payne
%T A formalised technique for expressing compiler exercises
%J SIGPLAN Notices
%K programming languages
%V 13
%N 1
%D January 1978
%P 59-69

%A D.B. Wortman
%T A rooster of XPL implementation
%J SIGPLAN Notices
%K programming languages
%V 13
%N 1
%D January 1978
%P 70-74

%A Steven M. Bellovin
%T Alphabetical list of authors & permuted "KWIC" index,
SIGPLAN Notices, volume 12
%J SIGPLAN Notices
%K programming languages
%V 13
%N 1
%D January 1978
%P 75-100

%A W.A. Whitaker
%T The U.S. Department of Defense common high order language effort
%J SIGPLAN Notices
%K programming languages
%V 13
%N 2
%D February 1978
%P 19-29

%A J.L. Elshoff
%T An investigation into the effects of the counting method
used on software science measurements
%J SIGPLAN Notices
%K programming languages
%V 13
%N 2
%D February 1978
%P 30-45

%A P. Grouse
%T "Flowblocks" - a technique for structured programming
%J SIGPLAN Notices
%K programming languages
%V 13
%N 2
%D February 1978
%P 46-56

%A G.J. Nutt
%T A comparison of Pascal and fortran
as introductory programming languages
%J SIGPLAN Notices
%K programming languages
%V 13
%N 2
%D February 1978
%P 57-62

%A D.C. Pflasterer
%T An approach to efficient, fault tolerant programming
%J SIGPLAN Notices
%K programming languages
%V 13
%N 2
%D February 1978
%P 63-70

%A D. Wood
%T A bibliography of top-down deterministic parsing
%J SIGPLAN Notices
%K programming languages
%V 13
%N 2
%D February 1978
%P 71-76

%A R.L. Glass
%T Patching is alive and, lamentably, thriving in the real-time world
%J SIGPLAN Notices
%K programming languages
%V 13
%N 3
%D March 1978
%P 25-28

%A W.J. Hansen
%T Measure of program complexity
by the pair (cyclomatic number, operator count)
%J SIGPLAN Notices
%K programming languages
%V 13
%N 3
%D March 1978
%P 29-33

%A E. Chang
%A N.E. Kaden
%A W.D. Elliott
%T Abstract data types in EUCLID
%J SIGPLAN Notices
%K programming languages
%V 13
%N 3
%D March 1978
%P 34-42

%A E.G. Aseltine
%A H. Spencer
%T Isolation of machine dependencies in EUCLID
%J SIGPLAN Notices
%K programming languages
%V 13
%N 3
%D March 1978
%P 43-48

%A J. des Rivieres
%A H. Spencer
%T Readability and writability in EUCLID
%J SIGPLAN Notices
%K programming languages
%V 13
%N 3
%D March 1978
%P 49-56

%A T. Venema
%A J. des Rivieres
%T EUCLID and PASCAL
%J SIGPLAN Notices
%K programming languages
%V 13
%N 3
%D March 1978
%P 57-69

%A D.T. Barnard
%A W.D. Elliott
%A D.H. Thompson
%T EUCLID and MODULA
%J SIGPLAN Notices
%K programming languages
%V 13
%N 3
%D March 1978
%P 70-84

%A W.D. Elliott
%T Index to the EUCLID report
%J SIGPLAN Notices
%K programming languages
%V 13
%N 3
%D March 1978
%P 85-89

%A R.G. Estell
%T A chapter in the history of DOD-1
%J SIGPLAN Notices
%K programming languages
%V 13
%N 3
%D March 1978
%P 90-92

%A F. Baskett
%T The best simple code generation technique
for WHILE, FOR, and DO loops
%J SIGPLAN Notices
%K programming languages
%V 13
%N 4
%D April 1978
%P 31-32

%A J.C. Burda
%T The translation of boolean expressions
into optimal transfer logic code
for the OLIVER data base management system compiler
%J SIGPLAN Notices
%K programming languages
%V 13
%N 4
%D April 1978
%P 33-43

%A R.J. Chevance
%A T. Heidet
%T Static profile and dynamic behavior of COBOL programs
%J SIGPLAN Notices
%K programming languages
%V 13
%N 4
%D April 1978
%P 44-57

%A M.H. Clifton
%T A technique for making structured programs more readable
%J SIGPLAN Notices
%K programming languages
%V 13
%N 4
%D April 1978
%P 58-63

%A D.W. Jones
%T A note on some limits of the algebraic specification method
%J SIGPLAN Notices
%K programming languages
%V 13
%N 4
%D April 1978
%P 64-67

%A T. Jacobsen
%T Another view of coroutines
%J SIGPLAN Notices
%K programming languages
%V 13
%N 4
%D April 1978
%P 68-75

%A W. Slater
%A H. Modell
%T Structured programming considered harmful
%J SIGPLAN Notices
%K programming languages
%V 13
%N 4
%D April 1978
%P 76-79

%A P.A. Subrahmanyam
%T On a finite axiomatization of the data type L
%J SIGPLAN Notices
%K programming languages
%V 13
%N 4
%D April 1978
%P 80-84

%A J.V. Peschke
%T Comment on a paper of R.A. Freiburghouse
%J SIGPLAN Notices
%K programming languages
%V 13
%N 4
%D April 1978
%P 85-88

%A G.J. Battarel
%A R.J. Chevance
%T Requirements for a safe PL/1 implementation
%J SIGPLAN Notices
%K programming languages
%V 13
%N 5
%D May 1978
%P 12-22

%A J. Bezivin
%A J.L. Nebut
%A R. Rannou
%T Another view of coroutines
%J SIGPLAN Notices
%K programming languages
%V 13
%N 5
%D May 1978
%P 23-35

%A N. Chapin
%A S.P. Denniston
%T Characteristics of a structured program
%J SIGPLAN Notices
%K programming languages
%V 13
%N 5
%D May 1978
%P 36-45

%A D.R. Ditzel
%T Pattern matching for high level languages
%J SIGPLAN Notices
%K programming languages
%V 13
%N 5
%D May 1978
%P 46-55

%A M.B. Feldman
%T Embedding sparse matrix operations in SNOBOL4
%J SIGPLAN Notices
%K programming languages
%V 13
%N 5
%D May 1978
%P 56-64

%A R.C. Holt
%A G.S. Graham
%A E.D. Lazowska
%A M.A. Scott
%T Announcing CONCURRENT SP/k
%J SIGPLAN Notices
%K programming languages
%V 13
%N 5
%D May 1978
%P 65-68

%A G.B. Alleman
%T Parameter validation for software reliability
%J SIGPLAN Notices
%K programming languages
%V 13
%N 6
%D June 1978
%P 18-28

%A J.L. Elshoff
%T A study of the structural composition of PL/I programs
%J SIGPLAN Notices
%K programming languages
%V 13
%N 6
%D June 1978
%P 29-37

%A J. Gorski
%T Sticky variables and memory optimisation
%J SIGPLAN Notices
%K programming languages
%V 13
%N 6
%D June 1978
%P 38-48

%A V. Schneider
%T Prediction of software effort and project duration
- four new formulas
%J SIGPLAN Notices
%K programming languages
%V 13
%N 6
%D June 1978
%P 49-59

%A L. Allison
%T On nondeterministic control structures
%J SIGPLAN Notices
%K programming languages
%V 13
%N 7
%D July 1978
%P 18-20

%A E.W. Dijkstra
%T DoD-I : the summing up
%J SIGPLAN Notices
%K programming languages
%V 13
%N 7
%D July 1978
%P 21-26

%A B. Ford
%T Parameterisation of the environment
for transportable numerical software
%J SIGPLAN Notices
%K programming languages
%V 13
%N 7
%D July 1978
%P 27-30

%A B. Lewis
%T Further comments on "A view of coroutines"
%J SIGPLAN Notices
%K programming languages
%V 13
%N 7
%D July 1978
%P 31-33

%A P.R. Mohilner
%T Prettyprinting Pascal programs
%J SIGPLAN Notices
%K programming languages
%V 13
%N 7
%D July 1978
%P 34-40

%A R. Parkin
%T On the use of keywords for passing procedure parameters
%J SIGPLAN Notices
%K programming languages
%V 13
%N 7
%D July 1978
%P 41-42

%A S.W. Postma
%T FEA - a formal english subset for algebra / assertions
%J SIGPLAN Notices
%K programming languages
%V 13
%N 7
%D July 1978
%P 43-59


%A P.W. Abrahams
%T Two programming problems
%J SIGPLAN Notices
%K programming languages
%V 13
%N 9
%D September 1978
%P 28-29

%A R.J. LeBlanc
%T Extensions to Pascal for separate compilation
%J SIGPLAN Notices
%K programming languages
%V 13
%N 9
%D September 1978
%P 30-33

%A W.D. Maurer
%T Register type bits
- a proposal for efficient instruction repertoire extension
%J SIGPLAN Notices
%K programming languages
%V 13
%N 9
%D September 1978
%P 34-35

%A M. Shaw
%A P. Hilfinger
%A W.A. Wulf
%T Tartan - language design for the Ironman requirement:
reference manual
%J SIGPLAN Notices
%K programming languages
%V 13
%N 9
%D September 1978
%P 36-58

%A M. Shaw
%A P. Hilfinger
%A W.A. Wulf
%T Tartan - language design for the Ironman requirement:
notes and examples
%J SIGPLAN Notices
%K programming languages
%V 13
%N 9
%D September 1978
%P 59-75

%A E. Skordalakis
%A G. Papakonstantinou
%T Coroutines in fortran
%J SIGPLAN Notices
%K programming languages
%V 13
%N 9
%D September 1978
%P 76-84

%A J.E. Crider
%T Structured formatting of Pascal programs
%J SIGPLAN Notices
%K programming languages
%V 13
%N 11
%D November 1978
%P 15-22

%A I.B. Elliot
%T Optimization of the compiling of subscripted array references
%J SIGPLAN Notices
%K programming languages
%V 13
%N 11
%D November 1978
%P 23-29

%A T.A. Kovats
%T Program readability, closing keywords
and prefix-style intermediate keywords
%J SIGPLAN Notices
%K programming languages
%V 13
%N 11
%D November 1978
%P 30-42

%A D.C. Pflasterer
%T The CAMIL programming language
%J SIGPLAN Notices
%K programming languages
%V 13
%N 11
%D November 1978
%P 43-55

%A J.E. Sammet
%T Roster of programming languages for 1976-77
%J SIGPLAN Notices
%K programming languages
%V 13
%N 11
%D November 1978
%P 56-85

%A F. Bauer
%A M. Broy
%A R. Gnatz
%A W. Hesse
%A B. Krieg-Bruckner
%A H. Partsch
%A P. Pepper
%A H. Wossner
%T Towards a wide spectrum to support
program specification and program development
%J SIGPLAN Notices
%K programming languages
%V 13
%N 12
%D December 1978
%P 15-24

%A B.D. Chaudhary
%A H.V. Sahasrabuddhe
%T Suggestions about a specification technique
%J SIGPLAN Notices
%K programming languages
%V 13
%N 12
%D December 1978
%P 25-28

%A J.L. Elshoff
%A M. Marcotty
%T On the use of the cyclomatic number to measure program complexity
%J SIGPLAN Notices
%K programming languages
%V 13
%N 12
%D December 1978
%P 29-40

%A P.E. Lauer
%A M.W. Shields
%T Abstract specification of resource accessing disciplines:
adequacy, starvation, priority and interrupts
%J SIGPLAN Notices
%K programming languages
%V 13
%N 12
%D December 1978
%P 41-59

%A P.L. Montgomery
%T Evaluation of boolean expressions on one's complement machines
%J SIGPLAN Notices
%K programming languages
%V 13
%N 12
%D December 1978
%P 60-72

%A R.A. Nelson
%T XL: a language structure
%J SIGPLAN Notices
%K programming languages
%V 13
%N 12
%D December 1978
%P 73-87

%A V. Sinha
%A K. Vinod Kumar
%T Efficient evaluation of boolean expressions
%J SIGPLAN Notices
%K programming languages
%V 13
%N 12
%D December 1978
%P 88-97

%A R.L. Sites
%T Programming tools: statement counts and procedure timings
%J SIGPLAN Notices
%K programming languages
%V 13
%N 12
%D December 1978
%P 98-101

%A P. Wegner
%T Supporting a flourishing language culture
%J SIGPLAN Notices
%K programming languages
%V 13
%N 12
%D December 1978
%P 102-104

%A M. Arisawa
%A M. Iuchi
%T Fortran + preprocessor = Utopia 84
%J SIGPLAN Notices
%K programming languages
%V 14
%N 1
%D January 1979
%P 12-15

%A J. Ciesinger
%T A bibliography of error-handling
%J SIGPLAN Notices
%K programming languages
%V 14
%N 1
%D January 1979
%P 16-26

%A J.G. Hunt
%T Messages in typed languages
%J SIGPLAN Notices
%K programming languages
%V 14
%N 1
%D January 1979
%P 27-45

%A W.R. LaLonde
%T A finite state approach to operator classification
%J SIGPLAN Notices
%K programming languages
%V 14
%N 1
%D January 1979
%P 46-54

%A J.R. Low
%T A short note on scanning signed integers
%J SIGPLAN Notices
%K programming languages
%V 14
%N 1
%D January 1979
%P 55-56

%A J.R. Metzner
%T A graded bibliography on macro systems and extensible languages
%J SIGPLAN Notices
%K programming languages
%V 14
%N 1
%D January 1979
%P 57-68

%A R. Moya
%A I. Ramos
%T SP-Grammars (context-free grammars for structured programming)
%J SIGPLAN Notices
%K programming languages
%V 14
%N 1
%D January 1979
%P 69-76

%A J.M. Sakoda
%T DYSTAL 2: a general purpose extension of fortran
%J SIGPLAN Notices
%K programming languages
%V 14
%N 1
%D January 1979
%P 77-90

%A I. Sommerville
%T S-SNOBOL - structured SNOBOL4
%J SIGPLAN Notices
%K programming languages
%V 14
%N 1
%D January 1979
%P 91-99

%A K-C. Tai
%T On the implementation of parsing tables
%J SIGPLAN Notices
%K programming languages
%V 14
%N 1
%D January 1979
%P 100-101

%A R.C. Backhouse
%A S. Anderson
%T Least cost repair of syntax errors
%J SIGPLAN Notices
%K programming languages
%V 14
%N 1
%D January 1979
%P 102-104

%A R.G. Clark
%T Interactive input in Pascal
%J SIGPLAN Notices
%K programming languages
%V 14
%N 2
%D February 1979
%P 9-13

%A I.B. Elliot
%T DLP, a design language pre-processor
%J SIGPLAN Notices
%K programming languages
%V 14
%N 2
%D February 1979
%P 14-20

%A G.A. Jackson
%T Two-dimensional grammars and structured programming languages
%J SIGPLAN Notices
%K programming languages
%V 14
%N 2
%D February 1979
%P 21-28

%A R. Kling
%A W. Scacchi
%T The DoD common high order programming language effort (Dod-1):
what will the impact be ?
%J SIGPLAN Notices
%K programming languages
%V 14
%N 2
%D February 1979
%P 29-43

%A B.K. Rosen
%T Stickiness and liveness
%J SIGPLAN Notices
%K programming languages
%V 14
%N 2
%D February 1979
%P 44-45

%A V.F. Turchin
%T A supercompiler system based on the language REFAL
%J SIGPLAN Notices
%K programming languages
%V 14
%N 2
%D February 1979
%P 46-54

%A P.A.S. Veloso
%T Traversable stack with fewer errors
%J SIGPLAN Notices
%K programming languages
%V 14
%N 2
%D February 1979
%P 55-59

%A D.A. Watt
%T An extended attribute grammar for Pascal
%J SIGPLAN Notices
%K programming languages
%V 14
%N 2
%D February 1979
%P 60-74

%A T.H. Axford
%A D. Burkhardt
%A W.P. Dodd
%A S. Laflin
%A D.G. Parkyn
%A P. Ramsay
%T ATOL: a simple language with powerful data structuring facilities
%J SIGPLAN Notices
%K programming languages
%V 14
%N 3
%D March 1979
%P 5-15

%A N. Chapin
%T Full report of the flowchart committee on ANSI standard X3.5-1970
%J SIGPLAN Notices
%K programming languages
%V 14
%N 3
%D March 1979
%P 16-27

%A S. Kamin
%T Some definitions for algebraic data type specifications
%J SIGPLAN Notices
%K programming languages
%V 14
%N 3
%D March 1979
%P 28-37

%A L. Lamport
%T A general construction for expressing repetition
%J SIGPLAN Notices
%K programming languages
%V 14
%N 3
%D March 1979
%P 38-42

%A P. Abrahams
%T The map coloring problem
%J SIGPLAN Notices
%K programming languages
%V 14
%N 4
%D April 1979
%P 10-11

%A K. Culik
%T The cyclomatic number and the normal number of programs
%J SIGPLAN Notices
%K programming languages
%V 14
%N 4
%D April 1979
%P 12-17

%A R.E. Griswold
%A D.R. Hanson
%A J.T. Korb
%T The Icon programming language: an overview
%J SIGPLAN Notices
%K programming languages
%V 14
%N 4
%D April 1979
%P 18-31

%A A. Glanc
%T On expressing control and data structures
in predicate logic language ALGOL M
%J SIGPLAN Notices
%K programming languages
%V 14
%N 4
%D April 1979
%P 32-34

%A P. Grogono
%T On layout, identifiers and semicolons in Pascal programs
%J SIGPLAN Notices
%K programming languages
%V 14
%N 4
%D April 1979
%P 35-40

%A R. Newton
%T On exception handling with the "Ironman" languages, green and red
%J SIGPLAN Notices
%K programming languages
%V 14
%N 4
%D April 1979
%P 41-54

%A R. Newton
%T Some exception handling programs in language systems
displaying a multi-path capability
%J SIGPLAN Notices
%K programming languages
%V 14
%N 4
%D April 1979
%P 55-63

%A D. Schulz
%T The Intel fortran-80 compiler for the 8080 and 8085 microprocessors
%J SIGPLAN Notices
%K programming languages
%V 14
%N 4
%D April 1979
%P 64-76

%A S.G. Zabek
%T Decomposition of complex selection criteria
%J SIGPLAN Notices
%K programming languages
%V 14
%N 4
%D April 1979
%P 77-80

%A G. Gini
%A M. Gini
%A R. Gini
%A D. Giuse
%T A multi-task system for robot programming
%J SIGPLAN Notices
%K programming languages
%V 14
%N 5
%D May 1979
%P 11-18

%Q Harris Corporation
%T APL comparison chart
%J SIGPLAN Notices
%K programming languages
%V 14
%N 5
%D May 1979
%P 19-20

%A V. Chinnaswamy
%T Translation of decision tables into computer programs
with the use of Carnaugh maps
%J SIGPLAN Notices
%K programming languages
%V 14
%N 5
%D May 1979
%P 19-23

%A P. Deransart
%T The language LISP does not exist ?
%J SIGPLAN Notices
%K programming languages
%V 14
%N 5
%D May 1979
%P 24-27

%A S. Hanson
%A R. Jullig
%A P. Jackson
%A P. Levy
%A T. Pittman
%T Summary of the characteristics
of several "modern" programming languages
%J SIGPLAN Notices
%K programming languages
%V 14
%N 5
%D May 1979
%P 28-45

%A D. Kapur
%T Specifications of Majster's traversable stack
and Veloso's traversable stack
%J SIGPLAN Notices
%K programming languages
%V 14
%N 5
%D May 1979
%P 46-53

%A R.K. Smart
%T Micro extensible programming language
%J SIGPLAN Notices
%K programming languages
%V 14
%N 5
%D May 1979
%P 54-61

%T Preliminary ADA reference manual
%J SIGPLAN Notices
%K programming languages
%V 14
%N 6
%D June 1979

%T Rationale for the design of the ADA programming language
%J SIGPLAN Notices
%K programming languages
%V 14
%N 6
%D June 1979

%A B.T. Denvir
%T On orthogonality in programming languages
%J SIGPLAN Notices
%K programming languages
%V 14
%N 7
%D July 1979
%P 18-30

%A H. Fosdick
%T High-level languages for operating systems development
- a historical overview
%J SIGPLAN Notices
%K programming languages
%V 14
%N 7
%D July 1979
%P 31-37

%A D. Grune
%T Some statistics on ALGOL 68 programs
%J SIGPLAN Notices
%K programming languages
%V 14
%N 7
%D July 1979
%P 38-46
%K Algol68

%A M.A. Hennell
%T The role of procedural parameters in high order languages
%J SIGPLAN Notices
%K programming languages
%V 14
%N 7
%D July 1979
%P 47-50

%A B.J. MacLennan
%T Observations on the differences between formulas and sentences
and their application to programming language design
%J SIGPLAN Notices
%K programming languages
%V 14
%N 7
%D July 1979
%P 51-61

%A A.D. McGettrick
%T Aspects of the ALGOL 68 mode structure
%J SIGPLAN Notices
%K programming languages
%V 14
%N 7
%D July 1979
%P 62-77
%K Algol68

%A F. Orejas
%T On the power of conditional specifications
%J SIGPLAN Notices
%K programming languages
%V 14
%N 7
%D July 1979
%P 78-81

%A N. Prakash
%A Y.K. Sharma
%T An integrated data base language
%J SIGPLAN Notices
%K programming languages
%V 14
%N 7
%D July 1979
%P 82-96


%A P. Abrahams
%T The PL/1 standard: an apostate's view
%J SIGPLAN Notices
%K programming languages
%V 14
%N 9
%D September 1979
%P 15-16
%K pl/1

%A J.E. Ball
%A J.R. Low
%A G.J. Williams
%T Preliminary ZENO language description
%J SIGPLAN Notices
%K programming languages
%V 14
%N 9
%D September 1979
%P 17-34

%A D.M. Berry
%A R.L. Schwartz
%T Type equivalence in strongly typed languages: one more look
%J SIGPLAN Notices
%K programming languages
%V 14
%N 9
%D September 1979
%P 35-41

%A G.G. Gustafson
%T Some practical experiences formatting Pascal programs
%J SIGPLAN Notices
%K programming languages
%V 14
%N 9
%D September 1979
%P 42-49

%A D.C. Pflasterer
%T Application of a remote code generator
%J SIGPLAN Notices
%K programming languages
%V 14
%N 9
%D September 1979
%P 50-58

%A S.T. Redwine
%T Using COBOL macroprocessing for reliable parameter passing
%J SIGPLAN Notices
%K programming languages
%V 14
%N 9
%D September 1979
%P 59-60

%A A. Sale
%T SCOPE and PASCAL
%J SIGPLAN Notices
%K programming languages
%V 14
%N 9
%D September 1979
%P 61-63

%A J.F. Shoch
%T An overview of the programming language Smalltalk-72
%J SIGPLAN Notices
%K programming languages
%V 14
%N 9
%D September 1979
%P 64-73

%A J. Ramsdell
%T Prettyprinting structured programs with connector lines
%J SIGPLAN Notices
%K programming languages
%V 14
%N 9
%D September 1979
%P 74-75

%A B. Wallace
%T More on interactive input in Pascal
%J SIGPLAN Notices
%K programming languages
%V 14
%N 9
%D September 1979
%P 76

%Q HOLWG
%T Ada test and evaluation newsletter
%J SIGPLAN Notices
%K programming languages
%V 14
%N 9
%D September 1979
%P 77-80

%A S. Cohen
%T The A-table data-type for LISP systems
%J SIGPLAN Notices
%K programming languages
%V 14
%N 10
%D October 1979
%P 36-47

%A J. Marti
%A A.C. Hearn
%A M.L. Griss
%A C. Griss
%T Standard LISP report
%J SIGPLAN Notices
%K programming languages
%V 14
%N 10
%D October 1979
%P 48-68

%A E. Schonberg
%T Hierarchical design and efficient implementation in SETL:
a case study
%J SIGPLAN Notices
%K programming languages
%V 14
%N 10
%D October 1979
%P 69-74

%A T. Teitelbaum
%T The Cornell program synthesizer:
a syntax-directed programming environment
%J SIGPLAN Notices
%K programming languages
%V 14
%N 10
%D October 1979
%P 75

%A P.A.S. Veloso
%T Traversable stack with fewer errors: addenda and corrigenda
%J SIGPLAN Notices
%K programming languages
%V 14
%N 10
%D October 1979
%P 76

%A R. Barnes
%T A working definition of the proposed extensions
for PL/1 real-time applications
%J SIGPLAN Notices
%K programming languages
%V 14
%N 10
%D October 1979
%P 77-99
%K pl/1

%A J.A. Bergstra
%A J.V. Tucker
%T On the adequacy of finite equational methods
for data type specification
%J SIGPLAN Notices
%K programming languages
%V 14
%N 11
%D November 1979
%P 13-18

%A C. Crowley
%A G. Klimowicz
%T A note on procedure timing
%J SIGPLAN Notices
%K programming languages
%V 14
%N 11
%D November 1979
%P 19-22

%A D. Feign
%T A note on loop "optimization"
%J SIGPLAN Notices
%K programming languages
%V 14
%N 11
%D November 1979
%P 23-25

%A G.A. Fisher
%A M. Weber
%T LALR(1) parsing for languages without reserved words
%J SIGPLAN Notices
%K programming languages
%V 14
%N 11
%D November 1979
%P 26-30

%A D.M. Dungan
%T Bibliography on data types
%J SIGPLAN Notices
%K programming languages
%V 14
%N 11
%D November 1979
%P 31-59

%A R.F. Keller
%T On selective and repetitive constructs
%J SIGPLAN Notices
%K programming languages
%V 14
%N 11
%D November 1979
%P 60-63

%A J.W. Laski
%T An approach to loop programs debugging
%J SIGPLAN Notices
%K programming languages
%V 14
%N 11
%D November 1979
%P 64-72

%A J.W. Laski
%T On readability of programs with loops
%J SIGPLAN Notices
%K programming languages
%V 14
%N 11
%D November 1979
%P 73-83

%A J.M. Nead
%T On the semantics of control variables
%J SIGPLAN Notices
%K programming languages
%V 14
%N 11
%D November 1979
%P 84-96

%A C. Runciman
%T Scarcely variabled programming and Pascal
%J SIGPLAN Notices
%K programming languages
%V 14
%N 11
%D November 1979
%P 97-106

%A A. Salvadori
%A C. Dumont
%T Some inconsistencies in programming language implementation
%J SIGPLAN Notices
%K programming languages
%V 14
%N 11
%D November 1979
%P 107-109

%A B. Srinivasan
%A V. Gopalakrishna
%T Control flow complexity and structuredness of programs
%J SIGPLAN Notices
%K programming languages
%V 14
%N 11
%D November 1979
%P 110-115

%A T.A. Zoethout
%A E.I.N. Stein
%T Why the goto is harmful
%J SIGPLAN Notices
%K programming languages
%V 14
%N 11
%D November 1979
%P 116-122

%A P. Wegner
%T Programming with ADA: an introduction by means of graduated examples
%J SIGPLAN Notices
%K programming languages
%V 14
%N 12
%D December 1979
%P 1-46

%A R. Bond
%T Another note on PASCAL indentation
%J SIGPLAN Notices
%K programming languages
%V 14
%N 12
%D December 1979
%P 47-49

%A A.C. Hearn
%A A.C. Norman
%T A one-pass prettyprinter
%J SIGPLAN Notices
%K programming languages
%V 14
%N 12
%D December 1979
%P 50-58

%A C. Bron
%A E.J. Dijkstra
%T A discipline for the programming of interactive I/O in PASCAL
%J SIGPLAN Notices
%K programming languages
%V 14
%N 12
%D December 1979
%P 59-61
%K i/o

%A N.L. Soong
%T An overview of an organized industrial
research and development activity for language and language processors
%J SIGPLAN Notices
%K programming languages
%V 14
%N 12
%D December 1979
%P 62-63

%A H.C. Gyllstrom
%A R.C. Knippel
%A L.C. Ragland
%A K.E. Spackman
%T The universal compiling system
%J SIGPLAN Notices
%K programming languages
%V 14
%N 12
%D December 1979
%P 64-70

%A H.C. Heacox
%T RDL: a language for software development
%J SIGPLAN Notices
%K programming languages
%V 14
%N 12
%D December 1979
%P 71-79

%A S.R. Greenwood
%T MACRO: a programming language
%J SIGPLAN Notices
%K programming languages
%V 14
%N 12
%D December 1979
%P 80-91

%A T.N. Turba
%T General syntax analyser (GSA)
%J SIGPLAN Notices
%K programming languages
%V 14
%N 12
%D December 1979
%P 92-109

%A J.J. Hart
%T The advanced interactive debugging system (AIDS)
%J SIGPLAN Notices
%K programming languages
%V 14
%N 12
%D December 1979
%P 110-121

%A W.F. Rohde
%T Language tools for data access ... past, present and future
%J SIGPLAN Notices
%K programming languages
%V 14
%N 12
%D December 1979
%P 122-141

%A J. Beidler
%A J. Meinke
%T An intermediate level dynamic storage capability
%J SIGPLAN Notices
%K programming languages
%V 15
%N 1
%D January 1980
%P 24-33

%A R.J. Cichelli
%T Pascal-L - interactive, conversational Pascal-S
%J SIGPLAN Notices
%K programming languages
%V 15
%N 1
%D January 1980
%P 34-44

%A K. Culik
%T What is a flowchart loop and about structured programming
%J SIGPLAN Notices
%K programming languages
%V 15
%N 1
%D January 1980
%P 45-57

%A J. Gannon
%T Testing traversable stacks
%J SIGPLAN Notices
%K programming languages
%V 15
%N 1
%D January 1980
%P 58-65

%A D.R. Kaye
%T Interactive Pascal input
%J SIGPLAN Notices
%K programming languages
%V 15
%N 1
%D January 1980
%P 66-68

%A W.P. LaPlant
%T The UNIMAC lexical analyzer
%J SIGPLAN Notices
%K programming languages
%V 15
%N 1
%D January 1980
%P 69-76

%A J.W. Laski
%T A hierarchical approach to program testing
%J SIGPLAN Notices
%K programming languages
%V 15
%N 1
%D January 1980
%P 77-85

%A C.D.S. Moss
%T Structured programming with LOOP statements
%J SIGPLAN Notices
%K programming languages
%V 15
%N 1
%D January 1980
%P 86-94

%A R. Schoenberger
%T Resource management in PORTAL
%J SIGPLAN Notices
%K programming languages
%V 15
%N 1
%D January 1980
%P 95-102

%A S.A. Sutton
%T An algorithm for user interaction
%J SIGPLAN Notices
%K programming languages
%V 15
%N 1
%D January 1980
%P 103-104

%A R.N. Taylor
%T Assertions in programming languages
%J SIGPLAN Notices
%K programming languages
%V 15
%N 1
%D January 1980
%P 105-114

%A B.K. Rosen
%T How practical is POPL ?
%J SIGPLAN Notices
%K programming languages
%V 15
%N 1
%D January 1980
%P 115-116

%A R.M. Firestone
%T An experimental LISP system for the Sperry Univac 1100 series
%J SIGPLAN Notices
%K programming languages
%V 15
%N 1
%D January 1980
%P 117-129

%A M.A. Major
%T A language for network analysis and definition
%J SIGPLAN Notices
%K programming languages
%V 15
%N 1
%D January 1980
%P 130-138

%A F.P. Mehrlich
%A S.M. Tanner
%T Portability - high level language implementation
%J SIGPLAN Notices
%K programming languages
%V 15
%N 1
%D January 1980
%P 139-145

%A F.W. Stodola
%T The PLUS programming language
%J SIGPLAN Notices
%K programming languages
%V 15
%N 1
%D January 1980
%P 146-155

%A T.G. Weidner
%T CHAMIL, a case study in microprogramming language design
%J SIGPLAN Notices
%K programming languages
%V 15
%N 1
%D January 1980
%P 156-166

%A H.G. Baker
%T A source of redundant identifiers in PASCAL programs
%J SIGPLAN Notices
%K programming languages
%V 15
%N 2
%D February 1980
%P 14-16

%A R.T. Boute
%T Simplifying Ada by removing limitations
%J SIGPLAN Notices
%K programming languages
%V 15
%N 2
%D February 1980
%P 17-29

%A H. Ganzinger
%A K. Ripken
%T Operator identification in Ada:
formal specification, complexity, and concrete implementation
%J SIGPLAN Notices
%K programming languages
%V 15
%N 2
%D February 1980
%P 30-42

%A D.C. Ince
%T An interpretative implementation of limited entry decision tables
in Algol 68
%J SIGPLAN Notices
%K programming languages
%V 15
%N 2
%D February 1980
%P 43-45
%K Algol68

%A J. Kral
%T Parkinson programming
%J SIGPLAN Notices
%K programming languages
%V 15
%N 2
%D February 1980
%P 46-50

%A G. Lee
%A T. Boreham
%A B. Minns
%A F. Smith
%A R. Soderstrom
%T FORTRAN programming standards
%J SIGPLAN Notices
%K programming languages
%V 15
%N 2
%D February 1980
%P 51-63

%A A. Silberschlatz
%A R.B. Kieburtz
%T The external consistency of abstract data types
%J SIGPLAN Notices
%K programming languages
%V 15
%N 2
%D February 1980
%P 64-73

%A M. Weber
%A S.L. Bernstein
%T Global register allocation for non-equivalent register sets
%J SIGPLAN Notices
%K programming languages
%V 15
%N 2
%D February 1980
%P 74-81

%A L. Zucconi
%T A comment on "Control flow complexity and structuredness of programs"
by Scrinivasan and Gopalakrishna
%J SIGPLAN Notices
%K programming languages
%V 15
%N 2
%D February 1980
%P 82-84

%A B. Anderson
%T Type syntax in the language "C":
an object lesson in syntactic innovation
%J SIGPLAN Notices
%K programming languages
%V 15
%N 3
%D March 1980
%P 21-27

%A H.A. Klaeren
%T An abstract software specification technique
based on structural recursion
%J SIGPLAN Notices
%K programming languages
%V 15
%N 3
%D March 1980
%P 28-34

%A K. Raiha
%T Bibliography on attribute grammars
%J SIGPLAN Notices
%K programming languages
%V 15
%N 3
%D March 1980
%P 35-44

%A M. Shaw
%A W.A. Wulf
%T Toward relaxing assumptions in languages and their implementations
%J SIGPLAN Notices
%K programming languages
%V 15
%N 3
%D March 1980
%P 45-61

%A A.M. Addyman
%T A draft proposal for PASCAL
%J SIGPLAN Notices
%K programming languages
%V 15
%N 4
%D April 1980
%P 1-66

%A A.M. Addyman
%T PASCAL standardisation
%J SIGPLAN Notices
%K programming languages
%V 15
%N 4
%D April 1980
%P 67-69

%A N.H. Cohen
%T GODEL NUMBERS: a new approach to structured programming
%J SIGPLAN Notices
%K programming languages
%V 15
%N 4
%D April 1980
%P 70-74

%A D. Harel
%T "do considered od" considered odder than "do considered ob"
%J SIGPLAN Notices
%K programming languages
%V 15
%N 4
%D April 1980
%P 75

%A B.A. Hetrick
%A H.E. Nberg
%T Confinement of a class of harmful effects of the goto statement
%J SIGPLAN Notices
%K programming languages
%V 15
%N 4
%D April 1980
%P 76-78

%A R. Schild
%A H. Lienhard
%T Real-time programming in PORTAL
%J SIGPLAN Notices
%K programming languages
%V 15
%N 4
%D April 1980
%P 79-82

%A R.J. Cichelli
%T Fixing PASCAL's I/O
%J SIGPLAN Notices
%K programming languages
%V 15
%N 5
%D May 1980
%P 19

%A C. Crowley
%T Structured programming is reductionistic !
%J SIGPLAN Notices
%K programming languages
%V 15
%N 5
%D May 1980
%P 20-23

%A J.R. Ellis
%T A LISP shell
%J SIGPLAN Notices
%K programming languages
%V 15
%N 5
%D May 1980
%P 24-34

%A R. Firth
%T Universal Ada language issue report construction kit
%J SIGPLAN Notices
%K programming languages
%V 15
%N 5
%D May 1980
%P 35-36

%A D.W. Jones
%T Tasking and parameters: a problem area in Ada
%J SIGPLAN Notices
%K programming languages
%V 15
%N 5
%D May 1980
%P 37-40

%A D.W. Leinbaugh
%T Indenting for the compiler
%J SIGPLAN Notices
%K programming languages
%V 15
%N 5
%D May 1980
%P 41-48

%A J. Levine
%T Why a lisp-based command language ?
%J SIGPLAN Notices
%K programming languages
%V 15
%N 5
%D May 1980
%P 49-53

%A S. Ljungkvist
%T Pascal and existing fortran files
%J SIGPLAN Notices
%K programming languages
%V 15
%N 5
%D May 1980
%P 54-55

%A T. Noodt
%A D. Belsnes
%T A simple extension of Pascal for quasi-parallel processing
%J SIGPLAN Notices
%K programming languages
%V 15
%N 5
%D May 1980
%P 56-65

%A P. Wegner
%T Conference report: Seventh Annual ACM Symposium
on the Principles of Programming Languages
%J SIGPLAN Notices
%K programming languages
%V 15
%N 5
%D May 1980
%P 66-77

%A J. Van Zandt
%T On visual and textual structures
%J SIGPLAN Notices
%K programming languages
%V 15
%N 5
%D May 1980
%P 78-80

%A J.T. Galkowski
%T A critique of the DOD common language effort
%J SIGPLAN Notices
%K programming languages
%V 15
%N 6
%D June 1980
%P 15-18

%A D.W.E. Blatt
%T On the great big substitution problem
%J SIGPLAN Notices
%K programming languages
%V 15
%N 6
%D June 1980
%P 19-27

%A F.T. Bradshaw
%A G.W. Ernst
%A R.J. Hookway
%A W.F. Ogden
%T Procedure semantics and language definition
%J SIGPLAN Notices
%K programming languages
%V 15
%N 6
%D June 1980
%P 28-33

%A V.S. Foster
%T Performance measurement of a Pascal compiler
%J SIGPLAN Notices
%K programming languages
%V 15
%N 6
%D June 1980
%P 34-38

%A A. Mahjoub
%T A new Modula compiler for the LSI-11
%J SIGPLAN Notices
%K programming languages
%V 15
%N 6
%D June 1980
%P 39-45

%A M. McNeil
%A W. Tracz
%T PL/1 program efficiency
%J SIGPLAN Notices
%K programming languages
%V 15
%N 6
%D June 1980
%P 46-60

%A B. Meek
%T Serial attitudes, parallel attitudes
%J SIGPLAN Notices
%K programming languages
%V 15
%N 6
%D June 1980
%P 61-63

%A A. Moitra
%T A note on algebraic specification of binary trees
%J SIGPLAN Notices
%K programming languages
%V 15
%N 6
%D June 1980
%P 64-67

%A J.K. Reid
%T Functions for manipulating floating-point numbers
%J SIGPLAN Notices
%K programming languages
%V 15
%N 6
%D June 1980
%P 68-76

%A J. van den Bos
%T Comments on ADA process communication
%J SIGPLAN Notices
%K programming languages
%V 15
%N 6
%D June 1980
%P 77-81

%A K.M. Chandy
%A J. Misra
%T A simple model of distributed programs
based on implementation-hiding and process autonomy
%J SIGPLAN Notices
%K programming languages
%V 15
%N 7/8
%D July/August 1980
%P 26-35

%A F. DeRemer
%A T. Pennello
%A R. Meyers
%T A syntax diagram for (preliminary) Ada
%J SIGPLAN Notices
%K programming languages
%V 15
%N 7/8
%D July/August 1980
%P 36-47

%A R.L. Glass
%T The "Project which failed" which succeeded
%J SIGPLAN Notices
%K programming languages
%V 15
%N 7/8
%D July/August 1980
%P 48-51

%A D.C. Ince
%A M. Keynes
%T Paged input/output in some high level languages
%J SIGPLAN Notices
%K programming languages
%V 15
%N 7/8
%D July/August 1980
%P 52-57

%A M. Jackel
%T A formatting parser for PASCAL programs
%J SIGPLAN Notices
%K programming languages
%V 15
%N 7/8
%D July/August 1980
%P 58-63

%A R. Nicolescu
%T Some short comments on the definition and the documentation
of the Ada programming language
%J SIGPLAN Notices
%K programming languages
%V 15
%N 7/8
%D July/August 1980
%P 64-71

%A F.G. Pagan
%T Nested sublanguages of ALGOL 68 for teaching purposes
%J SIGPLAN Notices
%K programming languages
%V 15
%N 7/8
%D July/August 1980
%P 72-81
%K Algol68

%A T. Pennello
%A F. DeRemer
%A R. Meyers
%T A simplified operator identification scheme for Ada
%J SIGPLAN Notices
%K programming languages
%V 15
%N 7/8
%D July/August 1980
%P 82-87

%A R. Smart
%T Pointers to local variables
%J SIGPLAN Notices
%K programming languages
%V 15
%N 7/8
%D July/August 1980
%P 88-89

%A R.H. Campbell
%A R.B. Kolstad
%T An overview of Path Pascal's design
%J SIGPLAN Notices
%K programming languages
%V 15
%N 9
%D September 1980
%P 13-14

%A R.H. Campbell
%A R.B. Kolstad
%T Path Pascal user manual
%J SIGPLAN Notices
%K programming languages
%V 15
%N 9
%D September 1980
%P 15-24

%A A. Chiarini
%T On FP languages combining forms
%J SIGPLAN Notices
%K programming languages
%V 15
%N 9
%D September 1980
%P 25-27

%A W.P. Dodd
%T Some comments on a recent article by Salvadori and Dumont
regarding the evaluation of compound conditional expressions
%J SIGPLAN Notices
%K programming languages
%V 15
%N 9
%D September 1980
%P 28-31

%A S. Hanata
%A T. Satch
%T COMPACT CHART - a program logic notation
with high describability and understandability
%J SIGPLAN Notices
%K programming languages
%V 15
%N 9
%D September 1980
%P 32-38

%A J.M. Janas
%T A comment on "Operator identification in ADA"
%J SIGPLAN Notices
%K programming languages
%V 15
%N 9
%D September 1980
%P 39-43

%A J.A. Sharp
%T Data oriented program design
%J SIGPLAN Notices
%K programming languages
%V 15
%N 9
%D September 1980
%P 44-57

%A M.N. Yucel
%A B. Pinar
%T Bit processing with FORTRAN
%J SIGPLAN Notices
%K programming languages
%V 15
%N 9
%D September 1980
%P 58-60

%A T. Takaoka
%T Introduction of history to variables
%J SIGPLAN Notices
%K programming languages
%V 15
%N 9
%D September 1980
%P 61-63

%A M.M. Tanil
%T Two experiments on a program complexity perception by programmers
%J SIGPLAN Notices
%K programming languages
%V 15
%N 9
%D September 1980
%P 64-66

%A E. Ashcroft
%A B. Wadge
%T Some common misconceptions about LUCID
%J SIGPLAN Notices
%K programming languages
%V 15
%N 10
%D October 1980
%P 15-26

%A R.F. Brender
%T The case against Ada as an APSE command language
%J SIGPLAN Notices
%K programming languages
%V 15
%N 10
%D October 1980
%P 27-34

%A J.F. Gimpel
%T CONTOUR - a method of preparing structured flowcharts
%J SIGPLAN Notices
%K programming languages
%V 15
%N 10
%D October 1980
%P 35-41

%A M.A. Gobin
%T File handling in programming languages
%J SIGPLAN Notices
%K programming languages
%V 15
%N 10
%D October 1980
%P 42-47

%A J.B. Goodenough
%T Ada (July 1980) syntax cross reference listing
%J SIGPLAN Notices
%K programming languages
%V 15
%N 10
%D October 1980
%P 48-56

%A H.F. Ledgard
%T A human engineered variant of BNF
%J SIGPLAN Notices
%K programming languages
%V 15
%N 10
%D October 1980
%P 57-62

%A D.V. Moffat
%T Categorized PASCAL bibliography (June 1980)
%J SIGPLAN Notices
%K programming languages
%V 15
%N 10
%D October 1980
%P 63-75

%A K. Tai
%A K. Garrard
%T Comments on the suggested implementation of tasking facilities
in the "Rationale for the design of the ADA programming language"
%J SIGPLAN Notices
%K programming languages
%V 15
%N 10
%D October 1980
%P 76-84

%A A. Yehudai
%T Automatic indentation versus program formatting
%J SIGPLAN Notices
%K programming languages
%V 15
%N 10
%D October 1980
%P 85-87


%A L. Baxter
%T The versatility of PROLOG
%J SIGPLAN Notices
%K programming languages
%V 15
%N 12
%D December 1980
%P 15-16

%A J.N. Buxton
%T An informal bibliography on programming support environments
%J SIGPLAN Notices
%K programming languages
%V 15
%N 12
%D December 1980
%P 17-30

%A J.C. Cleaveland
%T Mathematical specifications
%J SIGPLAN Notices
%K programming languages
%V 15
%N 12
%D December 1980
%P 31-42

%A L. Johnson
%T do considered reflectively: a contribution to group programming
%J SIGPLAN Notices
%K programming languages
%V 15
%N 12
%D December 1980
%P 43

%A L. Johnson
%T do considered obviously odd in three dimensions
%J SIGPLAN Notices
%K programming languages
%V 15
%N 12
%D December 1980
%P 44

%A K.L. Pentzlin
%T A syntax for character and string constants
supplying user-defined character codes
%J SIGPLAN Notices
%K programming languages
%V 15
%N 12
%D December 1980
%P 45-52

%A A. Sale
%T Counterview in favour of strict type compatibility
%J SIGPLAN Notices
%K programming languages
%V 15
%N 12
%D December 1980
%P 53-55

%A P.L.J. Siero
%T APL & Algol68, the correspondence & the differences,
especially in applications to graph-analysis
%J SIGPLAN Notices
%K programming languages
%V 15
%N 12
%D December 1980
%P 56-61

%A J. Stroet
%T An alternative to the communication primitives in Ada
%J SIGPLAN Notices
%K programming languages
%V 15
%N 12
%D December 1980
%P 62-74

%A A.G. Sumpter
%A G.E. Quick
%T Concurrency specification in high level languages
%J SIGPLAN Notices
%K programming languages
%V 15
%N 12
%D December 1980
%P 75-81

%A N.M. Taylor
%T Protection of proprietary software
%J SIGPLAN Notices
%K programming languages
%V 15
%N 12
%D December 1980
%P 82-84

%A J.S. Tutleman
%T Handling large, complex and variable job-control streams
using a procedure invocation package ('PIP') and a pseudo-library
%J SIGPLAN Notices
%K programming languages
%V 15
%N 12
%D December 1980
%P 85-91

%A N.R. Wasner
%T A FORTRAN preprocessor for the large program environment
%J SIGPLAN Notices
%K programming languages
%V 15
%N 12
%D December 1980
%P 92-103


%A R. Ashworth
%T Prettyprinting for power
%J SIGPLAN Notices
%K programming languages
%V 16
%N 2
%D February 1981
%P 16-17

%A S.K. Bandyopadhyay
%T A study on program level dependency of implemented algorithms
on its potential operands
%J SIGPLAN Notices
%K programming languages
%V 16
%N 2
%D February 1981
%P 18-25

%A S.K. Bandyopadhyay
%T Theoretical relationships between potential operands &
basic measurable properties of algorithm structure
%J SIGPLAN Notices
%K programming languages
%V 16
%N 2
%D February 1981
%P 26-34

%A S. Haridi
%A J. Bauner
%A G. Svensson
%T An implementation and empirical evaluation
of the tasking facilities in Ada - summary
%J SIGPLAN Notices
%K programming languages
%V 16
%N 2
%D February 1981
%P 35-47

%A G.V. Cormack
%T An algorithm for the selection of overloaded functions in Ada
%J SIGPLAN Notices
%K programming languages
%V 16
%N 2
%D February 1981
%P 48-52

%A S.C. Dewhurst
%T An equivalence result for temporal logic
%J SIGPLAN Notices
%K programming languages
%V 16
%N 2
%D February 1981
%P 53-55

%A P. Rutter
%T Using a high level language as a cross assembler
%J SIGPLAN Notices
%K programming languages
%V 16
%N 2
%D February 1981
%P 56-58

%A D.R. Hanson
%T The Y programming language
%J SIGPLAN Notices
%K programming languages
%V 16
%N 2
%D February 1981
%P 59-68

%A D.M. Jones
%T Introduction to SQURL
%J SIGPLAN Notices
%K programming languages
%V 16
%N 2
%D February 1981
%P 69-76

%A D.V. Moffat
%T Enumerations in Pascal, Ada, and beyond
%J SIGPLAN Notices
%K programming languages
%V 16
%N 2
%D February 1981
%P 77-82

%A P.W. Magee
%T Improving the cobol CALLed and calling program interface
with a pre-processor
or CALL statements are harmful but can be controlled
%J SIGPLAN Notices
%K programming languages
%V 16
%N 2
%D February 1981
%P 83-88

%A A. Mahjoub
%T Some comments on Ada as a real-time programming language
%J SIGPLAN Notices
%K programming languages
%V 16
%N 2
%D February 1981
%P 89-95

%A A. Silberschatz
%T On the synchronization mechanism of the Ada language
%J SIGPLAN Notices
%K programming languages
%V 16
%N 2
%D February 1981
%P 96-103

%A W.A. Whitaker
%T Summary of the Ada implementor's meeting, December 1980
%J SIGPLAN Notices
%K programming languages
%V 16
%N 2
%D February 1981
%P 104-109

%A W.A. Whitaker
%T Comments on portions of the ACM Sigplan Conference on the
Ada Programming Language not available in the proceedings
%J SIGPLAN Notices
%K programming languages
%V 16
%N 2
%D February 1981
%P 110-112

%A W.D. Young
%A D.I. Good
%T Steelman and the verifiability of (preliminary) Ada
%J SIGPLAN Notices
%K programming languages
%V 16
%N 2
%D February 1981
%P 113-119

%A J.A. Zimmer
%T A control form for complex iterations
%J SIGPLAN Notices
%K programming languages
%V 16
%N 2
%D February 1981
%P 120-131

%A R.M. Bates
%T A Pascal prettyprinter with a different purpose
%J SIGPLAN Notices
%K programming languages
%V 16
%N 3
%D March 1981
%P 10-17

%A S.N. Cole
%T Ada syntax cross reference
%J SIGPLAN Notices
%K programming languages
%V 16
%N 3
%D March 1981
%P 18-47

%A T.M. Dailey
%T A procedure invocation syntax for enhanced readability
%J SIGPLAN Notices
%K programming languages
%V 16
%N 3
%D March 1981
%P 48-52

%A A.L. Furtado
%A P.A.S. Veloso
%T Procedural specifications and implementations for abstract data types
%J SIGPLAN Notices
%K programming languages
%V 16
%N 3
%D March 1981
%P 53-62

%A W.A. Harrison
%A K.I. Magel
%T A complexity measure based on nesting level
%J SIGPLAN Notices
%K programming languages
%V 16
%N 3
%D March 1981
%P 63-74

%A B. Mengarini
%T Macro facilities in Ada
%J SIGPLAN Notices
%K programming languages
%V 16
%N 3
%D March 1981
%P 75-81

%A F. Orejas
%T Even more on advice on structuring compilers
and proving them correct: changing an arrow
%J SIGPLAN Notices
%K programming languages
%V 16
%N 3
%D March 1981
%P 82-84

%A G. Persch
%A G. Winterstein
%A S. Drossopoulou
%A M. Dausmann
%T An LALR(1) grammar for revised Ada
%J SIGPLAN Notices
%K programming languages
%V 16
%N 3
%D March 1981
%P 85-98

%A D. Shu
%T POPL conference report
%J SIGPLAN Notices
%K programming languages
%V 16
%N 3
%D March 1981
%P 99-101

%A A.R. Tripathi
%A W.D. Young
%A D.I. Good
%A J.C. Browne
%T HAL/S/V: a verifiable subset for HAL/S
%J SIGPLAN Notices
%K programming languages
%V 16
%N 3
%D March 1981
%P 102-113

%A D.R. Barach
%A F.N. Webb
%T The symbol table representation of types in the Prophet system
%J SIGPLAN Notices
%K programming languages
%V 16
%N 4
%D April 1981
%P 17-26

%A J.A. Bergstra
%A J.J.C. Meyer
%T I/O computable data structures
%J SIGPLAN Notices
%K programming languages
%V 16
%N 4
%D April 1981
%P 27-32

%A C. Crowley
%T A finite state machine for western swing
%J SIGPLAN Notices
%K programming languages
%V 16
%N 4
%D April 1981
%P 33-35

%A J.R. Falcone
%T A vector programming language
%J SIGPLAN Notices
%K programming languages
%V 16
%N 4
%D April 1981
%P 36-50

%A W. Harrison
%A K. Magel
%T A topological analysis of the complexity of computer programs
with less than three binary branches
%J SIGPLAN Notices
%K programming languages
%V 16
%N 4
%D April 1981
%P 51-63

%A J.G. Hunt
%T Bracketing programme constructs
%J SIGPLAN Notices
%K programming languages
%V 16
%N 4
%D April 1981
%P 64-67

%A H.I. Kylov
%T Structured programs in PL/I
%J SIGPLAN Notices
%K programming languages
%V 16
%N 4
%D April 1981
%P 68-69

%A D. Marca
%T Some Pascal style guidelines
%J SIGPLAN Notices
%K programming languages
%V 16
%N 4
%D April 1981
%P 70-80

%A H. Perkins
%T Lazy I/O is not the answer
%J SIGPLAN Notices
%K programming languages
%V 16
%N 4
%D April 1981
%P 81-88

%A M.M. Tanik
%T Prediction models for cyclomatic complexity
%J SIGPLAN Notices
%K programming languages
%V 16
%N 4
%D April 1981
%P 89-97

%A A.H.J. Sale
%T Proposal for extension to Pascal
%J SIGPLAN Notices
%K programming languages
%V 16
%N 4
%D April 1981
%P 98-103

%A J.R. Wolberg
%T Comparing the cost of software conversion to the cost of programming
%J SIGPLAN Notices
%K programming languages
%V 16
%N 4
%D April 1981
%P 104-110

%A M.L. Cook
%A M.G. Arnold
%T A structured APL preprocessor
%J SIGPLAN Notices
%K programming languages
%V 16
%N 5
%D May 1981
%P 22-31

%A M. Levy
%T Meeting on Melpomenes
- story used to introduce the theory of data types
%J SIGPLAN Notices
%K programming languages
%V 16
%N 5
%D May 1981
%P 32-35

%A S.T. Redwine
%T A paradigm for dealing with exceptions
%J SIGPLAN Notices
%K programming languages
%V 16
%N 5
%D May 1981
%P 36-38

%A J.L. Remy
%A P.A.S. Veloso
%T An economical method for comparing data type specifications
%J SIGPLAN Notices
%K programming languages
%V 16
%N 5
%D May 1981
%P 39-42

%A M. Sassa
%T A poor man's realization of recursive structured fortran
%J SIGPLAN Notices
%K programming languages
%V 16
%N 5
%D May 1981
%P 43-53

%A S.L. Stepoway
%A A. Silberschatz
%T An extension to the language-based access-control mechanism
of Jones and Liskov
%J SIGPLAN Notices
%K programming languages
%V 16
%N 5
%D May 1981
%P 54-58

%A A.I. Wasserman
%A D.D. Sheretz
%A M.L. Kersten
%A R.P. van de Riet
%A M.D. Dippe
%T Revised report on the programming language PLAIN
%J SIGPLAN Notices
%K programming languages
%V 16
%N 5
%D May 1981
%P 59-80

%A J.A. Goguen
%A J. Meseguer
%T Completeness of many-sorted equational logic
%J SIGPLAN Notices
%K programming languages
%V 16
%N 7
%D July 1981
%P 24-32

%A G.H. Gonnet
%T Coding benchmarking for Utopia 84
%J SIGPLAN Notices
%K programming languages
%V 16
%N 7
%D July 1981
%P 33-34

%A C.L. Hankin
%A H.W. Glaser
%T The data flow programming language CAJOLE - an informal introduction
%J SIGPLAN Notices
%K programming languages
%V 16
%N 7
%D July 1981
%P 35-44

%A W. Kneis
%T Draft standard, industrial real-time fortran
definition of procedures for the application of fortran
for the control of industrial processes
%J SIGPLAN Notices
%K programming languages
%V 16
%N 7
%D July 1981
%P 45-60
%O Proposed by the Technical Committee 1

%A K. Magel
%T Regular expressions in a program complexity metric
%J SIGPLAN Notices
%K programming languages
%V 16
%N 7
%D July 1981
%P 61-65

%A D.V. Moffat
%T A model for Pascal-like typing
%J SIGPLAN Notices
%K programming languages
%V 16
%N 7
%D July 1981
%P 66-74

%A R.H. Perrott
%A D.K. Stevenson
%T Users' experiences with the ILLIAC IV system
and its programming languages
%J SIGPLAN Notices
%K programming languages
%V 16
%N 7
%D July 1981
%P 75-88

%A A. Silberschatz
%T A note on the distributed program component cell
%J SIGPLAN Notices
%K programming languages
%V 16
%N 7
%D July 1981
%P 89-96

%A C. Burgess
%A L. James
%T An indexed bibliography for LR grammars and parsers
%J SIGPLAN Notices
%K programming languages
%V 16
%N 8
%D August 1981
%P 14-26

%A A.J. Payne
%T A basis for software physics ?
%J SIGPLAN Notices
%K programming languages
%V 16
%N 8
%D August 1981
%P 27-30

%A C. Rapin
%A J. Menu
%T The Newton language
%J SIGPLAN Notices
%K programming languages
%V 16
%N 8
%D August 1981
%P 31-40

%A B.N. Schilit
%T A solution to the great big substitution problem:
subject modification during pattern matching in SNOBOL4
%J SIGPLAN Notices
%K programming languages
%V 16
%N 8
%D August 1981
%P 41-49

%A E. Shapiro
%A G. Collins
%A L. Johnson
%A J. Ruttenberg
%T PASES: a programming environment for PASCAL
%J SIGPLAN Notices
%K programming languages
%V 16
%N 8
%D August 1981
%P 50-57

%A D. Spector
%T Full LR(1) parser generation
%J SIGPLAN Notices
%K programming languages
%V 16
%N 8
%D August 1981
%P 58-66

%A P. van der Linden
%A L.K. Nicholson
%T Macro facilities in the Ada environment
%J SIGPLAN Notices
%K programming languages
%V 16
%N 8
%D August 1981
%P 67-68

%A J.F.H. Winkler
%T Differences between preliminary and final Ada
%J SIGPLAN Notices
%K programming languages
%V 16
%N 8
%D August 1981
%P 69-81

%A R. Bonet
%A A. Kung
%A K. Ripken
%A R.K. Yates
%A M. Sommer
%A J. Winkler
%T Ada syntax diagrams for top-down analysis
%J SIGPLAN Notices
%K programming languages
%V 16
%N 9
%D September 1981
%P 29-41

%A G. Booch
%T Describing software design for Ada
%J SIGPLAN Notices
%K programming languages
%V 16
%N 9
%D September 1981
%P 42-47

%A F. DeRemer
%A T. Pennello
%A W.M. McKeeman
%T Ada syntax chart
%J SIGPLAN Notices
%K programming languages
%V 16
%N 9
%D September 1981
%P 48-59

%A A.H. Konstam
%T A method for controlling parallelism in programming languages
%J SIGPLAN Notices
%K programming languages
%V 16
%N 9
%D September 1981
%P 60-65

%A P.E. Lauer
%T Synchronization of concurrent processes without globality assumptions
%J SIGPLAN Notices
%K programming languages
%V 16
%N 9
%D September 1981
%P 66-80

%A D.A. Rowland
%T An extension to Pascal read and write procedures
%J SIGPLAN Notices
%K programming languages
%V 16
%N 9
%D September 1981
%P 81-82

%A C. Shimon
%T Simplicity = efficiency = readability
a simple infix to prefix algorithm
%J SIGPLAN Notices
%K programming languages
%V 16
%N 9
%D September 1981
%P 83-89

%A C.S. Wetherell
%T Problems with the Ada reference grammar
%J SIGPLAN Notices
%K programming languages
%V 16
%N 9
%D September 1981
%P 90-104

%A M. Ganapathi
%A C.N. Fischer
%T Bibliography on automated retargetable code generation
%J SIGPLAN Notices
%K programming languages
%V 16
%N 10
%D October 1981
%P 9-12

%A D.A. Gustafson
%T Control flow, data flow & data independence
%J SIGPLAN Notices
%K programming languages
%V 16
%N 10
%D October 1981
%P 13-19

%A B. Liskov
%T Report on the workshop on fundamental issues in distributed computing
%J SIGPLAN Notices
%K programming languages
%V 16
%N 10
%D October 1981
%P 20-49

%A B. Maher
%A D.H. Sleeman
%T A data driven system for syntactic transformations
%J SIGPLAN Notices
%K programming languages
%V 16
%N 10
%D October 1981
%P 50-52

%A J.A. Malcolm
%T Brevity and clarity in command languages
%J SIGPLAN Notices
%K programming languages
%V 16
%N 10
%D October 1981
%P 53-59

%A W.D. Maurer
%T An alternate characterization of preorder, inorder, and postorder
%J SIGPLAN Notices
%K programming languages
%V 16
%N 10
%D October 1981
%P 60-61

%A K.T. Narayana
%A M. Clint
%T On the formal treatment of a permutation finding program
%J SIGPLAN Notices
%K programming languages
%V 16
%N 10
%D October 1981
%P 62-73

%A R.D. Jenks
%A B.M. Trager
%T A language for computational algebra
%J SIGPLAN Notices
%K programming languages
%V 16
%N 11
%D November 1981
%P 22-29

%A A.J.W. Mayer
%T Value receiving procedures
%J SIGPLAN Notices
%K programming languages
%V 16
%N 11
%D November 1981
%P 30-34

%A J.F.H. Winkler
%T Differences between preliminary and final Ada
%J SIGPLAN Notices
%K programming languages
%V 16
%N 11
%D November 1981
%P 35-48

%A D.C. Ince
%T The implementation of file structures in some high level languages
%J SIGPLAN Notices
%K programming languages
%V 16
%N 11
%D November 1981
%P 49-55

%A D.G. Elliott
%T Fortran 77 and structured design
%J SIGPLAN Notices
%K programming languages
%V 16
%N 12
%D December 1981
%P 7-9

%A A.H. Morris
%T Can Ada replace fortran for numerical computation ?
%J SIGPLAN Notices
%K programming languages
%V 16
%N 12
%D December 1981
%P 10-13

%A P.A. Fitzhorn
%A G.R. Johnson
%T C: toward a concise syntactic description
%J SIGPLAN Notices
%K programming languages
%V 16
%N 12
%D December 1981
%P 14-21

%A M. Ben-Ari
%A A. Yehudai
%T A methodology for modular use of Ada
%J SIGPLAN Notices
%K programming languages
%V 16
%N 12
%D December 1981
%P 22-26

%A M. Van Deusen
%T Types in red
%J SIGPLAN Notices
%K programming languages
%V 16
%N 12
%D December 1981
%P 27-38

%A J.A. Goguen
%A J. Meseguer
%T Completeness of many-sorted equational logic
%P 9-17

%A G. Booch
%T Naming subprograms with clarity
%J SIGPLAN Notices
%K programming languages
%V 17
%N 1
%D January 1982
%P 18-22

%A D.F. Dixon
%T A Pascal compiler testing facility
%J SIGPLAN Notices
%K programming languages
%V 17
%N 1
%D January 1982
%P 23-26

%A J.W. Laski
%T Application of the goal invariant to the structuring of programs
%J SIGPLAN Notices
%K programming languages
%V 17
%N 1
%D January 1982
%P 27-36

%A H. Kilov
%T Guidelines for writing PL/I programs
%J SIGPLAN Notices
%K programming languages
%V 17
%N 1
%D January 1982
%P 37-39

%A A. Bykat
%T An extension to Pascal input-output procedures
%J SIGPLAN Notices
%K programming languages
%V 17
%N 1
%D January 1982
%P 40-41

%A B. Stroustrup
%T Classes: an abstract data type facility for the C language
%J SIGPLAN Notices
%K programming languages
%V 17
%N 1
%D January 1982
%P 42-52

%A K.C. Tai
%T Comments on parameter passing techniques in programming languages
%J SIGPLAN Notices
%K programming languages
%V 17
%N 2
%D February 1982
%P 24-27

%A W.H. Jessop
%T Ada packages and distributed systems
%J SIGPLAN Notices
%K programming languages
%V 17
%N 2
%D February 1982
%P 28-36

%A W.H. Jessop
%T Ada packages and distributed systems
%J SIGPLAN Notices
%K programming languages
%V 17
%N 2
%D February 1982
%P 28-36

%A R.W. Topor
%T A note on error recovery in recursive descent parsers
%J SIGPLAN Notices
%K programming languages
%V 17
%N 2
%D February 1982
%P 37-40

%A G. Ford
%A B. Hansche
%T Optional, repeatable and varying type parameters
%J SIGPLAN Notices
%K programming languages
%V 17
%N 2
%D February 1982
%P 41-48

%A T.M. Roberts
%T More on bit processing with fortran
%J SIGPLAN Notices
%K programming languages
%V 17
%N 2
%D February 1982
%P 49-52

%A M.S. Johnson
%T A software debugging glossary
%J SIGPLAN Notices
%K programming languages
%V 17
%N 2
%D February 1982
%P 53-70

%A K. Magel
%T A theory of small program complexity
%J SIGPLAN Notices
%K programming languages
%V 17
%N 3
%D March 1982
%P 37-45

%A R. Morrison
%T The string as a simple data type
%J SIGPLAN Notices
%K programming languages
%V 17
%N 3
%D March 1982
%P 46-52

%A C.E. Prael
%T Pascal for operating software ? a critical examination
%J SIGPLAN Notices
%K programming languages
%V 17
%N 3
%D March 1982
%P 53-57

%A N.F. Salt
%T Defining software science counting strategies
%J SIGPLAN Notices
%K programming languages
%V 17
%N 3
%D March 1982
%P 58-67

%A R.S. Scowen
%T A standard syntactic metalanguage
%J SIGPLAN Notices
%K programming languages
%V 17
%N 3
%D March 1982
%P 68-73

%A R.S. Scowen
%A Z. Ciechanowicz
%T Seven sorts of programs
%J SIGPLAN Notices
%K programming languages
%V 17
%N 3
%D March 1982
%P 74-79

%A D. Spector
%T Minimal overhead garbage collection of complex list structure
%J SIGPLAN Notices
%K programming languages
%V 17
%N 3
%D March 1982
%P 80-82

%A P. van den Bosch
%T The translation of programming languages
through the use of a graph transformation language
%J SIGPLAN Notices
%K programming languages
%V 17
%N 3
%D March 1982
%P 83-92

%A P. van\ der\ Linden
%T Ambiguity and orthogonality in Ada
%J SIGPLAN Notices
%K programming languages
%V 17
%N 3
%D March 1982
%P 93-94


%A E.W. Dijkstra
%T How do we tell truths that might hurt ?
%J SIGPLAN Notices
%K programming languages
%V 17
%N 5
%D May 1982
%P 13-15

%A D.R. Barach
%A D.H. Taenzer
%A R.E. Wells
%T A technique for finding storage allocation errors
in C language programs
%J SIGPLAN Notices
%K programming languages
%V 17
%N 5
%D May 1982
%P 16-23

%A M. Ancona
%A G. Dodero
%A V. Gianuzzi
%T Building collections of LR(k) items
with partial expansion of lookahead strings
%J SIGPLAN Notices
%K programming languages
%V 17
%N 5
%D May 1982
%P 24-28

%A M. Guazzo
%T APL finds its APLOMB
%J SIGPLAN Notices
%K programming languages
%V 17
%N 5
%D May 1982
%P 29-37

%A M.E. Kranc
%T A separate compilation facility for Pascal
%J SIGPLAN Notices
%K programming languages
%V 17
%N 5
%D May 1982
%P 38-46

%A G. Greiter
%T A data type theory
%J SIGPLAN Notices
%K programming languages
%V 17
%N 5
%D May 1982
%P 47-53

%A B. Carter
%T On choosing identifiers
%J SIGPLAN Notices
%K programming languages
%V 17
%N 5
%D May 1982
%P 54-59

%A R.C. Holt
%T A short introduction to Concurrent Euclid
%J SIGPLAN Notices
%K programming languages
%V 17
%N 5
%D May 1982
%P 60-79

%A N.T. Thanh
%A E.W. Raschner
%T Indirect threaded code used to emulate a virtual machine
%J SIGPLAN Notices
%K programming languages
%V 17
%N 5
%D May 1982
%P 80-89

%A H.K. Seyfer
%T Compiler test sets
%J SIGPLAN Notices
%K programming languages
%V 17
%N 5
%D May 1982
%P 90-97

%A A. Richardly
%T The theory of output-free computation
%J SIGPLAN Notices
%K programming languages
%V 17
%N 5
%D May 1982
%P 98


%A M. Atkinson
%A K. Chisholm
%A P. Cockshott
%T PS-algol: an Algol with a persistent heap
%J SIGPLAN Notices
%K programming languages
%V 17
%N 7
%D July 1982
%P 24-31

%A D.R. Barach
%A D.H. Tanzer
%A R.E. Wells
%T A technique for finding storage allocation errors
in C language programs
%J SIGPLAN Notices
%K programming languages
%V 17
%N 7
%D July 1982
%P 32-38

%A R.C. Waters
%T Program editors should not abandon text oriented commands
%J SIGPLAN Notices
%K programming languages
%V 17
%N 7
%D July 1982
%P 39-46

%A J.C.H. Park
%T A new LALR formalism
%J SIGPLAN Notices
%K programming languages
%V 17
%N 7
%D July 1982
%P 47-61

%A D.M. Harland
%A H.I.E. Gunn
%T Another look at enumerated types
%J SIGPLAN Notices
%K programming languages
%V 17
%N 7
%D July 1982
%P 62-71

%A H.M. Gladney
%T How to print with style
%J SIGPLAN Notices
%K programming languages
%V 17
%N 7
%D July 1982
%P 72-79

%A R. Fischer
%T A note on goto-less programming in APL using the unquote operator
%J SIGPLAN Notices
%K programming languages
%V 17
%N 7
%D July 1982
%P 80-87

%A M. Lesk
%T English for decision tables considered harmful
%J SIGPLAN Notices
%K programming languages
%V 17
%N 7
%D July 1982
%P 88

%A M.D. de\ Jong
%A C.L. Hankin
%T Structured data flow programming
%J SIGPLAN Notices
%K programming languages
%V 17
%N 8
%D August 1982
%P 18-27

%A M. McCraig
%T Towards a novel string processing language
%J SIGPLAN Notices
%K programming languages
%V 17
%N 8
%D August 1982
%P 28-33

%A G. Early
%T Functional programming and the two-pass assembler
%J SIGPLAN Notices
%K programming languages
%V 17
%N 8
%D August 1982
%P 34-42

%A D. Spector
%T Ambiguities and insecurities in Modula-2
%J SIGPLAN Notices
%K programming languages
%V 17
%N 8
%D August 1982
%P 43-51

%A G.P. Hill
%T An improvement over deeply nested if-then-else control structures
%J SIGPLAN Notices
%K programming languages
%V 17
%N 8
%D August 1982
%P 52-56

%A K. Culik
%T An advanced programming language definition
and domain correctness of programs
%J SIGPLAN Notices
%K programming languages
%V 17
%N 8
%D August 1982
%P 57-66

%A M.A. Jones
%T A comparison of LISP specifications
of function definition and argument handling
%J SIGPLAN Notices
%K programming languages
%V 17
%N 8
%D August 1982
%P 67-73

%A M.O. Jokinen
%T The effect of parameter passing
and other implementation dependent mechanisms is undecidable
%J SIGPLAN Notices
%K programming languages
%V 17
%N 9
%D September 1982
%P 16-17

%A C.R. Cook
%T A letter oriented minimal perfect hashing function
%J SIGPLAN Notices
%K programming languages
%V 17
%N 9
%D September 1982
%P 18-27

%A R.T. Sumner
%A R.E. Gleaves
%T Modula-2 - a solution to Pascal's problems
%J SIGPLAN Notices
%K programming languages
%V 17
%N 9
%D September 1982
%P 28-33

%A W.W. Wilson
%T Beyond Prolog: software specification by grammar
%J SIGPLAN Notices
%K programming languages
%V 17
%N 9
%D September 1982
%P 34-43

%A P. Piwowarski
%T A nesting level complexity measure
%J SIGPLAN Notices
%K programming languages
%V 17
%N 9
%D September 1982
%P 44-50

%A T. Rentsch
%T Object oriented programming
%J SIGPLAN Notices
%K programming languages
%V 17
%N 9
%D September 1982
%P 51-57

%A G. Greiter
%T Remarks on language concepts for specifying process synchronization
%J SIGPLAN Notices
%K programming languages
%V 17
%N 9
%D September 1982
%P 58-61

%A J. Laski
%T On data flow guided program testing
%J SIGPLAN Notices
%K programming languages
%V 17
%N 9
%D September 1982
%P 62-71

%A D. Marca
%T A repetition construct for Unix version 6
%J SIGPLAN Notices
%K programming languages
%V 17
%N 9
%D September 1982
%P 72-75

%A P.D. Stotts
%T A comparative survey of concurrent programming languages
%J SIGPLAN Notices
%K programming languages
%V 17
%N 9
%D September 1982
%P 76-87

%A R.G. Stone
%T Points recurring: the history of a railway problem
%J SIGPLAN Notices
%K programming languages
%V 17
%N 9
%D September 1982
%P 88-94

%A M.K. Crowe
%T An incremental compiler
%J SIGPLAN Notices
%K programming languages
%V 17
%N 10
%D October 1982
%P 13-22

%A K. Magel
%T A report on a Pascal questionaire
%J SIGPLAN Notices
%K programming languages
%V 17
%N 10
%D October 1982
%P 23-32

%A M.J. Rees
%T Automatic assessment aids for Pascal programs
%J SIGPLAN Notices
%K programming languages
%V 17
%N 10
%D October 1982
%P 33-42

%A B.J. MacLennan
%T A simple, natural notation for applicative languages
%J SIGPLAN Notices
%K programming languages
%V 17
%N 10
%D October 1982
%P 43-49

%A P.D. Stotts
%T A comparative survey of concurrent programming languages
%J SIGPLAN Notices
%K programming languages
%V 17
%N 10
%D October 1982
%P 50-61

%A H. Meijer
%A A. Nijholt
%T Translator writing tools since 1970: a selective bibliography
%J SIGPLAN Notices
%K programming languages
%V 17
%N 10
%D October 1982
%P 62-72

%A F.E.J. Kruseman Aretz
%T Syntax diagrams for ISO Pascal standard
%J SIGPLAN Notices
%K programming languages
%V 17
%N 10
%D October 1982
%P 73-78

%A P.D. Gootherts
%A J.W. Davis
%T Common programming language ambiguity
%J SIGPLAN Notices
%K programming languages
%V 17
%N 11
%D November 1982
%P 7-10

%A K.L. Pentzlin
%T Syntax of comments: discussion and a proposal
%J SIGPLAN Notices
%K programming languages
%V 17
%N 11
%D November 1982
%P 11-313

%A K. Karlsson
%A K. Petersson
%T Notes from: the Aspenas Symposium
on Functional Languages and Computer Architecture
%J SIGPLAN Notices
%K programming languages
%V 17
%N 11
%D November 1982
%P 14-23

%A S.G. Duff
%T The case for BUFFERS in SNOBOL4
%J SIGPLAN Notices
%K programming languages
%V 17
%N 11
%D November 1982
%P 24-30

%A L.J. Groves
%T Using simple English sentences to call procedures
%J SIGPLAN Notices
%K programming languages
%V 17
%N 11
%D November 1982
%P 31-38

%A E.B. Levy
%T The case against Pascal as a teaching tool
%J SIGPLAN Notices
%K programming languages
%V 17
%N 11
%D November 1982
%P 39-41

%A A.J. Payne
%T A basis for the rate of change in programs
%J SIGPLAN Notices
%K programming languages
%V 17
%N 11
%D November 1982
%P 42-44

%A E. Cohen
%T Text-oriented structure commands for structure editors
%J SIGPLAN Notices
%K programming languages
%V 17
%N 11
%D November 1982
%P 45-49

%A Y. Litvin
%T Parallel evolution programming language for data flow machines
%J SIGPLAN Notices
%K programming languages
%V 17
%N 11
%D November 1982
%P 50-58

%A D.E. Boddy
%T A style for structured APL
%J SIGPLAN Notices
%K programming languages
%V 17
%N 12
%D December 1982
%P 27-30

%A R. Cailliau
%T How to avoid getting SCHLONKED by Pascal
%J SIGPLAN Notices
%K programming languages
%V 17
%N 12
%D December 1982
%P 31-40

%A R.P. Corbett
%T Enhanced arithmetic for fortran
%J SIGPLAN Notices
%K programming languages
%V 17
%N 12
%D December 1982
%P 41-48

%A L. Geurts
%T An overview of the B programming language
%J SIGPLAN Notices
%K programming languages
%V 17
%N 12
%D December 1982
%P 49-58

%A H.M. Gladney
%T A note on enumerations
%J SIGPLAN Notices
%K programming languages
%V 17
%N 12
%D December 1982
%P 59-64

%A D.M. Harland
%T Subtypes versus cell constancy with subrange constraints
%J SIGPLAN Notices
%K programming languages
%V 17
%N 12
%D December 1982
%P 65-69

%A B.J. MacLennan
%T Values and objects in programming languages
%J SIGPLAN Notices
%K programming languages
%V 17
%N 12
%D December 1982
%P 70-79

%A M.J. Wise
%T EPILOG = PROLOG + data flow:
arguments for combining PROLOG with data driven mechanism
%J SIGPLAN Notices
%K programming languages
%V 17
%N 12
%D December 1982
%P 80-86

%A J. Celko
%A J.S. Davis
%A J. Mitchell
%T A demonstration of three requirements language systems
%J SIGPLAN Notices
%K programming languages
%V 18
%N 1
%D January 1983
%P 9-14

%A B.J. Cox
%T The object oriented pre-compiler
%J SIGPLAN Notices
%K programming languages
%V 18
%N 1
%D January 1983
%P 15-22

%A K. Culik
%T On formal and informal proofs for program correctness
%J SIGPLAN Notices
%K programming languages
%V 18
%N 1
%D January 1983
%P 23-28

%A D.R. Olsen
%T A subset algorithm for deterministic FSMs within deterministic PDAs
%J SIGPLAN Notices
%K programming languages
%V 18
%N 1
%D January 1983
%P 29-34

%A U. Shani
%T Should program editors not abandon text oriented commands?
%J SIGPLAN Notices
%K programming languages
%V 18
%N 1
%D January 1983
%P 35-41

%A D. Spector
%T The simplest functional programming language
%J SIGPLAN Notices
%K programming languages
%V 18
%N 1
%D January 1983
%P 42-46

%A A. Ambler
%A R. Trawick
%T Chatin's graph coloring algorithm
as a method for assigning positions to Diana attributes
%J SIGPLAN Notices
%K programming languages
%V 18
%N 2
%D February 1983
%P 37-38

%A H.W. Barz
%T Implementing semaphores by binary semaphores
%J SIGPLAN Notices
%K programming languages
%V 18
%N 2
%D February 1983
%P 39-45

%A D.M. Berry
%T A new methodology for generating test cases
for a programming language compiler
%J SIGPLAN Notices
%K programming languages
%V 18
%N 2
%D February 1983
%P 46-56

%A F.D. Boswell
%A M.J. Carmody
%A T.R. Grove
%T A string extension for Pascal
%J SIGPLAN Notices
%K programming languages
%V 18
%N 2
%D February 1983
%P 57-61

%A R. Finkel
%T Run-time print values
%J SIGPLAN Notices
%K programming languages
%V 18
%N 2
%D February 1983
%P 62-64

%A M. Jackel
%T Context sensitive formatting
%J SIGPLAN Notices
%K programming languages
%V 18
%N 2
%D February 1983
%P 65-68

%A E.M.J.C. van Oost
%T DUIF: a data-oriented flowchart environment
%J SIGPLAN Notices
%K programming languages
%V 18
%N 2
%D February 1983
%P 69-75

%A Harlan K. Seyfer
%T A bibliography on compiler assessment
%J SIGPLAN Notices
%K programming languages
%V 18
%N 3
%D March 1983
%P 14-21

%A G. Cantone
%A A. Cimile
%A L. Sansone
%T Complexity in program schemes: the characteristic polynomial
%J SIGPLAN Notices
%K programming languages
%V 18
%N 3
%D March 1983
%P 22-31

%A E.H. den\ Hertog
%A H.J.C. Gerbscheid
%A M.L. Kersten
%T Do-select reconsidered
%J SIGPLAN Notices
%K programming languages
%V 18
%N 3
%D March 1983
%P 32-35

%A B.J. MacLennan
%T Overview of relational programming
%J SIGPLAN Notices
%K programming languages
%V 18
%N 3
%D March 1983
%P 36-45

%A D. Vermaak
%T PROGEN: a programming environment
%J SIGPLAN Notices
%K programming languages
%V 18
%N 3
%D March 1983
%P 46-47

%A S. Boyd
%T Modular C
%J SIGPLAN Notices
%K programming languages
%V 18
%N 4
%D April 1983
%P 45-54

%A E. Fehr
%T The "Simplest functional programming language"
is neither simple nor functional
%J SIGPLAN Notices
%K programming languages
%V 18
%N 4
%D April 1983
%P 55-57

%A R. Francis
%T Containment defines a class of recursive data structures
%J SIGPLAN Notices
%K programming languages
%V 18
%N 4
%D April 1983
%P 58-64

%A N. Hardy
%T Nested scopes in Pascal and ALGOL 68
%J SIGPLAN Notices
%K programming languages
%V 18
%N 4
%D April 1983
%P 65

%A A. Laut
%T An algebraic specification of Pascal's file type
%J SIGPLAN Notices
%K programming languages
%V 18
%N 4
%D April 1983
%P 66-68

%A D. May
%T OCCAM
%J SIGPLAN Notices
%K programming languages
%V 18
%N 4
%D April 1983
%P 69-79

%A K.L. Pentzlin
%T Discussion of statement labels:
proposal of a "transfer/junction" construct as alternative to "goto"
%J SIGPLAN Notices
%K programming languages
%V 18
%N 4
%D April 1983
%P 80-81

%A F. Teixeira de\ Queiroz
%T The next control structure that I need
%J SIGPLAN Notices
%K programming languages
%V 18
%N 4
%D April 1983
%P 82-85

%A H.E. Tompkins
%T In defense of teaching structured COBOL as computer science
(or, notes on being sage struck)
%J SIGPLAN Notices
%K programming languages
%V 18
%N 4
%D April 1983
%P 86-94

%A S. Antoy
%A G. Dettori
%T Is Pascal suitable for GKS?
%J SIGPLAN Notices
%K programming languages
%V 18
%N 5
%D May 1983
%P 11-14

%A D.E. Boddy
%T Implementing data abstractions and monitors in UCSD Pascal
%J SIGPLAN Notices
%K programming languages
%V 18
%N 5
%D May 1983
%P 15-24

%A J. Harle
%T The proposed standard for Basic
%J SIGPLAN Notices
%K programming languages
%V 18
%N 5
%D May 1983
%P 25-40

%A A. Lakhotia
%T An improvement over
"An improvement over deeply nested if-then-else control structure"
%J SIGPLAN Notices
%K programming languages
%V 18
%N 5
%D May 1983
%P 41-43

%A P. Machanick
%T A note on C.S. Wetherell's "Problems with the Ada reference grammar"
%J SIGPLAN Notices
%K programming languages
%V 18
%N 5
%D May 1983
%P 44-45

%A R.A. O'Keefe
%T Prolog compared with LISP ?
%J SIGPLAN Notices
%K programming languages
%V 18
%N 5
%D May 1983
%P 46-56

%A M.L. Scott
%T Messages vs. remote procedures is a false dichotomy
%J SIGPLAN Notices
%K programming languages
%V 18
%N 5
%D May 1983
%P 57-62


%A J. Calmet
%A R-M. di\ Scala
%T Pascal as host language of computer algebra systems
%J SIGPLAN Notices
%K programming languages
%V 18
%N 7
%D July 1983
%P 15-24

%A H. Feldmann
%T Acceptive grammars
%J SIGPLAN Notices
%K programming languages
%V 18
%N 7
%D July 1983
%P 25-44

%A G. Greiter
%T Comparing two definitions for the notion "data type"
%J SIGPLAN Notices
%K programming languages
%V 18
%N 7
%D July 1983
%P 45-49

%A K. Guntheroth
%T The new ANSI Basic standard
%J SIGPLAN Notices
%K programming languages
%V 18
%N 7
%D July 1983
%P 50-59

%A S. Gutfreund
%T Tracing offensive values from exceptions
%J SIGPLAN Notices
%K programming languages
%V 18
%N 7
%D July 1983
%P 60-61

%A E.G. Nilges
%T On bugs and swarms - towards a sociobiology of programming ?
%J SIGPLAN Notices
%K programming languages
%V 18
%N 7
%D July 1983
%P 62-64

%A I. Takuchi
%A H. Okuno
%A N. Ohsato
%T TAO - a harmonic mean of Lisp, Prolog and Smalltalk
%J SIGPLAN Notices
%K programming languages
%V 18
%N 7
%D July 1983
%P 65-74

%A J.R. Thompson
%T The use and abuse of formal proofs
%J SIGPLAN Notices
%K programming languages
%V 18
%N 7
%D July 1983
%P 75-79


%A R.J. Casimir
%T Collections of variables
%J SIGPLAN Notices
%K programming languages
%V 18
%N 9
%D September 1983
%P 26-30

%A D.C. Ince
%T A compatibility software tool
for use with separately compiled languages
%J SIGPLAN Notices
%K programming languages
%V 18
%N 9
%D September 1983
%P 31-34

%A F. Jalili
%T A general linear-time evaluator for attribute grammars
%J SIGPLAN Notices
%K programming languages
%V 18
%N 9
%D September 1983
%P 35-44

%A B.A.E. Meekings
%T Style analysis of Pascal programs
%J SIGPLAN Notices
%K programming languages
%V 18
%N 9
%D September 1983
%P 45-54

%A H. Mulders
%T Some observations on the in- and output in high-level languages
%J SIGPLAN Notices
%K programming languages
%V 18
%N 9
%D September 1983
%P 55-58

%A D. Spector
%T Language features to support reusability
%J SIGPLAN Notices
%K programming languages
%V 18
%N 9
%D September 1983
%P 59-61

%A J.J. Tamine
%T On the use of tree-like structures to simplify measures of complexity
%J SIGPLAN Notices
%K programming languages
%V 18
%N 9
%D September 1983
%P 62-69

%A C.K. Yuen
%T The programmer as navigator
%J SIGPLAN Notices
%K programming languages
%V 18
%N 9
%D September 1983
%P 70-78

%A K.S. Bhaskar
%T How object-oriented is your system ?
%J SIGPLAN Notices
%K programming languages
%V 18
%N 10
%D October 1983
%P 8-11
%K catfiles

%A J. van\ Katwijk
%T A preprocessor for YACC, or
a poor man's approach to parsing attributed grammars
%J SIGPLAN Notices
%K programming languages
%V 18
%N 10
%D October 1983
%P 12-15

%A Edward Reid
%T Fighting the disease: more comments after Dijkstra and Tomkins
%J SIGPLAN Notices
%K programming languages
%V 18
%N 10
%D October 1983
%P 16-21

%A Michael H. Rosenbloom
%T Deeply nested IF-THEN-ELSE's
%J SIGPLAN Notices
%K programming languages
%V 18
%N 10
%D October 1983
%P 22-24

%A David Spector
%T Lexing and parsing Modula-2
%J SIGPLAN Notices
%K programming languages
%V 18
%N 10
%D October 1983
%P 25-32

%A David Taylor
%T An improvement to the 'if-then-else' and 'select' clauses,
and some comments on Arun Lakhotias' "An improvement over ..."
%J SIGPLAN Notices
%K programming languages
%V 18
%N 10
%D October 1983
%P 33-37

%A R.D. Tennent
%T An alternative to conformant-array parameters in Psacl
%J SIGPLAN Notices
%K programming languages
%V 18
%N 10
%D October 1983
%P 38-43

%A Joseph B. Weinman,\ Jr.
%T Nestable bracketed comments
%J SIGPLAN Notices
%K programming languages
%V 18
%N 10
%D October 1983
%P 44-47

%A Frederick C. Chow
%A Mahadevan Ganapathi
%T Intermediate languages in compiler construction - a bibliography
%J SIGPLAN Notices
%K programming languages
%V 18
%N 11
%D November 1983
%P 21-23

%A A. Burns
%T Enhanced input/output on Pascal
%J SIGPLAN Notices
%K programming languages
%V 18
%N 11
%D November 1983
%P 24-33

%A S. Ceri
%A S. Crespi-Reghizzi
%T Relational data bases in the design of program construction systems
%J SIGPLAN Notices
%K programming languages
%V 18
%N 11
%D November 1983
%P 34-44

%A Jason Gait
%T Command level software tools
%J SIGPLAN Notices
%K programming languages
%V 18
%N 11
%D November 1983
%P 45-53
%K Bourne shell

%A Rainer Woitok
%T Abstracting linked data structures using incremental records
%J SIGPLAN Notices
%K programming languages
%V 18
%N 11
%D November 1983
%P 54-63

%A E.J. Brown
%T On the application of Rothon diagrams to data abstraction
%J SIGPLAN Notices
%K programming languages
%V 18
%N 12
%D December 1983
%P 17-24

%A J.R. Comer
%T An experimental natural-language processor
for generating data type specifications
%J SIGPLAN Notices
%K programming languages
%V 18
%N 12
%D December 1983
%P 25-33

%A J. Despeyroux
%T An algebraic specification of a Pascal compiler
%J SIGPLAN Notices
%K programming languages
%V 18
%N 12
%D December 1983
%P 34-48

%A H. Flanders
%T Coroutines in Pascal
%J SIGPLAN Notices
%K programming languages
%V 18
%N 12
%D December 1983
%P 49-56

%A W.M. Evangelist
%T Relationships among computational, software and intuitive complexity
%J SIGPLAN Notices
%K programming languages
%V 18
%N 12
%D December 1983
%P 57-59

%A J. Grosch
%T Type derivation graphs - a way to visualize
the type building possibilities of programming languages
%J SIGPLAN Notices
%K programming languages
%V 18
%N 12
%D December 1983
%P 60-68

%A L.S. Levy
%T A walk through AWK
%J SIGPLAN Notices
%K programming languages
%V 18
%N 12
%D December 1983
%P 69-85

%A B.J. McLennan
%T Abstraction in the Intel iAPX-432
prototype systems implementation language
%J SIGPLAN Notices
%K programming languages
%V 18
%N 12
%D December 1983
%P 86-95

%A G. Merrill
%T Proofs, program correctness, and software engineering
%J SIGPLAN Notices
%K programming languages
%V 18
%N 12
%D December 1983
%P 96-105

%A P.S. Newman
%T If-then-else, again
%J SIGPLAN Notices
%K programming languages
%V 18
%N 12
%D December 1983
%P 106-111

%A O. Olsson
%T The memory usage of a Lisp system: the Belady life-time function
%J SIGPLAN Notices
%K programming languages
%V 18
%N 12
%D December 1983
%P 112-119

%A B. Srinivasan
%T Is nested control structure more complex ?
%J SIGPLAN Notices
%K programming languages
%V 18
%N 12
%D December 1983
%P 120-121

%A R.M. Wharton
%T A note on types and prototypes
%J SIGPLAN Notices
%K programming languages
%V 18
%N 12
%D December 1983
%P 122-126

%A Miren Beguna Albizuri-Romero
%T A graphical abstract programming language
%J SIGPLAN Notices
%K programming languages
%V 19
%N 1
%D January 1984
%P 14-23

%A Neta Amit
%T A different solution for improving the readability
of deeply nested IF-THEN-ELSE control structure
%J SIGPLAN Notices
%K programming languages
%V 19
%N 1
%D January 1984
%P 24-30

%A A. Toni Cohen
%T Data abstraction, data encapsulation and object oriented programming
%J SIGPLAN Notices
%K programming languages
%V 19
%N 1
%D January 1984
%P 31-35

%A Dirk Craeynest
%A Geert Lewi
%A Johan Vansteenkiste
%T Construction of an ELL(1) syntax analyser
with the compiler-generator LILA
%J SIGPLAN Notices
%K programming languages
%V 19
%N 1
%D January 1984
%P 36-45

%A R.B. Hunter
%T A system for writing Pascal programs interactively
%J SIGPLAN Notices
%K programming languages
%V 19
%N 1
%D January 1984
%P 46-56

%A Raghavendra Rao Loka
%T A note on parallel parsing
%J SIGPLAN Notices
%K programming languages
%V 19
%N 1
%D January 1984
%P 57-59

%A Luca Majocchi
%A Luca Rodda
%A Giacomo R. Sechi
%T A technique to obtain effective locality of computation in fortran IV
%J SIGPLAN Notices
%K programming languages
%V 19
%N 1
%D January 1984
%P 60-62

%A Lawrence M. Ruane
%T Abstract data types in assembly language programming
%J SIGPLAN Notices
%K programming languages
%V 19
%N 1
%D January 1984
%P 63-67

%A David Taylor
%T A portable pseudo-code for Pascal-like languages
%J SIGPLAN Notices
%K programming languages
%V 19
%N 1
%D January 1984
%P 68-77

%A J. van\ Katwijk
%A J. van\ Someren
%T The doublet model, run-time model and implementation of Ada types
%J SIGPLAN Notices
%K programming languages
%V 19
%N 1
%D January 1984
%P 78-92

%A C.K. Yuen
%T Further comments on the premature loop exit
%J SIGPLAN Notices
%K programming languages
%V 19
%N 1
%D January 1984
%P 93-94

%A Warren Harrison
%T Software complexity metrics: a bibliography and category index
%J SIGPLAN Notices
%K programming languages
%V 19
%N 2
%D February 1984
%P 17-27

%A Miren Bagona Albizuri-Romero
%T GRASE - a graphical syntax-directed editor for structured programming
%J SIGPLAN Notices
%K programming languages
%V 19
%N 2
%D February 1984
%P 28-37

%A David E. Boddy
%T On the design of monitors with priority considerations
%J SIGPLAN Notices
%K programming languages
%V 19
%N 2
%D February 1984
%P 38-46

%A D.J. Cooke
%A M.H.J. Al-Noufaly
%T The programming language MINO and its formal definition
%J SIGPLAN Notices
%K programming languages
%V 19
%N 2
%D February 1984
%P 47-57

%A Harry Feldmann
%T An acceptive grammar for the natural language English
%J SIGPLAN Notices
%K programming languages
%V 19
%N 2
%D February 1984
%P 58-67

%A D.C. Ince
%T The provision of procedural and functional interfaces
for the maintenance of program design language and program language
notations
%J SIGPLAN Notices
%K programming languages
%V 19
%N 2
%D February 1984
%P 68-74

%A Gary T. Leavens
%T Prettyprinting styles for various languages
%J SIGPLAN Notices
%K programming languages
%V 19
%N 2
%D February 1984
%P 75-79

%A Herbert Mayer
%A Don Perkins
%T Towers of Hanoi revisited, a nonrecursive surprise
%J SIGPLAN Notices
%K programming languages
%V 19
%N 2
%D February 1984
%P 80-84

%A Ana M. de\ A. Price
%T Defining dynamic variables and abstract data types in Pascal
%J SIGPLAN Notices
%K programming languages
%V 19
%N 2
%D February 1984
%P 85-91

%A Jorgen Steensgaard-Madsen
%A Lars Moller Olsen
%T Definition of the programming language MODEF
%J SIGPLAN Notices
%K programming languages
%V 19
%N 2
%D February 1984
%P 92-110

%A Mukul Babu Agrawal
%A Vijay Kumar Garg
%T Dimensional analysis in Pascal
%J SIGPLAN Notices
%K programming languages
%V 19
%N 3
%D March 1984
%P 7-11

%A Stowe Boyd
%T Free and bound generics:
two techniques for abstract data types in modular C
%J SIGPLAN Notices
%K programming languages
%V 19
%N 3
%D March 1984
%P 12-20

%A Edward Bulman
%T What is programming really about ?
%J SIGPLAN Notices
%K programming languages
%V 19
%N 3
%D March 1984
%P 21-23

%A John L. Callaghan
%T A software implemented memory manager
%J SIGPLAN Notices
%K programming languages
%V 19
%N 3
%D March 1984
%P 24-31

%A Don Faust
%T Run-time declaration elaboration
%J SIGPLAN Notices
%K programming languages
%V 19
%N 3
%D March 1984
%P 32-38

%A Vijay Kumar Garg
%T Screen-oriented high-level debugger (SHD) for Pascal
%J SIGPLAN Notices
%K programming languages
%V 19
%N 3
%D March 1984
%P 39-41

%A Klaus Groening
%T Combined actions to reduce LR-parsertables (experimental results)
%J SIGPLAN Notices
%K programming languages
%V 19
%N 3
%D March 1984
%P 42-45

%A Wolfgang Hoyer
%T Some remarks on records with variants
%J SIGPLAN Notices
%K programming languages
%V 19
%N 3
%D March 1984
%P 46-50

%A Francis C.M. Lau
%A Atul Asthana
%T Yet another history mechanism for command interpreters
%J SIGPLAN Notices
%K programming languages
%V 19
%N 3
%D March 1984
%P 51-56

%A Salvatore Mamone
%T Error free code. Is it attainable ?
%J SIGPLAN Notices
%K programming languages
%V 19
%N 3
%D March 1984
%P 57-60

%A John R. Pugh
%T Actors - the stage is set
%J SIGPLAN Notices
%K programming languages
%V 19
%N 3
%D March 1984
%P 61-65

%A Richard S. Wiener
%T A generic sorting module in Modula-2
%J SIGPLAN Notices
%K programming languages
%V 19
%N 3
%D March 1984
%P 66-72

%A Richard Wingerter
%T A note on determining the complexity of algorithms
%J SIGPLAN Notices
%K programming languages
%V 19
%N 3
%D March 1984
%P 73-78

%A David B. Benepe,\ Jr.
%T In defense of simplicity of comment syntax
%J SIGPLAN Notices
%K programming languages
%V 19
%N 4
%D April 1984
%P 32-33

%A Bill McMullen
%T Structured decision tables
%J SIGPLAN Notices
%K programming languages
%V 19
%N 4
%D April 1984
%P 34-43

%A Henry C. Thacher,\ Jr.
%T On the elimination of pointer variables and dynamic allocation
in higher level languages
%J SIGPLAN Notices
%K programming languages
%V 19
%N 4
%D April 1984
%P 44-46


%A Irving B. Elliott
%T The EPN and ESN notations
%J SIGPLAN Notices
%K programming languages
%V 19
%N 7
%D July 1984
%P 9-17

%A H. Kao
%A T.Y. Chen
%T Data flow analysis for Cobol
%J SIGPLAN Notices
%K programming languages
%V 19
%N 7
%D July 1984
%P 18-21

%A Raghavendra Rao Loka
%T A note on parallel parsing
%J SIGPLAN Notices
%K programming languages
%V 19
%N 7
%D July 1984
%P 22-24

%A Karl J. Ottenstein
%T Intermediate program representation in compiler construction:
a supplemental bibliography
%J SIGPLAN Notices
%K programming languages
%V 19
%N 7
%D July 1984
%P 25-27

%Q PASCAL
%T Foreward to the candidate extension library
%J SIGPLAN Notices
%K programming languages
%V 19
%N 7
%D July 1984
%P 28-44

%Q PASCAL
%T Foreward to work in progress
%J SIGPLAN Notices
%K programming languages
%V 19
%N 7
%D July 1984
%P 45-64

%A J.H.F. Winkler
%T Some improvements of ISO-Pascal
%J SIGPLAN Notices
%K programming languages
%V 19
%N 7
%D July 1984
%P 65-78

%A Gary T. Leavens
%T Bibliography on data types
%J SIGPLAN Notices
%K programming languages
%V 19
%N 8
%D August 1984
%P 41-50

%E Lawrence A. Rowe
%T Programming language issues for the 1980's
%J SIGPLAN Notices
%K programming languages
%V 19
%N 8
%D August 1984
%P 51-61

%A Roger R. Baldwin
%T The backward-directed GO TO in fortran
%J SIGPLAN Notices
%K programming languages
%V 19
%N 8
%D August 1984
%P 62-64

%A H.L. Berghel
%A D.L. Sallach
%T Measurements of program similarity in identical task environments
%J SIGPLAN Notices
%K programming languages
%V 19
%N 8
%D August 1984
%P 65-76
%K plagiarism detection

%A Joseph D. Brownsmith
%T Optimizing loops in programs
compiled with the IBM PL/I optimizing compiler
%J SIGPLAN Notices
%K programming languages
%V 19
%N 8
%D August 1984
%P 77-84

%A Michael A. Covington
%T A pedagogical disadvantage of repeat and while
%J SIGPLAN Notices
%K programming languages
%V 19
%N 8
%D August 1984
%P 85-86

%A Wm. Randolph Franklin
%T A simpler iterative solution to the Towers of Hanoi problem
%J SIGPLAN Notices
%K programming languages
%V 19
%N 8
%D August 1984
%P 87-88

%A D.C. Ince
%T Module interconnection languages and Prolog
%J SIGPLAN Notices
%K programming languages
%V 19
%N 8
%D August 1984
%P 89-93

%A Yves Noyelle
%T String-handling facilities of the LSE language
%J SIGPLAN Notices
%K programming languages
%V 19
%N 8
%D August 1984
%P 94-103

%A Scott A. Smolka
%T Report on the 6th International Symposium on Programming
%J SIGPLAN Notices
%K programming languages
%V 19
%N 8
%D August 1984
%P 104-105

%A Andrew S. Tanenbaum
%A Ed Keizer
%A Hans van\ Staveren
%T Does anybody out there want to write HALF of a compiler ?
%J SIGPLAN Notices
%K programming languages
%V 19
%N 8
%D August 1984
%P 106-108
%K Amsterdam Compiler Kit (ACK)

%A Mark Woodman
%T A program design language for software engineering
%J SIGPLAN Notices
%K programming languages
%V 19
%N 8
%D August 1984
%P 109-110

%A Kenneth M. Zemrowski
%T Differences between ANS and ISO standards for Pascal
- ambiguities clarifies -
%J SIGPLAN Notices
%K programming languages
%V 19
%N 8
%D August 1984
%P 111-126

%A D.Q.M. Fay
%T Experiences using Inmos proto-OCCAM
%J SIGPLAN Notices
%K programming languages
%V 19
%N 9
%D September 1984
%P 5-11

%A A.L. Furtado
%T Generalized set comparison
%J SIGPLAN Notices
%K programming languages
%V 19
%N 9
%D September 1984
%P 12-15

%A H. Mayer
%T Experiences porting Pascal source from a micro computer to a VAX
%J SIGPLAN Notices
%K programming languages
%V 19
%N 9
%D September 1984
%P 16-20

%A J. Milewski
%T LOGLAN implementation of the AMPL message-passing system
%J SIGPLAN Notices
%K programming languages
%V 19
%N 9
%D September 1984
%P 21-29

%A S. Pramanik
%A B. Weinberg
%T The implementation kit with monitors
%J SIGPLAN Notices
%K programming languages
%V 19
%N 9
%D September 1984
%P 30-33

%A M. Stadel
%T Another nonrecursive algorithm for the Towers of Hanoi
%J SIGPLAN Notices
%K programming languages
%V 19
%N 9
%D September 1984
%P 34-36

%A J. van\ Katwijk
%T Practical experiences with automatic repair of syntactical errors
- or - syntactical error repair in the DAS compiler
%J SIGPLAN Notices
%K programming languages
%V 19
%N 9
%D September 1984
%P 37-48

%A J.F.H. Winkler
%T Some improvements of ISO-Pascal
%J SIGPLAN Notices
%K programming languages
%V 19
%N 9
%D September 1984
%P 49-62

%A Jason Gait
%T Semaphores outside the kernel
%J SIGPLAN Notices
%K programming languages
%V 19
%N 10
%D October 1984
%P 12-21

%A Gebh. Greiter
%T acce-specifications: a formal method to define data types
%J SIGPLAN Notices
%K programming languages
%V 19
%N 10
%D October 1984
%P 22-31

%A Hausi A. Muller
%T Differences between Modula-2 and Pascal
%J SIGPLAN Notices
%K programming languages
%V 19
%N 10
%D October 1984
%P 32-39

%A H. Richards
%T An overview of ARC SASL
%J SIGPLAN Notices
%K programming languages
%V 19
%N 10
%D October 1984
%P 40-45

%A David O. Williams
%T Structured transfer of control
%J SIGPLAN Notices
%K programming languages
%V 19
%N 10
%D October 1984
%P 46-51

%A David O. Williams
%T Alternate returns
%J SIGPLAN Notices
%K programming languages
%V 19
%N 10
%D October 1984
%P 52-57

%A H. Zedan
%T A note on deadlock-free proofs of networks of processes
%J SIGPLAN Notices
%K programming languages
%V 19
%N 10
%D October 1984
%P 58-62

%A Karl Ludwig Pentzlin
%T An extension proposal for Pascal:
simplifying assignments like "a := a + 1" by a "pronoun character"
%J SIGPLAN Notices
%K programming languages
%V 19
%N 11
%D November 1984
%P 17

%A Linda Rising
%T A syntax-directed editor, world-builder and simulator
for the language of Karel the robot
%J SIGPLAN Notices
%K programming languages
%V 19
%N 11
%D November 1984
%P 18-21

%A David Rosenthal
%T A proposed modification to the absolute coordinates of Logo
%J SIGPLAN Notices
%K programming languages
%V 19
%N 11
%D November 1984
%P 22

%A D.A. Sewry
%T Modula-2 process facilities
%J SIGPLAN Notices
%K programming languages
%V 19
%N 11
%D November 1984
%P 23-32

%A D.A. Sewry
%T Modula-2 and the monitor concept
%J SIGPLAN Notices
%K programming languages
%V 19
%N 11
%D November 1984
%P 33-41

%A Thomas N. Turba
%T An exception-based mechanism for syntactic error recovery
%J SIGPLAN Notices
%K programming languages
%V 19
%N 11
%D November 1984
%P 42-51

%A Robert R. Van\ Tuyl
%T On evolution of fortran
%J SIGPLAN Notices
%K programming languages
%V 19
%N 11
%D November 1984
%P 52-55

%A ShouHan Wang
%T Some questions about "On the elimination of pointer variables
and dynamic allocation in higher level languages"
%J SIGPLAN Notices
%K programming languages
%V 19
%N 11
%D November 1984
%P 56-58

%A David Zethmayr
%T CUL-de-SAC and dramatic EXIT for USE in structured languages
%J SIGPLAN Notices
%K programming languages
%V 19
%N 11
%D November 1984
%P 59-62

%A L. Anselmi
%T A new programming language: Galilei
%J SIGPLAN Notices
%K programming languages
%V 19
%N 12
%D December 1984
%P 12-26

%A Lem O. Ejiogu
%T OPUS #16G software structure: its characteristic polynomials
%J SIGPLAN Notices
%K programming languages
%V 19
%N 12
%D December 1984
%P 27-34

%A Dennis P. Geller
%T Programming and writing
%J SIGPLAN Notices
%K programming languages
%V 19
%N 12
%D December 1984
%P 35-37

%A Bertrand Meyer
%T A note on iterative Hanoi
%J SIGPLAN Notices
%K programming languages
%V 19
%N 12
%D December 1984
%P 38-40

%A David V. Moffat
%T Some concerns about Modula-2
%J SIGPLAN Notices
%K programming languages
%V 19
%N 12
%D December 1984
%P 41-47

%A David Taylor
%T An alternative to current looping syntax
%J SIGPLAN Notices
%K programming languages
%V 19
%N 12
%D December 1984
%P 48-53

%A Mladen A. Vouk
%T On the cost of mixed language programming
%J SIGPLAN Notices
%K programming languages
%V 19
%N 12
%D December 1984
%P 54-60

%A Mark B. Wells
%A Margaret A. Hug
%A Roland Silver
%A John Brockmeyer
%T MODCAP reference manual
%J SIGPLAN Notices
%K programming languages
%V 19
%N 12
%D December 1984
%P 61-79

%A Graham Birtwistle
%T The coroutines of Hanoi
%J SIGPLAN Notices
%K programming languages
%V 20
%N 1
%D January 1985
%P 9-10

%A Pierre Breguet
%A Francois Grize
%A Alfred Strohmeier
%T SARTEX, a programming language for graph processing
%J SIGPLAN Notices
%K programming languages
%V 20
%N 1
%D January 1985
%P 11-19

%A Michael A. Covington
%T Eliminating unwanted loops in Prolog
%J SIGPLAN Notices
%K programming languages
%V 20
%N 1
%D January 1985
%P 20-26

%A Charles Hammons
%A Paul Dobbs
%T Multilevel files for software development
%J SIGPLAN Notices
%K programming languages
%V 20
%N 1
%D January 1985
%P 27-30

%A Ralph E. Griswold
%T Rebus - a SNOBOL4/Icon hybrid
%J SIGPLAN Notices
%K programming languages
%V 20
%N 2
%D February 1985
%P 7-16

%A G. Brun
%A A. Businger
%A R. Schenberger
%T The token-oriented approach to program testing
%J SIGPLAN Notices
%K programming languages
%V 20
%N 2
%D February 1985
%P 17-20

%A Ian D. Cottam
%T Extending Pascal with one-entry/multi-exit procedures
%J SIGPLAN Notices
%K programming languages
%V 20
%N 2
%D February 1985
%P 21-31

%A Peter C.J. Graham
%T Using BINS for inter-process communication
%J SIGPLAN Notices
%K programming languages
%V 20
%N 2
%D February 1985
%P 32-41

%A Warren Harrison
%A Curtis Cook
%T A method of sharing industrial software complexity data
%J SIGPLAN Notices
%K programming languages
%V 20
%N 2
%D February 1985
%P 42-51

%A Warren Harrison
%A Curtis Cook
%T Software complexity research: a survey
%J SIGPLAN Notices
%K programming languages
%V 20
%N 2
%D February 1985
%P 52-53

%A Jerrold Heyman
%T Software conversion: retargeting from a super-mini to a micro
%J SIGPLAN Notices
%K programming languages
%V 20
%N 2
%D February 1985
%P 54-57

%A Lambert Meertens
%A Steven Pemberton
%T Description of B
%J SIGPLAN Notices
%K programming languages
%V 20
%N 2
%D February 1985
%P 58-76

%A Ludovit Molnar
%A Pavol Navrat
%A Jiri Safarik
%T The programming language Pascal (in teaching perspective):
take it or leave it
%J SIGPLAN Notices
%K programming languages
%V 20
%N 2
%D February 1985
%P 77-79

%A Kalyan Dutta
%T Modular programming in C: an approach and an example
%J SIGPLAN Notices
%K programming languages
%V 20
%N 3
%D March 1985
%P 9-15

%A Lem O. Ejiogu
%T OPUS #16B A simple measure of software complexity
%J SIGPLAN Notices
%K programming languages
%V 20
%N 3
%D March 1985
%P 16-31

%A Philip Machanick
%T The case for simplified languages
%J SIGPLAN Notices
%K programming languages
%V 20
%N 3
%D March 1985
%P 32-36

%A Uwe Petermann
%A Andrzej Szalas
%T A note on PCI: distributed processes communicating by interrupts
%J SIGPLAN Notices
%K programming languages
%V 20
%N 3
%D March 1985
%P 37-46

%A A.P. Chang
%T A note on the modulo operation
%J SIGPLAN Notices
%K programming languages
%V 20
%N 4
%D April 1985
%P 19-23

%A Harvey Glass
%T Threaded interpretive systems and functional programming environments
%J SIGPLAN Notices
%K programming languages
%V 20
%N 4
%D April 1985
%P 24-32

%A Jan E. Jonak
%T Pascal and comms programming
%J SIGPLAN Notices
%K programming languages
%V 20
%N 4
%D April 1985
%P 33-41

%A Michael F. Killian
%T A conditional critical region pre-processor for C
based on the Owicki and Gries scheme
%J SIGPLAN Notices
%K programming languages
%V 20
%N 4
%D April 1985
%P 42-56

%A Bent Bruun Kristensen
%A Ole Lehrmann Madsen
%A Birger Moller-Pedersen
%A Kristen Nygaard
%T Multi-sequential execution in the BETA programming language
%J SIGPLAN Notices
%K programming languages
%V 20
%N 4
%D April 1985
%P 57-70

%A Salvatore Mamone
%T Using a PC to increase your odds of winning the lottery
%J SIGPLAN Notices
%K programming languages
%V 20
%N 4
%D April 1985
%P 71-79

%A Ivan Sklenar
%T Programming language assessments using the program profiles
%J SIGPLAN Notices
%K programming languages
%V 20
%N 4
%D April 1985
%P 80-87

%A Ivan Tomek
%A Tomasz Muldner
%T A CAI implementation of Pascal
%J SIGPLAN Notices
%K programming languages
%V 20
%N 4
%D April 1985
%P 88-95

%A Michael R. Dunlavey
%T A progress report on D, a compiled language featuring continuations
%J SIGPLAN Notices
%K programming languages
%V 20
%N 5
%D May 1985
%P 8-15

%A Stepan Maziar
%T Solution of the Tower of Hanoi problem using a binary tree
%J SIGPLAN Notices
%K programming languages
%V 20
%N 5
%D May 1985
%P 16-20

%A Richard R. Ragan
%T CYBIL - CYBER implementation LS
%J SIGPLAN Notices
%K programming languages
%V 20
%N 5
%D May 1985
%P 21-30

%A Lidia Segre
%A Michael Stanton
%T "Some concerns about Modula-2" considered unwarranted
%J SIGPLAN Notices
%K programming languages
%V 20
%N 5
%D May 1985
%P 31-35

%A Rob Strom
%A Shaula Yemini
%T The NIL distributed systems programming language: a status report
%J SIGPLAN Notices
%K programming languages
%V 20
%N 5
%D May 1985
%P 36-44

%A J. Vanthienen
%T A note on English for decision tables considered harmful
and the nested IF-THEN-ELSE
%J SIGPLAN Notices
%K programming languages
%V 20
%N 5
%D May 1985
%P 45-47

%A Paul Dasiewicz
%T A soft real-time multi-tasking Basic interpreter
%J SIGPLAN Notices
%K programming languages
%V 20
%N 6
%D June 1985
%P 10-15

%A K. John Gough
%T A new method of generating LL(1) lookahead sets
%J SIGPLAN Notices
%K programming languages
%V 20
%N 6
%D June 1985
%P 16-19

%A Chingmin Jim Lo
%T Simple patches to Modula-2 text IO
%J SIGPLAN Notices
%K programming languages
%V 20
%N 6
%D June 1985
%P 20-25

%A R.A. O'Keefe
%T Alternatives to keyword parameters
%J SIGPLAN Notices
%K programming languages
%V 20
%N 6
%D June 1985
%P 26-32

%A R.A. O'Keefe
%T Finding SmallTalk methods
%J SIGPLAN Notices
%K programming languages
%V 20
%N 6
%D June 1985
%P 33-38

%A Michael H. Rosenbloom
%T M'PAL - a programming language based on natural English definition
%J SIGPLAN Notices
%K programming languages
%V 20
%N 6
%D June 1985
%P 39-46

%A Piotr Rudnicki
%T On the organization of Pascal blocks
%J SIGPLAN Notices
%K programming languages
%V 20
%N 6
%D June 1985
%P 47-55

%A Richard S. Wiener
%A Richard F. Sincovec
%T Two approaches to implementing generic data structures in Modula-2
%J SIGPLAN Notices
%K programming languages
%V 20
%N 6
%D June 1985
%P 56-64


%A Harlan K. Seyfer
%T A bibliography on compiler assessment, part II
%J SIGPLAN Notices
%K programming languages
%V 20
%N 8
%D August 1985
%P 20-27

%A Michael A. Convington
%T A further note on looping in Prolog
%J SIGPLAN Notices
%K programming languages
%V 20
%N 8
%D August 1985
%P 28-31

%A Donald Nute
%T A programming solution to certain problems with loops in Prolog
%J SIGPLAN Notices
%K programming languages
%V 20
%N 8
%D August 1985
%P 32-37

%A David Poole
%A Randy Goebel
%T On eliminating loops in Prolog
%J SIGPLAN Notices
%K programming languages
%V 20
%N 8
%D August 1985
%P 38-40

%A Miren Begona Albizuri-Romero
%T Internal representation of programs in GRASE
%J SIGPLAN Notices
%K programming languages
%V 20
%N 8
%D August 1985
%P 41-50

%A Edward G. Amoroso
%T The formal specification and prototype implementation
of a simple editor
%J SIGPLAN Notices
%K programming languages
%V 20
%N 8
%D August 1985
%P 51-59

%A C. Bron
%A E.J. Dijkstra
%A T.J. Rossingh
%T A note on the checking of interfaces
between separately compiled modules
%J SIGPLAN Notices
%K programming languages
%V 20
%N 8
%D August 1985
%P 60-63

%A A.J. Gerber
%T The trouble with mutual recursion in Concurrent Euclid
%J SIGPLAN Notices
%K programming languages
%V 20
%N 8
%D August 1985
%P 64-70

%A Morton Goldberg
%T A response to "Some concerns about Modula-2"
%J SIGPLAN Notices
%K programming languages
%V 20
%N 8
%D August 1985
%P 71-72

%A Lawrence A. Harris
%A Yannich Wets
%T Resetting displays
%J SIGPLAN Notices
%K programming languages
%V 20
%N 8
%D August 1985
%P 73-77

%A Vladimir Jares
%T Work with strings of variable length in Cobol
%J SIGPLAN Notices
%K programming languages
%V 20
%N 8
%D August 1985
%P 78-81

%A Neil D. Jones
%A Peter Sestoft
%A Harald Sondergaard
%T An experiment in partial evaluation:
the generation of a compiler generator (extended abstract)
%J SIGPLAN Notices
%K programming languages
%V 20
%N 8
%D August 1985
%P 82-87

%A Wilf R. LaLonde
%A John R. Pugh
%T Specialization, generalization and inheritance -
teaching objectives beyond data structures and data types
%J SIGPLAN Notices
%K programming languages
%V 20
%N 8
%D August 1985
%P 88-92

%A Thomas N. Turba
%T The Pascal exception handling proposal
%J SIGPLAN Notices
%K programming languages
%V 20
%N 8
%D August 1985
%P 93-98

%A M.W. Whitelaw
%T Some ramifications of the exit statement in loop control
%J SIGPLAN Notices
%K programming languages
%V 20
%N 8
%D August 1985
%P 99-106

%A H. Zedan
%T Safety decomposition of distributed programs
%J SIGPLAN Notices
%K programming languages
%V 20
%N 8
%D August 1985
%P 107-112

%A Michael P. Barnett
%T The primitive string manipulation (PRISM) language
%J SIGPLAN Notices
%K programming languages
%V 20
%N 9
%D September 1985
%P 11-20

%A Carl Binding
%T Cheap concurrency in C
%J SIGPLAN Notices
%K programming languages
%V 20
%N 9
%D September 1985
%P 21-26

%A A. Toni Cohen
%A Thomas J. Myers
%T Information sharing
%J SIGPLAN Notices
%K programming languages
%V 20
%N 9
%D September 1985
%P 27-31

%A Bleicke Eggers
%T The Towers of Hanoi: yet another nonrecursive solution
%J SIGPLAN Notices
%K programming languages
%V 20
%N 9
%D September 1985
%P 32-42

%A C. Hornsby
%A C.H.C. Leung
%T The design and implementation of a flexible retrieval language
for a Prolog database system
%J SIGPLAN Notices
%K programming languages
%V 20
%N 9
%D September 1985
%P 43-51

%A David C.J. Matthews
%T Poly manual
%J SIGPLAN Notices
%K programming languages
%V 20
%N 9
%D September 1985
%P 52-76

%A Stef. W. Postma
%T Proposed data structures for QL/8n
%J SIGPLAN Notices
%K programming languages
%V 20
%N 9
%D September 1985
%P 77-85

%A J. Shao
%A G.E. Quick
%T Implementation considerations
of mapping Lisp onto a cellular computer system
%J SIGPLAN Notices
%K programming languages
%V 20
%N 9
%D September 1985
%P 86-93

%A Jonathan Thornburg
%T Further notes on the modulo operator
%J SIGPLAN Notices
%K programming languages
%V 20
%N 9
%D September 1985
%P 94

%A Roger R. Baldwin
%T A generalization of Neta Amit's statement
of the general problem of deeply nested IF-THEN-ELSEs
%J SIGPLAN Notices
%K programming languages
%V 20
%N 10
%D October 1985
%P 9-13

%A Malcolm Crowe
%A Clark Nicol
%A Michael Hughes
%A David Mackay
%T On converting a compiler into an incremental compiler
%J SIGPLAN Notices
%K programming languages
%V 20
%N 10
%D October 1985
%P 14-22

%A David M. Harland
%T AN alternative view polymorphism
%J SIGPLAN Notices
%K programming languages
%V 20
%N 10
%D October 1985
%P 23-35

%A D.C. Ince
%T The influence of system design complexity research
on the design of module interconnection languages
%J SIGPLAN Notices
%K programming languages
%V 20
%N 10
%D October 1985
%P 36-43

%A Randy M. Kaplan
%T small-X - a language and interpreter for building expert systems
%J SIGPLAN Notices
%K programming languages
%V 20
%N 10
%D October 1985
%P 44-47

%A Hidekazu Matsumoto
%T A static analysis of Prolog programs
%J SIGPLAN Notices
%K programming languages
%V 20
%N 10
%D October 1985
%P 48-59

%A Walter Olthoff
%T An overview of ModPascal
%J SIGPLAN Notices
%K programming languages
%V 20
%N 10
%D October 1985
%P 60-71

%A Jerome A. Otto
%T Predicting potential Cobol performance
on low level machine architectures
%J SIGPLAN Notices
%K programming languages
%V 20
%N 10
%D October 1985
%P 72-78

%A Don Rosenthal
%T Adding meta rules to OPS5 - a proposed extension
%J SIGPLAN Notices
%K programming languages
%V 20
%N 10
%D October 1985
%P 79-86

%A Thomas J. Sager
%T A technique for creating small fast compiler frontends
%J SIGPLAN Notices
%K programming languages
%V 20
%N 10
%D October 1985
%P 87-94

%A Andrzej Szalas
%T Exception handling in parallel computations
%J SIGPLAN Notices
%K programming languages
%V 20
%N 10
%D October 1985
%P 95-104

%A Yoshito Yamane
%T Some thoughts on the type system of B
%J SIGPLAN Notices
%K programming languages
%V 20
%N 10
%D October 1985
%P 105-110

%A G. Aharonian
%T Multi-language BLAS: a proposal
%J SIGPLAN Notices
%K programming languages
%V 20
%N 11
%D November 1985
%P 11-13

%A P.A. Buhr
%T A case for teaching multi-exit loops to beginning programmers
%J SIGPLAN Notices
%K programming languages
%V 20
%N 11
%D November 1985
%P 14-22

%A N.A. Burkhard
%T Machine-independent C optimizer
%J SIGPLAN Notices
%K programming languages
%V 20
%N 11
%D November 1985
%P 23-26

%A B. Dwyer
%T Improving Gough's LL(1) lookahead generator
%J SIGPLAN Notices
%K programming languages
%V 20
%N 11
%D November 1985
%P 27-29

%A R. Gupta
%A M.L. Soffa
%T The efficiency of storage management schemes for Ada programs
%J SIGPLAN Notices
%K programming languages
%V 20
%N 11
%D November 1985
%P 30-38

%A D. Joslin
%T Extensions in Pascal implementations
%J SIGPLAN Notices
%K programming languages
%V 20
%N 11
%D November 1985
%P 39-46

%A R. Marcus
%T Generalized inheritance
%J SIGPLAN Notices
%K programming languages
%V 20
%N 11
%D November 1985
%P 47-48

%A D.M. Pase
%T System programming in Modula-2
%J SIGPLAN Notices
%K programming languages
%V 20
%N 11
%D November 1985
%P 49-53

%A A.C. Silvestri
%T An IBM-PC numeric I/O interrupt
%J SIGPLAN Notices
%K programming languages
%V 20
%N 11
%D November 1985
%P 54-63

%A M. Wolfe
%A T. Macke
%T Where are the optimizing compilers ?
%J SIGPLAN Notices
%K programming languages
%V 20
%N 11
%D November 1985
%P 64-68

%A J.A. Zimmer
%T A modest Modula wish list
%J SIGPLAN Notices
%K programming languages
%V 20
%N 11
%D November 1985
%P 69-77

%A Michael P. Barnett
%T A simple mechanism that supports the PRISM language
%J SIGPLAN Notices
%K programming languages
%V 20
%N 12
%D December 1985
%P 5-12

%A Richard Bielak
%T Ada vs. Modula-2: a view from the trenches
%J SIGPLAN Notices
%K programming languages
%V 20
%N 12
%D December 1985
%P 13-17

%A Albert L. Crawford
%T High level input/output in Modula-2
%J SIGPLAN Notices
%K programming languages
%V 20
%N 12
%D December 1985
%P 18-25

%A Jurek Czyzowicz
%A Michal Iglewski
%T Implementing generic types in Modula-2
%J SIGPLAN Notices
%K programming languages
%V 20
%N 12
%D December 1985
%P 26-32

%A Kio C. Hyun
%T Inline expansion of SETL procedures
%J SIGPLAN Notices
%K programming languages
%V 20
%N 12
%D December 1985
%P 33-38

%A Milos Konopasek
%T The Towers of Hanoi from a different viewpoint
%J SIGPLAN Notices
%K programming languages
%V 20
%N 12
%D December 1985
%P 39-46

%A Robert W. Sebesta
%A Mark A. Taylor
%T Minimal perfect hash functions for reserved word lists
%J SIGPLAN Notices
%K programming languages
%V 20
%N 12
%D December 1985
%P 47-53

%A P.D. Terry
%T CLANG - a simple teaching language
%J SIGPLAN Notices
%K programming languages
%V 20
%N 12
%D December 1985
%P 54-63

%A Hal Berghel
%A Eric Traudt
%T Spelling verification in Prolog
%J SIGPLAN Notices
%K programming languages
%V 21
%N 1
%D January 1986
%P 19-27

%A Daniel Brand
%T On typing in Prolog
%J SIGPLAN Notices
%K programming languages
%V 21
%N 1
%D January 1986
%P 28-30

%A Joseph L.F. De\ Kerf
%T APL compared with other languages according to Halstead's theory
%J SIGPLAN Notices
%K programming languages
%V 21
%N 1
%D January 1986
%P 31-39

%A Dick Dunn
%T Non-technical issues in accpetance of SILs
%J SIGPLAN Notices
%K programming languages
%V 21
%N 1
%D January 1986
%P 40-45

%A J.G. Hunt
%T Detection of deadlocks in multiprocess systems
%J SIGPLAN Notices
%K programming languages
%V 21
%N 1
%D January 1986
%P 46-48

%A Kuo-Cheng Li
%T A note on the Vector C language
%J SIGPLAN Notices
%K programming languages
%V 21
%N 1
%D January 1986
%P 49-57

%A Michael J. Sorens
%T A technique for automatically porting
dialects of Pascal to each other
%J SIGPLAN Notices
%K programming languages
%V 21
%N 1
%D January 1986
%P 58-63

%A J. Heering
%A P. Klint
%T The efficient of the Equation Interpreter
compared with the UNH Prolog interpreter
%J SIGPLAN Notices
%K programming languages
%V 21
%N 2
%D February 1986
%P 18-21

%A W.T. Huang
%A D.C. You
%T Typed functional programming
%J SIGPLAN Notices
%K programming languages
%V 21
%N 2
%D February 1986
%P 22-26

%A Jan E. Jonak
%T Experience with a FORTH-like language
%J SIGPLAN Notices
%K programming languages
%V 21
%N 2
%D February 1986
%P 27-36

%A T.G. Muchnick
%T On some extensions of syntactic error recovery technique
based on phrase matches
%J SIGPLAN Notices
%K programming languages
%V 21
%N 2
%D February 1986
%P 37-39

%A Stan Skelton
%T Measurements of migratability and transportability
%J SIGPLAN Notices
%K programming languages
%V 21
%N 2
%D February 1986
%P 40-45

%A John Weeks
%A Hal Berghel
%T A comparative feature-analysis
of microcomputer Prolog implementations
%J SIGPLAN Notices
%K programming languages
%V 21
%N 2
%D February 1986
%P 46-61

%A R. Manner
%T Strong typing and physical units
%J SIGPLAN Notices
%K programming languages
%V 21
%N 3
%D March 1986
%P 11-20

%A Mark B. Wells
%T A potpourri of notational pet peeves and their resolution in MODCAP
%J SIGPLAN Notices
%K programming languages
%V 21
%N 3
%D March 1986
%P 21-30

%A John Beidler
%A Paul Jackowitz
%T Consistent generics in Modula-2
%J SIGPLAN Notices
%K programming languages
%V 21
%N 4
%D April 1986
%P 32-41

%A T.Y. Chen
%A S.C. Kwan
%T An analysis of length equation using a dynamic approach
%J SIGPLAN Notices
%K programming languages
%V 21
%N 4
%D April 1986
%P 42-47

%A Gerardo Cisneros
%A Harold V. McIntosh
%T Introduction to the programming language Convert
%J SIGPLAN Notices
%K programming languages
%V 21
%N 4
%D April 1986
%P 48-57

%A Klaus Groening
%A Chrsitoph Ohsendoth
%T NEMO - a nicely modified YACC
%J SIGPLAN Notices
%K programming languages
%V 21
%N 4
%D April 1986
%P 58-66

%A James P. Kelsh
%A John C. Hansen
%T Reasonably priced compilers and interpreters
for the IBM PC and compatible computers
%J SIGPLAN Notices
%K programming languages
%V 21
%N 4
%D April 1986
%P 67-69

%A Michael R. Longe
%T The line-oriented approach
%J SIGPLAN Notices
%K programming languages
%V 21
%N 4
%D April 1986
%P 70-74
%K syntax-directed editors, incremental compilers

%A K.W. Ng
%A W.Y. Ma
%T Pitfalls in Prolog programming
%J SIGPLAN Notices
%K programming languages
%V 21
%N 4
%D April 1986
%P 75-79

%A Flemming Nielson
%T A bibliography on abstract interpretation
%J SIGPLAN Notices
%K programming languages
%V 21
%N 5
%D May 1986
%P 31-38

%A Michael B. Feldman
%T Ada vs. Modula-2: a response from the ivory tower
%J SIGPLAN Notices
%K programming languages
%V 21
%N 5
%D May 1986
%P 39-44

%A James R. Greenwood
%T Comments on "A view from the trenches": Ada vs. Modula-2 vs. Praxis
%J SIGPLAN Notices
%K programming languages
%V 21
%N 5
%D May 1986
%P 45-49

%A Vincent Hayward
%T Compared anatomy of the programming languages Pascal and C
%J SIGPLAN Notices
%K programming languages
%V 21
%N 5
%D May 1986
%P 50-60

%A Mehdi Jazayeri
%A Mike Haden
%T Optimizing compilers are here (mostly)
%J SIGPLAN Notices
%K programming languages
%V 21
%N 5
%D May 1986
%P 61-63

%A Daniel D. Kary
%A Paul L. Juell
%T TRC: an expert system compiler
%J SIGPLAN Notices
%K programming languages
%V 21
%N 5
%D May 1986
%P 64-68

%A H. Mossenbock
%T Alex - a simple and efficient scanner generator
%J SIGPLAN Notices
%K programming languages
%V 21
%N 5
%D May 1986
%P 69-78

%A Will Tracz
%T Confessions of a used program salesman - the loves in my life
%J SIGPLAN Notices
%K programming languages
%V 21
%N 5
%D May 1986
%P 79-81

%A James F. Watson
%T Recursion: a choice between readability and execution speed
%J SIGPLAN Notices
%K programming languages
%V 21
%N 5
%D May 1986
%P 82-90

%A Mark N. Wegman
%T 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
%J SIGPLAN Notices
%K programming languages
%V 21
%N 5
%D May 1986
%P 91-95

%A Martin Gfeller
%T APL arrays and their editor
%J SIGPLAN Notices
%K programming languages
%V 21
%N 6
%D June 1986
%P 18-27

%A Michael E. Goldsby
%T Concurrent use of generic types in Modula-2
%J SIGPLAN Notices
%K programming languages
%V 21
%N 6
%D June 1986
%P 28-34

%A Philip Machanick
%T Are LR parsers too powerful ?
%J SIGPLAN Notices
%K programming languages
%V 21
%N 6
%D June 1986
%P 35-40

%A Dave Taylor
%T Visionaries: an interview with Professor Michael O'Leary
%J SIGPLAN Notices
%K programming languages
%V 21
%N 6
%D June 1986
%P 41-54

%A Jonathan Thornburg
%T Keyword input for C
%J SIGPLAN Notices
%K programming languages
%V 21
%N 6
%D June 1986
%P 55-58

%A Jonathan Thornburg
%T Number crunching in C
%J SIGPLAN Notices
%K programming languages
%V 21
%N 6
%D June 1986
%P 59-60

%A Thomas Vasak
%T Universal closure operator for Prolog
%J SIGPLAN Notices
%K programming languages
%V 21
%N 6
%D June 1986
%P 61-62

%A Richard S. Wiener
%T Protecting against uninitialized abstract objects in Modula-2
%J SIGPLAN Notices
%K programming languages
%V 21
%N 6
%D June 1986
%P 63-69

%A R.J. Zavodnik
%A M.D. Middleton
%T YALE: the design of yet another language-based editor
%J SIGPLAN Notices
%K programming languages
%V 21
%N 6
%D June 1986
%P 70-78


%A Maurice V. Wilkes
%T EMPIRIC: a sketch of a programming language
designed to facilitate a fine grain of protection
%J SIGPLAN Notices
%K programming languages
%V 21
%N 8
%D August 1986
%P 16-27

%A C. Clay
%T A new solution to the N <= 8 queens problem
%J SIGPLAN Notices
%K programming languages
%V 21
%N 8
%D August 1986
%P 28-30
%K humor

%A Dick Grune
%T Generic packages in C
%J SIGPLAN Notices
%K programming languages
%V 21
%N 8
%D August 1986
%P 31-39

%A P. Jouvelot
%T Designing new languages or new language manipulation systems using ML
%J SIGPLAN Notices
%K programming languages
%V 21
%N 8
%D August 1986
%P 40-52
%K MLYacc

%A David V. Moffat
%T Generic data structures in UCSD Pascal
%J SIGPLAN Notices
%K programming languages
%V 21
%N 8
%D August 1986
%P 53-61

%A Bruce D. Ramsey
%T The lion and the unicorn meet Prolog
%J SIGPLAN Notices
%K programming languages
%V 21
%N 8
%D August 1986
%P 62-70

%A Xiaolin Zang
%T A proposal for implementing the concurrent mechanisms of Ada
%J SIGPLAN Notices
%K programming languages
%V 21
%N 8
%D August 1986
%P 71-79

%A Daniel Solomon
%A David Rosenblueth
%T Selecting a programming language made easy
%J SIGPLAN Notices
%K programming languages
%V 21
%N 9
%D September 1986
%P 6
%K humor

%A Terry L. Anderson
%T The scope of imported identifiers in Modula-2
%J SIGPLAN Notices
%K programming languages
%V 21
%N 9
%D September 1986
%P 17-21

%A Roger R. Baldwin
%T Systematic indentation in PL/I: minimizing the reduction in horizontal space
%J SIGPLAN Notices
%K programming languages
%V 21
%N 9
%D September 1986
%P 22-26

%A H.P. Christiansen
%A A. Lacroix
%A K. Lundberg
%A A. McKeeman
%A P.D.V. van\ der\ Stok
%T More or less concerns about Modula-2
%J SIGPLAN Notices
%K programming languages
%V 21
%N 9
%D September 1986
%P 27-31

%A Richard Gisselquist
%T An experimental C compiler for the Cray 2 computer
%J SIGPLAN Notices
%K programming languages
%V 21
%N 9
%D September 1986
%P 32-41

%A S. Hekmatpour
%A D.C. Ince
%T Forms as a language facility
%J SIGPLAN Notices
%K programming languages
%V 21
%N 9
%D September 1986
%P 42-48

%A Kenneth Magel
%T Efficient calculation of the scope program complexity metric
%J SIGPLAN Notices
%K programming languages
%V 21
%N 9
%D September 1986
%P 49-56

%A J.R. Parker
%T A subset Fortran compiler for a modified Harvard architecture
%J SIGPLAN Notices
%K programming languages
%V 21
%N 9
%D September 1986
%P 57-62

%A Rollo Silver
%A Mark Wells
%A Shaun-Inn Wu
%A Margaret Hug
%T A concurrent N <= 8 queens' algorithm using Modcap
%J SIGPLAN Notices
%K programming languages
%V 21
%N 9
%D September 1986
%P 63-76

%A Peter van\ Eijk
%T A useful application for formal procedure parameters
%J SIGPLAN Notices
%K programming languages
%V 21
%N 9
%D September 1986
%P 77-78


%A David Beech
%T An intensional model of persistent objects
(abstract only)
%J SIGPLAN Notices
%K programming languages
%V 21
%N 12
%D December 1986
%P 28

%A Alan Borning
%T Constraints and object-oriented programming
(abstract only)
%J SIGPLAN Notices
%K programming languages
%V 21
%N 12
%D December 1986
%P 28

%A John Goodenough
%T Ada vs. object-oriented programming
(abstract only)
%J SIGPLAN Notices
%K programming languages
%V 21
%N 12
%D December 1986
%P 29

%A J.A. Goguen
%A J. Meseguer
%T Types as theories
(abstract only)
%J SIGPLAN Notices
%K programming languages
%V 21
%N 12
%D December 1986
%P 29

%A David Gries
%T What is different about object-oriented languages ?
(abstract only)
%J SIGPLAN Notices
%K programming languages
%V 21
%N 12
%D December 1986
%P 29

%A William Harrison
%T Experiences with an object methodology in building
(abstract only)
%J SIGPLAN Notices
%K programming languages
%V 21
%N 12
%D December 1986
%P 30

%A Carl Hewitt
%A Tom Reinhardt
%A Gul Agha
%A Giuseppe Attardi
%T Linguistic support of receptionists for shared resources
(abstract only)
%J SIGPLAN Notices
%K programming languages
%V 21
%N 12
%D December 1986
%P 30

%A Gary Lindstrom
%T Objects in functional and logic programming
(abstract only)
%J SIGPLAN Notices
%K programming languages
%V 21
%N 12
%D December 1986
%P 31

%A David Maier
%A Jacob Stein
%A Allen Otis
%A Alan Purdy
%T Implementing an object-oriented DBMS
(abstract only)
%J SIGPLAN Notices
%K programming languages
%V 21
%N 12
%D December 1986
%P 31-32

%A Norman Meyrowitz
%T Intermedia: the architecture and construction
of an object oriented hypertext/hypermedia system and applications framework
(abstract only)
%J SIGPLAN Notices
%K programming languages
%V 21
%N 12
%D December 1986
%P 33

%A Craig Schaffert
%A Toby Bloom
%T Multiple inheritance in a strongly typed language
(abstract only)
%J SIGPLAN Notices
%K programming languages
%V 21
%N 12
%D December 1986
%P 33-34
%K Trellis/Owl

%A Howard Shrobe
%T An integrated object-oriented CAD system
(abstract only)
%J SIGPLAN Notices
%K programming languages
%V 21
%N 12
%D December 1986
%P 34-35

%A Reid Smith
%A Rick Dinitz
%A Paul Barth
%T An object-oriented substrate for knowledge-based system interface design
(abstract only)
%J SIGPLAN Notices
%K programming languages
%V 21
%N 12
%D December 1986
%P 35
%K Impulse-86

%A Norihisa Suzuki
%T Uniform mechanism of message send
(abstract only)
%J SIGPLAN Notices
%K programming languages
%V 21
%N 12
%D December 1986
%P 36

%A Jonathan Rees
%A William Clinger
%T Revised report on the algorithmic language Scheme
%J SIGPLAN Notices
%K programming languages
%V 21
%N 12
%D December 1986
%P 37-79

%A Tudor Balanescu
%A Serban Gavrila
%A Marian Gheorghe
%A Radu Nicolescu
%A Liviu Sofonea
%T On Hartmann's error-recovery scheme
%J SIGPLAN Notices
%K programming languages
%V 21
%N 12
%D December 1986
%P 80-86

%A Harold Boley
%T RELFUN: a relational/functional integration with valued clauses
%J SIGPLAN Notices
%K programming languages
%V 21
%N 12
%D December 1986
%P 87-98

%A Russell M. Clapp
%A Trevor N. Mudge
%A Richard A. Volz
%T Solutions to the n queens problem using tasking in Ada
%J SIGPLAN Notices
%K programming languages
%V 21
%N 12
%D December 1986
%P 99-110

%A W.F. Clocksin
%T Some comments on "Pitfalls in Prolog programming"
%J SIGPLAN Notices
%K programming languages
%V 21
%N 12
%D December 1986
%P 111-113

%A A. Dreiheller
%A M. Moerschbacher
%A B. Mohr
%T PHYSCAL - programming Pascal with physical units
%J SIGPLAN Notices
%K programming languages
%V 21
%N 12
%D December 1986
%P 114-123

%A Gilbert Gonsalves
%A Antonio C. Silvestri
%T Programming in Smalltalk-80:
observations and remarks from the newly initiated
%J SIGPLAN Notices
%K programming languages
%V 21
%N 12
%D December 1986
%P 124-130

%A David A. Joslin
%T Extended Pascal - illustrative features
%J SIGPLAN Notices
%K programming languages
%V 21
%N 12
%D December 1986
%P 131-138

%A H. Mossenbock
%T Alex - a simple and efficient scanner generator
%J SIGPLAN Notices
%K programming languages
%V 21
%N 12
%D December 1986
%P 139-148

%A Yuh-Huei Shyu
%T From semi-syntactical lexical analyzer to a new compiler model
%J SIGPLAN Notices
%K programming languages
%V 21
%N 12
%D December 1986
%P 149-157

%A David Turner
%T An overview of Miranda
%J SIGPLAN Notices
%K programming languages
%V 21
%N 12
%D December 1986
%P 158-166

%A Prescott K. Turner
%T Up-down parsing with prefix grammars
%J SIGPLAN Notices
%K programming languages
%V 21
%N 12
%D December 1986
%P 167-174