%%% -*-BibTeX-*-
%%% ====================================================================
%%%  BibTeX-file{
%%%     author          = "Nelson H. F. Beebe",
%%%     version         = "3.10",
%%%     date            = "18 June 2008",
%%%     time            = "19:28:14 MDT",
%%%     filename        = "sigplan1980.bib",
%%%     address         = "University of Utah
%%%                        Department of Mathematics, 110 LCB
%%%                        155 S 1400 E RM 233
%%%                        Salt Lake City, UT 84112-0090
%%%                        USA",
%%%     telephone       = "+1 801 581 5254",
%%%     FAX             = "+1 801 581 4148",
%%%     URL             = "http://www.math.utah.edu/~beebe",
%%%     checksum        = "43471 58235 261561 2500160",
%%%     email           = "beebe at math.utah.edu, beebe at acm.org,
%%%                        beebe at computer.org (Internet)",
%%%     codetable       = "ISO/ASCII",
%%%     keywords        = "bibliography; BibTeX; programming languages;
%%%                        SIGPLAN",
%%%     license         = "public domain",
%%%     supported       = "yes",
%%%     docstring       = "This is a bibliography of ACM SIGPLAN
%%%                        Notices, covering (incompletely) 1980--1989.
%%%
%%%                        The initial draft was extracted from the ACM
%%%                        Computing Archive CD ROM for the 1980s, with
%%%                        manual corrections and additions.  Major
%%%                        additions were obtained from the huge
%%%                        Computer Science bibliography archive on
%%%                        ftp.ira.uka.de, in late 1995, from the OCLC
%%%                        Contents1st database, and in spring 1998,
%%%                        from the IEEE INSPEC database.
%%%
%%%                        There are World Wide Web sites for the
%%%                        journal at
%%%
%%%                            http://www.acm.org/sigplan/
%%%
%%%                        and
%%%
%%%                            http://www.rowan.edu/sigplan/
%%%
%%%                        and coverage of about a dozen volumes can be found at
%%%
%%%                            http://ftp.informatik.rwth-aachen.de/dblp/db/journals/sigplan/index.html
%%%
%%%                        Several conference proceedings are published
%%%                        as volumes of SIGPLAN Notices.  Many of them
%%%                        can also be found via the ACM proceedings Web
%%%                        sites:
%%%
%%%                            http://www.acm.org/pubs/contents/proceedings/
%%%                            http://www.acm.org/pubs/contents/proceedings/plan/
%%%
%%%                        At version 3.10, the year coverage looks
%%%                        like this:
%%%
%%%                             1979 (   1)    1983 ( 195)    1987 ( 285)
%%%                             1980 ( 134)    1984 ( 155)    1988 ( 241)
%%%                             1981 ( 187)    1985 ( 128)    1989 ( 332)
%%%                             1982 ( 172)    1986 ( 197)
%%%
%%%                             Article:       1877
%%%                             Book:             2
%%%                             InProceedings:  110
%%%                             Proceedings:     38
%%%
%%%                             Total entries: 2027
%%%
%%%                        At version 1.17 [15-Dec-1995] of this
%%%                        bibliography, there were 1308 entries
%%%                        covering 28 years, an average of 47 per
%%%                        year.  Examination of issues from recent
%%%                        years suggests an average of about 10 to 12
%%%                        articles per issue, or about 100 to 120
%%%                        yearly.  The coverage by this bibliography
%%%                        is therefore only about 40%.
%%%
%%%                        At version 1.19 [31-Dec-1995], there were
%%%                        1516 entries, representing about 45%
%%%                        coverage.
%%%
%%%                        At version 2.00 [25-Apr-1998], there were
%%%                        3517 entries, which is about 95% coverage.
%%%
%%%                        At version 3.00 [03-May-1999], the original
%%%                        bibliography had reached more than 4000
%%%                        entries, and it was therefore split into
%%%                        decade-specific files, sigplan19xx.bib, where
%%%                        (xx = 60, 70, 80, 90).
%%%
%%%                        Besides missing entries for some articles,
%%%                        there are regrettably numerous issues that
%%%                        are missing entirely, including the following
%%%                        volume(number) pairs for these years:
%%%
%%%                        1966: 1(all)
%%%                        1967: 2(all)
%%%                        1968: 3(all)
%%%                        1969: 4(1) 4(2) 4(3) 4(4) 4(5) 4(6) 4(7) 4(8)
%%%                              4(10) 4(11) 4(12)
%%%                        1970: 5(3) 5(4) 5(5) 5(8) 5(9) 5(10) 5(11)
%%%                              5(12)
%%%                        1971: 6(1) 6(2) 6(3) 6(4) 6(5) 6(6) 6(7) 6(10)
%%%                              6(11)
%%%                        1972: 7(4) 7(5) 7(6) 7(8) 7(9) 7(11) 7(12)
%%%                        1973: 8(1) 8(3) 8(4) 8(5) 8(6) 8(7) 8(10)
%%%                              8(12)
%%%                        1981: 16(1)
%%%                        1982: 17(4)
%%%                        1987: 22(10)
%%%                        1990: 25(3) 25(4) 25(7) 25(9) 25(11)
%%%                        1991: 26(2) 26(3) 26(5) 26(9) 26(10) 26(11)
%%%                        1992: 27(2) 27(4) 27(8)
%%%
%%%                        Some of the bibliography entries in this
%%%                        file contain abstracts.  These are governed
%%%                        by the ACM Copyright Notice for ACM SIGPLAN
%%%                        Notices, which says:
%%%
%%%                             ``Permission to copy without fee all
%%%                             or part of this material is granted
%%%                             provided that the copies are not made
%%%                             or distributed for commercial
%%%                             advantage, the ACM copyright notice
%%%                             and the title of the publication and
%%%                             its date appear, and notice is given
%%%                             that copying is by permission of the
%%%                             Association for Computing Machinery.
%%%                             To copy otherwise, or to republish,
%%%                             requires a fee and/or specific
%%%                             permission.''
%%%
%%%                        Inasmuch as this bibliography, and its
%%%                        companion files in the master collection,
%%%                        is freely distributed without charge,
%%%                        inclusion of article abstracts clearly
%%%                        falls within the copyright permissions, and
%%%                        this author considers that ACM has given
%%%                        the required permission under the terms of
%%%                        the above Copyright Notice.
%%%
%%%                        BibTeX citation tags are uniformly chosen
%%%                        as name:year:abbrev, where name is the
%%%                        family name of the first author or editor,
%%%                        year is a 4-digit number, and abbrev is a
%%%                        3-letter condensation of important title
%%%                        words. Citation tags were automatically
%%%                        generated by software developed for the
%%%                        BibNet Project.
%%%
%%%                        In this bibliography, entries are sorted in
%%%                        publication order, using bibsort -byvolume.
%%%
%%%                        The checksum field above contains a CRC-16
%%%                        checksum as the first value, followed by the
%%%                        equivalent of the standard UNIX wc (word
%%%                        count) utility output of lines, words, and
%%%                        characters.  This is produced by Robert
%%%                        Solovay's checksum utility.",
%%%  }
%%% ====================================================================

@Preamble{
  "\input bibnames.sty " #
  "\input path.sty " #
  "\hyphenation{
                Bie-li-ko-va
                Common-Loops
                DeMich-iel
                Distributed-Con-current-Small-talk
                Dober-kat
                Er-vier
                Fell-eisen
                Gam-ma
                Gem-Stone
                Glan-ville
                Gold-in
                Goos-sens
                Graph-Trace
                Grim-shaw
                Hoeks-ma
                Hor-o-witz
                Kam-i-ko
                Kenn-e-dy
                Kess-ler
                Lisp-edit
                LISP-TALK
                Nich-o-las
                Obern-dorf
                Ohsen-doth
                Para-sight
                Par-log
                Pega-Sys
                Pren-tice
                Ra-guid-eau
                Rich-ard
                Schee-vel
                Schlotz-hauer
                Schwartz-bach
                Sieg-fried
                SIG-OA
                SIG-PLAN
                SIG-SOFT
                SMALL-TALK
                Small-talk
                Spring-er
                Stroh-meier
                Thing-Lab
                Zhong-xiu
  }"}

%%% ====================================================================
%%% Acknowledgement abbreviations:

@String{ack-nhfb = "Nelson H. F. Beebe,
                    University of Utah,
                    Department of Mathematics, 110 LCB,
                    155 S 1400 E RM 233,
                    Salt Lake City, UT 84112-0090, USA,
                    Tel: +1 801 581 5254,
                    FAX: +1 801 581 4148,
                    e-mail: \path|beebe@math.utah.edu|,
                            \path|beebe@acm.org|,
                            \path|beebe@computer.org| (Internet),
                    URL: \path|http://www.math.utah.edu/~beebe/|"}

%%% ====================================================================
%%% Journal abbreviations:

@String{j-ACTA-INFO             = "Acta Informatica"}

@String{j-CACM                  = "Communications of the ACM"}

@String{j-FORTRAN-FORUM         = "ACM FORTRAN Forum"}

@String{j-IEEE-TRANS-SOFTW-ENG  = "IEEE Transactions on Software
                                  Engineering"}

@String{j-INFO-PROC-LETT        = "Information Processing Letters"}

@String{j-INT-J-MAN-MACH-STUD   = "Int. J. Man-Mach. Stud."}

@String{j-SIGPLAN               = "ACM SIG{\-}PLAN Notices"}

%%% ====================================================================
%%% Publisher abbreviations:

@String{pub-ACM                 = "ACM Press"}

@String{pub-ACM:adr             = "New York, NY, USA"}

@String{pub-AP                  = "Academic Press Inc."}

@String{pub-AP:adr              = "New York, USA"}

@String{pub-IEEE-STD            = "IEEE"}

@String{pub-IEEE-STD:adr        = "New York, NY, USA"}

@String{pub-MIT                 = "MIT Press"}

@String{pub-MIT:adr             = "Cambridge, MA, USA"}

%%% ====================================================================
%%% Series abbreviations:

@String{ser-SIGPLAN               = "ACM SIG{\-}PLAN Notices"}

%%% ====================================================================
%%% Cross-references from ACTA-INFO:

@Article{Anderson:1982:AII,
  author =       "S. O. Anderson and R. C. Backhouse",
  title =        "An alternative implementation of an insertion-only
                 recovery technique",
  journal =      j-ACTA-INFO,
  volume =       "18",
  number =       "3",
  pages =        "289--298",
  month =        dec,
  year =         "1982",
  CODEN =        "AINFA2",
  ISSN =         "0001-5903",
  bibdate =      "Sat Aug 13 17:16:20 MDT 1994",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; languages; performance; theory",
  review =       "ACM CR 40746",
  subject =      "D.2.5 Software, SOFTWARE ENGINEERING, Testing and
                 Debugging, Error handling and recovery \\ D.3.4
                 Software, PROGRAMMING LANGUAGES, Processors, Parsing",
}

%%% ====================================================================
%%% Cross-references from CACM:

@Article{Cichelli:1980:MPH,
  author =       "R. J. Cichelli",
  key =          "Cichelli",
  title =        "Minimal Perfect Hash Functions Made Simple",
  journal =      j-CACM,
  volume =       "23",
  number =       "1",
  pages =        "17--19",
  month =        jan,
  year =         "1980",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Mon Apr 24 09:59:18 1995",
  note =         "See remarks in \cite{Jaeschke:1980:CMP}, and the
                 author's response in \cite{Cichelli:1980:CMP}. A simple
                 improvement giving dramatic speedups is described in
                 \cite{Trono:1995:CTS}.",
  acknowledgement = ack-nhfb,
}

@Article{Cichelli:1980:CMP,
  author =       "R. J. Cichelli",
  title =        "On {Cichelli}'s Minimal Perfect Hash Functions
                 Method",
  journal =      j-CACM,
  volume =       "23",
  number =       "12",
  pages =        "728--729",
  month =        dec,
  year =         "1980",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Jul 19 22:50:23 1994",
  note =         "This is the author's response to the comments in
                 \cite{Jaeschke:1980:CMP} about
                 \cite{Cichelli:1980:MPH}.",
  acknowledgement = ack-nhfb,
}

@Article{Jaeschke:1980:CMP,
  author =       "G. Jaeschke and G. Osterburg",
  title =        "On {Cichelli}'s Minimal Perfect Hash Functions
                 Method",
  journal =      j-CACM,
  volume =       "23",
  number =       "12",
  pages =        "728--729",
  month =        dec,
  year =         "1980",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Tue Jul 19 22:51:08 1994",
  note =         "This letter to the editor contains comments on
                 \cite{Cichelli:1980:MPH}, together with a response from
                 R. J. Cichelli \cite{Cichelli:1980:CMP}.",
  acknowledgement = ack-nhfb,
}

@Article{Gonnet:1983:CAD,
  author =       "G. Gonnet and F. W. Tompa",
  title =        "A constructive approach to the design of algorithms
                 and their data structures",
  journal =      j-CACM,
  volume =       "26",
  number =       "11",
  pages =        "912--920",
  month =        nov,
  year =         "1983",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Sat Aug 13 17:16:20 MDT 1994",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; design; documentation; languages;
                 performance",
  review =       "ACM CR 8407-0561",
  subject =      "F.3 Theory of Computation, LOGICS AND MEANINGS OF
                 PROGRAMS, Miscellaneous \\ F.4 Theory of Computation,
                 MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal
                 Languages \\ F.4 Theory of Computation, MATHEMATICAL
                 LOGIC AND FORMAL LANGUAGES, Grammars and Other
                 Rewriting Systems \\ D.3.3 Software, PROGRAMMING
                 LANGUAGES, Language Constructs, Data types and
                 structures E Data, DATA STRUCTURES \\ F.2 Theory of
                 Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
                 COMPLEXITY, Miscellaneous",
}

%%% ====================================================================
%%% Cross-references from FORTRAN-FORUM:

@Article{Berns:1985:SFR,
  author =       "G. M. Berns",
  title =        "Significant {Fortran} reliability problems and what
                 {Fortran 8X} can do about them",
  journal =      j-FORTRAN-FORUM,
  volume =       "4",
  number =       "1",
  pages =        "25--32",
  month =        mar,
  year =         "1985",
  ISSN =         "1061-7264",
  bibdate =      "Sat Aug 13 17:16:20 MDT 1994",
  acknowledgement = ack-nhfb,
  keywords =     "languages; reliability; standardization",
  subject =      "D.3.2 Software, PROGRAMMING LANGUAGES, Language
                 Classifications, FORTRAN 8X \\ D.3.3 Software,
                 PROGRAMMING LANGUAGES, Language Constructs, Data types
                 and structures \\ D.2.1 Software, SOFTWARE ENGINEERING,
                 Requirements/Specifications, Languages \\ D.3.4
                 Software, PROGRAMMING LANGUAGES, Processors,
                 Compilers",
}

@Article{Smith:1985:SPF,
  author =       "B. T. Smith",
  title =        "Software parts in {Fortran 8X}",
  journal =      j-FORTRAN-FORUM,
  volume =       "4",
  number =       "1",
  pages =        "33--38",
  month =        mar,
  year =         "1985",
  ISSN =         "1061-7264",
  bibdate =      "Sat Aug 13 17:16:20 MDT 1994",
  acknowledgement = ack-nhfb,
  keywords =     "documentation; languages; standardization",
  subject =      "D.3.2 Software, PROGRAMMING LANGUAGES, Language
                 Classifications, FORTRAN 8X \\ D.3.3 Software,
                 PROGRAMMING LANGUAGES, Language Constructs, Abstract
                 data types \\ D.3.0 Software, PROGRAMMING LANGUAGES,
                 General, Standards \\ D.2.2 Software, SOFTWARE
                 ENGINEERING, Tools and Techniques, Modules and
                 interfaces \\ D.2.7 Software, SOFTWARE ENGINEERING,
                 Distribution and Maintenance, Documentation",
}

@Article{Wagener:1985:IFG,
  author =       "J. L. Wagener",
  title =        "Is {Fortran} getting too big?",
  journal =      j-FORTRAN-FORUM,
  volume =       "4",
  number =       "2",
  pages =        "16--16",
  month =        jun,
  year =         "1985",
  ISSN =         "1061-7264",
  bibdate =      "Sat Aug 13 17:16:20 MDT 1994",
  acknowledgement = ack-nhfb,
  keywords =     "design; languages",
  subject =      "D.3.2 Software, PROGRAMMING LANGUAGES, Language
                 Classifications, FORTRAN 8X \\ D.3.3 Software,
                 PROGRAMMING LANGUAGES, Language Constructs, Modules,
                 packages",
}

@Article{Aharonian:1985:LKF,
  author =       "G. Aharonian",
  title =        "Let's kill future {Fortran}s",
  journal =      j-FORTRAN-FORUM,
  volume =       "4",
  number =       "3",
  pages =        "21--23",
  month =        oct,
  year =         "1985",
  ISSN =         "1061-7264",
  bibdate =      "Sat Aug 13 17:16:20 MDT 1994",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; languages",
  subject =      "D.3.2 Software, PROGRAMMING LANGUAGES, Language
                 Classifications, FORTRAN 77 \\ D.3.4 Software,
                 PROGRAMMING LANGUAGES, Processors, Compilers \\ D.3.2
                 Software, PROGRAMMING LANGUAGES, Language
                 Classifications, FORTRAN 8X \\ D.3.3 Software,
                 PROGRAMMING LANGUAGES, Language Constructs, Data types
                 and structures",
}

@Article{Aharonian:1985:TCA,
  author =       "Gregory Aharonian",
  title =        "Technical contributions: Automated {Fortran}
                 conversion",
  journal =      j-FORTRAN-FORUM,
  volume =       "4",
  number =       "4",
  pages =        "13--19",
  month =        dec,
  year =         "1985",
  ISSN =         "1061-7264",
  bibdate =      "Sat Aug 17 16:39:26 1996",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; design; languages",
  subject =      "D.3.2 Software, PROGRAMMING LANGUAGES, Language
                 Classifications, FORTRAN \\ I.2.7 Computing
                 Methodologies, ARTIFICIAL INTELLIGENCE, Natural
                 Language Processing, Machine translation \\ D.3.3
                 Software, PROGRAMMING LANGUAGES, Language Constructs,
                 Procedures, functions, and subroutines; \\ D.3.4
                 Software, PROGRAMMING LANGUAGES, Processors, Translator
                 writing systems and compiler generators",
}

@Article{Reid:1987:JRRa,
  author =       "John Reid",
  title =        "{John Reid} reports: {X3J3} meeting, {August 1986}",
  journal =      j-FORTRAN-FORUM,
  volume =       "6",
  number =       "1",
  pages =        "4--77",
  month =        apr,
  year =         "1987",
  bibdate =      "Sat Aug 17 16:38:47 1996",
  acknowledgement = ack-nhfb,
  keywords =     "languages; standardization",
  subject =      "A.0 General Literature, GENERAL, Conference
                 proceedings \\ D.3.2 Software, PROGRAMMING LANGUAGES,
                 Language Classifications, FORTRAN \\ D.3.0 Software,
                 PROGRAMMING LANGUAGES, General, Standards",
}

@Article{Reid:1987:JRRb,
  author =       "John Reid",
  title =        "{John Reid} reports: {X3J3} meeting, {November 1986}",
  journal =      j-FORTRAN-FORUM,
  volume =       "6",
  number =       "1",
  pages =        "8--11",
  month =        apr,
  year =         "1987",
  bibdate =      "Sat Aug 17 16:38:52 1996",
  acknowledgement = ack-nhfb,
  keywords =     "languages; standardization",
  subject =      "A.0 General Literature, GENERAL, Conference
                 proceedings \\ D.3.2 Software, PROGRAMMING LANGUAGES,
                 Language Classifications, FORTRAN \\ D.2.0 Software,
                 SOFTWARE ENGINEERING, General, Protection mechanisms",
}

@Article{Reid:1987:JRRc,
  author =       "John Reid",
  title =        "{John Reid} reports: {X3J3} meeting, {February 1987}",
  journal =      j-FORTRAN-FORUM,
  volume =       "6",
  number =       "1",
  pages =        "12--27",
  month =        apr,
  year =         "1987",
  bibdate =      "Sat Aug 13 17:16:20 MDT 1994",
  acknowledgement = ack-nhfb,
  keywords =     "languages; standardization",
  subject =      "D.3.2 Software, PROGRAMMING LANGUAGES, Language
                 Classifications, FORTRAN \\ A.0 General Literature,
                 GENERAL, Conference proceedings \\ D.3.0 Software,
                 PROGRAMMING LANGUAGES, General, Standards",
}

@Article{Metcalf:1987:FES,
  author =       "M. Metcalf",
  title =        "{Fortran 8X}--the emerging standard",
  journal =      j-FORTRAN-FORUM,
  volume =       "6",
  number =       "1",
  pages =        "28--47",
  month =        apr,
  year =         "1987",
  bibdate =      "Sat Aug 13 17:16:20 MDT 1994",
  acknowledgement = ack-nhfb,
  keywords =     "languages; standardization",
  subject =      "D.3.0 Software, PROGRAMMING LANGUAGES, General,
                 Standards \\ D.3.2 Software, PROGRAMMING LANGUAGES,
                 Language Classifications, FORTRAN \\ K.1 Computing
                 Milieux, THE COMPUTER INDUSTRY, Standards",
}

@Article{Adams:1987:FDF,
  author =       "J. Adams and J. Reid",
  title =        "{Fortran 8X}--the draft {Fortran} standard revision",
  journal =      j-FORTRAN-FORUM,
  volume =       "6",
  number =       "2",
  pages =        "27--38",
  month =        oct,
  year =         "1987",
  bibdate =      "Sat Aug 13 17:16:20 MDT 1994",
  acknowledgement = ack-nhfb,
  keywords =     "languages; standardization",
  subject =      "D.3.2 Software, PROGRAMMING LANGUAGES, Language
                 Classifications, FORTRAN \\ K.1 Computing Milieux, THE
                 COMPUTER INDUSTRY, Standards",
}

@Article{Guinier:1987:FPP,
  author =       "D. Guinier",
  title =        "{Fortran} programs on a personal computer",
  journal =      j-FORTRAN-FORUM,
  volume =       "6",
  number =       "2",
  pages =        "39--47",
  month =        oct,
  year =         "1987",
  bibdate =      "Sat Aug 13 17:16:20 MDT 1994",
  acknowledgement = ack-nhfb,
  keywords =     "design; languages",
  subject =      "D.3.2 Software, PROGRAMMING LANGUAGES, Language
                 Classifications, FORTRAN \\ K.8 Computing Milieux,
                 PERSONAL COMPUTING \\ D.3.4 Software, PROGRAMMING
                 LANGUAGES, Processors, Translator writing systems and
                 compiler generators",
}

@Article{Meissner:1987:CFD,
  author =       "Lorer P. Meissner",
  title =        "Concerning the {Fortran 8X} draft",
  journal =      j-FORTRAN-FORUM,
  volume =       "6",
  number =       "3",
  pages =        "1--31",
  month =        dec,
  year =         "1987",
  bibdate =      "Sat Aug 13 17:16:20 MDT 1994",
  acknowledgement = ack-nhfb,
  keywords =     "languages; standardization",
  subject =      "D.3.2 Software, PROGRAMMING LANGUAGES, Language
                 Classifications, FORTRAN",
}

@Article{Reid:1987:XMN,
  author =       "John Reid",
  title =        "{X3J3} meeting, {November 1987}",
  journal =      j-FORTRAN-FORUM,
  volume =       "6",
  number =       "3",
  pages =        "4--96",
  month =        dec,
  year =         "1987",
  bibdate =      "Sat Aug 13 17:16:20 MDT 1994",
  acknowledgement = ack-nhfb,
  keywords =     "languages; standardization",
  subject =      "D.3.2 Software, PROGRAMMING LANGUAGES, Language
                 Classifications, FORTRAN",
}

@Article{Hybl:1987:C,
  author =       "Albert Hybl",
  title =        "Correspondence",
  journal =      j-FORTRAN-FORUM,
  volume =       "6",
  number =       "3",
  pages =        "10--11",
  month =        dec,
  year =         "1987",
  bibdate =      "Sat Aug 13 17:16:20 MDT 1994",
  acknowledgement = ack-nhfb,
  keywords =     "languages; standardization",
  subject =      "D.3.2 Software, PROGRAMMING LANGUAGES, Language
                 Classifications, FORTRAN",
}

@Article{Schonfelder:1987:PFS,
  author =       "L. Schonfelder and S. Morgan",
  title =        "Pointer functionality Sans data-type",
  journal =      j-FORTRAN-FORUM,
  volume =       "6",
  number =       "3",
  pages =        "12--26",
  month =        dec,
  year =         "1987",
  bibdate =      "Sat Aug 13 17:16:20 MDT 1994",
  acknowledgement = ack-nhfb,
  keywords =     "design; languages; standardization",
  subject =      "D.3.2 Software, PROGRAMMING LANGUAGES, Language
                 Classifications, FORTRAN \\ D.3.3 Software, PROGRAMMING
                 LANGUAGES, Language Constructs",
}

@Article{Lahey:1987:FS,
  author =       "T. Lahey",
  title =        "The {Fortran 8X} standard",
  journal =      j-FORTRAN-FORUM,
  volume =       "6",
  number =       "3",
  pages =        "27--30",
  month =        dec,
  year =         "1987",
  bibdate =      "Sat Aug 13 17:16:20 MDT 1994",
  acknowledgement = ack-nhfb,
  keywords =     "design; languages; standardization",
  subject =      "D.3.2 Software, PROGRAMMING LANGUAGES, Language
                 Classifications, FORTRAN \\ E.1 Data, DATA STRUCTURES
                 \\ K.2 Computing Milieux, HISTORY OF COMPUTING,
                 FORTRAN",
}

@Article{Fullerton:1987:ADF,
  author =       "J. Fullerton",
  title =        "An alternate design for {Fortran 8X}",
  journal =      j-FORTRAN-FORUM,
  volume =       "6",
  number =       "3",
  pages =        "31--40",
  month =        dec,
  year =         "1987",
  bibdate =      "Sat Aug 13 17:16:20 MDT 1994",
  acknowledgement = ack-nhfb,
  keywords =     "design; languages; standardization",
  subject =      "D.3.2 Software, PROGRAMMING LANGUAGES, Language
                 Classifications, FORTRAN",
}

@Article{Miyawaki:1987:FA,
  author =       "S. Miyawaki",
  title =        "{Fortran 8X} abridgement",
  journal =      j-FORTRAN-FORUM,
  volume =       "6",
  number =       "3",
  pages =        "41--78",
  month =        dec,
  year =         "1987",
  bibdate =      "Sat Aug 13 17:16:20 MDT 1994",
  acknowledgement = ack-nhfb,
  keywords =     "languages; standardization",
  subject =      "D.3.2 Software, PROGRAMMING LANGUAGES, Language
                 Classifications, FORTRAN \\ K.2 Computing Milieux,
                 HISTORY OF COMPUTING, FORTRAN \\ D.3.3 Software,
                 PROGRAMMING LANGUAGES, Language Constructs",
}

@Article{Dolan:1988:FD,
  author =       "Kent P. Dolan",
  title =        "{Fortran 8X} discussion",
  journal =      j-FORTRAN-FORUM,
  volume =       "7",
  number =       "1",
  pages =        "17--27",
  month =        apr,
  year =         "1988",
  bibdate =      "Sat Aug 13 17:16:20 MDT 1994",
  acknowledgement = ack-nhfb,
  keywords =     "languages",
  subject =      "D.3.2 Software, PROGRAMMING LANGUAGES, Language
                 Classifications, FORTRAN",
}

@Article{Meissner:1988:MFP,
  author =       "Loren Meissner",
  title =        "More on {Fortran 8X} pointer proposals",
  journal =      j-FORTRAN-FORUM,
  volume =       "7",
  number =       "1",
  pages =        "28--36",
  month =        apr,
  year =         "1988",
  bibdate =      "Sat Aug 13 17:16:20 MDT 1994",
  acknowledgement = ack-nhfb,
  keywords =     "languages",
  subject =      "D.3.2 Software, PROGRAMMING LANGUAGES, Language
                 Classifications, FORTRAN \\ D.3.3 Software, PROGRAMMING
                 LANGUAGES, Language Constructs, Data types and
                 structures",
}

@Article{Meissner:1989:XAD,
  author =       "Loren P. Meissner",
  title =        "{X3J3} avoids deadlock",
  journal =      j-FORTRAN-FORUM,
  volume =       "8",
  number =       "1",
  pages =        "1--53",
  month =        jan,
  year =         "1989",
  bibdate =      "Sat Aug 13 17:16:20 MDT 1994",
  acknowledgement = ack-nhfb,
  keywords =     "languages; standardization",
  subject =      "D.3.0 Software, PROGRAMMING LANGUAGES, General,
                 Standards \\ D.3.2 Software, PROGRAMMING LANGUAGES,
                 Language Classifications, FORTRAN",
}

@Article{Reid:1989:JRR,
  author =       "John Reid",
  title =        "{John Reid} Reports",
  journal =      j-FORTRAN-FORUM,
  volume =       "8",
  number =       "1",
  pages =        "6--32",
  month =        jan,
  year =         "1989",
  bibdate =      "Sat Aug 13 17:16:20 MDT 1994",
  acknowledgement = ack-nhfb,
  keywords =     "languages; standardization",
  subject =      "D.3.2 Software, PROGRAMMING LANGUAGES, Language
                 Classifications, FORTRAN \\ D.3.0 Software, PROGRAMMING
                 LANGUAGES, General, Standards",
}

@Article{Reid:1989:ERC,
  author =       "Edward Reid",
  title =        "{Edward Reid}: some comments on {Fortran 8X}",
  journal =      j-FORTRAN-FORUM,
  volume =       "8",
  number =       "1",
  pages =        "33--36",
  month =        jan,
  year =         "1989",
  bibdate =      "Sat Aug 13 17:16:20 MDT 1994",
  acknowledgement = ack-nhfb,
  keywords =     "languages; standardization",
  subject =      "D.3.2 Software, PROGRAMMING LANGUAGES, Language
                 Classifications, FORTRAN \\ D.3.0 Software, PROGRAMMING
                 LANGUAGES, General, Standards",
}

@Article{Meissner:1989:SF,
  author =       "Loren P. Meissner",
  title =        "Summary of {Fortran 88}",
  journal =      j-FORTRAN-FORUM,
  volume =       "8",
  number =       "2",
  pages =        "15--31",
  month =        may,
  year =         "1989",
  bibdate =      "Sat Aug 13 17:16:20 MDT 1994",
  acknowledgement = ack-nhfb,
  keywords =     "design; languages",
  subject =      "D.3.2 Software, PROGRAMMING LANGUAGES, Language
                 Classifications, FORTRAN",
}

@Article{Adams:1989:SCF,
  author =       "Jeanne C. Adams and Jerrold L. Wagener",
  title =        "Summary of changes to {Fortran} draft",
  journal =      j-FORTRAN-FORUM,
  volume =       "8",
  number =       "3",
  pages =        "13--19",
  month =        aug,
  year =         "1989",
  bibdate =      "Sat Aug 13 17:16:20 MDT 1994",
  acknowledgement = ack-nhfb,
  keywords =     "design; languages; standardization",
  subject =      "D.3.2 Software, PROGRAMMING LANGUAGES, Language
                 Classifications, FORTH \\ D.3.0 Software, PROGRAMMING
                 LANGUAGES, General, Standards \\ D.3.3 Software,
                 PROGRAMMING LANGUAGES, Language Constructs",
}

@Article{Meissner:1989:PIO,
  author =       "Loren P. Meissner",
  title =        "Partial-record input and output",
  journal =      j-FORTRAN-FORUM,
  volume =       "8",
  number =       "3",
  pages =        "20--23",
  month =        aug,
  year =         "1989",
  bibdate =      "Sat Aug 13 17:16:20 MDT 1994",
  acknowledgement = ack-nhfb,
  keywords =     "design; languages; performance",
  subject =      "D.3.2 Software, PROGRAMMING LANGUAGES, Language
                 Classifications, FORTH \\ D.3.0 Software, PROGRAMMING
                 LANGUAGES, General, Standards \\ D.3.3 Software,
                 PROGRAMMING LANGUAGES, Language Constructs,
                 Input/Output",
}

@Article{CBEMA:1989:FD,
  author =       "{Computer and Business Equipment Manufacturers
                 Association (CBEMA)}",
  title =        "{Fortran 8X} draft, {May 1989}: {American National
                 Standard for Information Systems Programming Language
                 Fortran, S8 (X3.9-198x), Revision of X3.9-1978}",
  journal =      j-FORTRAN-FORUM,
  volume =       "8",
  number =       "4",
  pages =        "various",
  month =        dec,
  year =         "1989",
  bibdate =      "Sat Aug 13 17:16:20 MDT 1994",
  acknowledgement = ack-nhfb,
  keywords =     "languages; standardization",
  subject =      "D.3.2 Software, PROGRAMMING LANGUAGES, Language
                 Classifications, FORTRAN 8X \\ D.2.1 Software, SOFTWARE
                 ENGINEERING, Requirements/Specifications",
}

%%% ====================================================================
%%% Cross-references from IEEE-TRANS-SOFTW-ENG:

@Article{Horowitz:1986:SSD,
  author =       "Ellis Horowitz and Ronald C. Williamson",
  title =        "{SODOS}: a software documentation support environment
                 --- its definition",
  journal =      j-IEEE-TRANS-SOFTW-ENG,
  volume =       "SE-12",
  number =       "8",
  pages =        "849--859",
  month =        aug,
  year =         "1986",
  CODEN =        "IESEDJ",
  ISSN =         "0098-5589",
  bibdate =      "Sat Aug 13 17:16:20 MDT 1994",
  acknowledgement = ack-nhfb,
  keywords =     "design; documentation; languages",
  review =       "ACM CR 8706-0481",
  subject =      "D.2.7 Software, SOFTWARE ENGINEERING, Distribution and
                 Maintenance, Documentation \\ D.2.6 Software, SOFTWARE
                 ENGINEERING, Programming Environments, SODOS \\ D.3.2
                 Software, PROGRAMMING LANGUAGES, Language
                 Classifications, SMALLTALK-80 \\ H.2.3 Information
                 Systems, DATABASE MANAGEMENT, Languages, Data
                 manipulation languages (DML) \\ D.2.9 Software,
                 SOFTWARE ENGINEERING, Management, Life cycle \\ D.2.1
                 Software, SOFTWARE ENGINEERING,
                 Requirements/Specifications, Methodologies \\ H.2.1
                 Information Systems, DATABASE MANAGEMENT, Logical
                 Design, Data models \\ G.2.2 Mathematics of Computing,
                 DISCRETE MATHEMATICS, Graph Theory, Network problems
                 \\
                 H.2.m Information Systems, DATABASE MANAGEMENT,
                 Miscellaneous",
}

%%% ====================================================================
%%% Cross-references from INFO-PROC-LETT:

@Article{Grune:1984:HPA,
  author =       "D. Grune",
  title =        "How to produce all sentences from a two-level
                 grammar",
  journal =      j-INFO-PROC-LETT,
  volume =       "19",
  number =       "4",
  pages =        "181--185",
  month =        "??",
  year =         "1984",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190",
  bibdate =      "Sun Sep 18 20:12:36 1994",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; languages; theory",
  review =       "ACM CR 8507-0640",
  subject =      "F.4.2 Theory of Computation, MATHEMATICAL LOGIC AND
                 FORMAL LANGUAGES, Grammars and Other Rewriting Systems,
                 Grammar types \\ D.3 Software, PROGRAMMING LANGUAGES,
                 Formal Definitions and Theory \\ F.4.3 Theory of
                 Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES,
                 Formal Languages, Operations on languages \\ F.4.2
                 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL
                 LANGUAGES, Grammars and Other Rewriting Systems,
                 Parsing",
}

@Article{Kral:1984:SE,
  author =       "J. Kral",
  title =        "On software equations",
  journal =      j-INFO-PROC-LETT,
  volume =       "19",
  number =       "4",
  pages =        "191--196",
  month =        "??",
  year =         "1984",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190",
  bibdate =      "Sun Sep 18 20:12:47 1994",
  acknowledgement = ack-nhfb,
  keywords =     "measurement",
  review =       "ACM CR 8506-0496",
  subject =      "D.2 Software, SOFTWARE ENGINEERING, Metrics",
}

%%% ====================================================================
%%% Cross-references from INT-J-MAN-MACH-STUD:

@Article{Smith:1984:HDI,
  author =       "S. Smith and D. Barnard and I. MacLeod",
  title =        "Holophrasted displays in an interactive environment",
  journal =      j-INT-J-MAN-MACH-STUD,
  volume =       "20",
  number =       "4",
  pages =        "343--355",
  month =        apr,
  year =         "1984",
  bibdate =      "Sat Aug 13 17:16:20 MDT 1994",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; design; experimentation; human factors;
                 languages",
  review =       "ACM CR 8502-0073",
  subject =      "D.2.2 Software, SOFTWARE ENGINEERING, Tools and
                 Techniques, User interfaces \\ D.4.7 Software,
                 OPERATING SYSTEMS, Organization and Design, Interactive
                 systems \\ D.3.4 Software, PROGRAMMING LANGUAGES,
                 Processors, Run-time environments \\ D.2 Software,
                 SOFTWARE ENGINEERING, Programming Environments \\ I.7
                 Computing Methodologies, TEXT PROCESSING, Miscellaneous
                 \\ H.1.2 Information Systems, MODELS AND PRINCIPLES,
                 User/Machine Systems, Human factors \\ D.2.3 Software,
                 SOFTWARE ENGINEERING, Coding, Pretty printers",
}

%%% ====================================================================
%%% Finally, SIGPLAN entries:

@Article{Srinivasan:1979:CFC,
  author =       "B. Srinivasan and V. Gopalakrishna",
  title =        "Control flow complexity and structuredness of
                 programs",
  journal =      j-SIGPLAN,
  volume =       "14",
  number =       "11",
  pages =        "110--115",
  month =        nov,
  year =         "1979",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sat Apr 25 11:46:37 MDT 1998",
  note =         "See comment \cite{Zucconi:1980:CSF}.",
  acknowledgement = ack-nhfb,
  classification = "C6110 (Systems analysis and programming)",
  corpsource =   "Nat. Informatics Centre, New Delhi, India",
  keywords =     "automatic programming; automatically; control flow
                 complexity; restructure programs; structured
                 programming",
  treatment =    "P Practical",
}

@Article{Reynolds:1980:RAA,
  author =       "John C. Reynolds",
  title =        "Reasoning about arrays",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "1",
  pages =        "23--23",
  month =        jan,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:30 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
}

@Article{Beidler:1980:ILD,
  author =       "John Beidler and John Meinke",
  title =        "An intermediate level dynamic storage capability",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "1",
  pages =        "24--33",
  month =        jan,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:30 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6120 (File organisation); C6150J (Operating
                 systems)",
  corpsource =   "Dept. of Math., Univ. of Scranton, Scranton, PA, USA",
  keywords =     "control structures; data structures; dynamic
                 allocation; intermediate level dynamic storage
                 capability; storage allocation",
  treatment =    "P Practical",
}

@Article{Cichelli:1980:PIC,
  author =       "Richard J. Cichelli",
  title =        "{Pascal-I}: interactive, conversational {Pascal-S}",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "1",
  pages =        "34--44",
  month =        jan,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:30 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages)",
  keywords =     "compiler; debugging; debugging system; documentation;
                 formatter; HELP command; interpreter; Pascal; PASCAL I;
                 PASCAL S; source text; stack code; text editor",
  treatment =    "P Practical",
}

@Article{Culik:1980:WFL,
  author =       "Karel Culik",
  title =        "What is a flowchart loop and about structured
                 programming",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "1",
  pages =        "45--57",
  month =        jan,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:30 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6110 (Systems analysis and programming)",
  corpsource =   "Computer Sci. Dept., Pennsylvania State Univ.,
                 University Park, PA, USA",
  keywords =     "ALGOL; flowchart loop; flowcharting; FORTRAN;
                 programming languages; structured programming; syntax",
  treatment =    "P Practical",
}

@Article{Gannon:1980:TTS,
  author =       "John Gannon and Paul McMullin and Richard Hamlet and
                 Mark Ardis",
  title =        "Testing traversable stacks",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "1",
  pages =        "58--65",
  month =        jan,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:30 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6120 (File organisation); C6150G (Diagnostic,
                 testing, debugging and evaluating systems)",
  corpsource =   "Dept. of Computer Sci., Univ. of Maryland, College
                 Park, MD, USA",
  keywords =     "DAISTS; data abstraction; data structures; program
                 testing; testing; traversable stacks",
  treatment =    "P Practical",
}

@Article{Kaye:1980:IPI,
  author =       "Douglas R. Kaye",
  title =        "Interactive {Pascal} input",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "1",
  pages =        "66--68",
  month =        jan,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:30 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages); C6150J (Operating
                 systems)",
  corpsource =   "Rational Data Systems, New York, NY, USA",
  keywords =     "input-output programs; input/output programs programs;
                 interactive input; lazy input; Pascal; PASCAL
                 programs",
  treatment =    "P Practical",
}

@Article{LaPlant:1980:ULA,
  author =       "William P. {LaPlant, Jr.} and Matthew A. Jaro",
  title =        "The {UNIMAC} lexical analyzer",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "1",
  pages =        "69--76",
  month =        jan,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:30 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6150C (Compilers, interpreters and other
                 processors)",
  corpsource =   "Air Force Data Services Center, Washington, DC, USA",
  keywords =     "computer language oriented macro processor; macros;
                 program processors; UNIMAC lexical analyzer",
  treatment =    "P Practical",
}

@Article{Laski:1980:HAP,
  author =       "Janusz W. Laski",
  title =        "A hierarchical approach to program testing",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "1",
  pages =        "77--85",
  month =        jan,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:30 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6150G (Diagnostic, testing, debugging and
                 evaluating systems)",
  corpsource =   "Inst. of Informatics, Tech. Univ. of Gdansk, Gdansk,
                 Poland",
  keywords =     "control; data flow; levels of abstraction; program
                 model; program testing",
  treatment =    "P Practical",
}

@Article{Moss:1980:SPL,
  author =       "C. D. S. Moss",
  title =        "Structures programming with {LOOP} statements",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "1",
  pages =        "86--94",
  month =        jan,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:30 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6110 (Systems analysis and programming)",
  corpsource =   "Computing and Control Dept., Imperial Coll., London,
                 UK",
  keywords =     "loop exits; LOOP statements; structured programming",
  treatment =    "P Practical",
}

@Article{Schoenberger:1980:RMP,
  author =       "Roger Schoenberger",
  title =        "Resource management in {PORTAL}",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "1",
  pages =        "95--102",
  month =        jan,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:30 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages)",
  corpsource =   "Landis and Gyr Zug AG, Zug, Switzerland",
  keywords =     "concurrent PASCAL; interactive program; PORTAL; post
                 mortem dumps; problem oriented languages; resource
                 management",
  treatment =    "P Practical",
}

@Article{Sutton:1980:AUI,
  author =       "Stephen A. Sutton",
  title =        "An algorithm for user interaction",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "1",
  pages =        "103--104",
  month =        jan,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:30 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6110 (Systems analysis and programming)",
  corpsource =   "Naval Res. Lab., Washington, DC, USA",
  keywords =     "structural design; structural programming; structured
                 programming; user interaction",
  treatment =    "P Practical",
}

@Article{Taylor:1980:APL,
  author =       "Richard N. Taylor",
  title =        "Assertions in programming languages",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "1",
  pages =        "105--114",
  month =        jan,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:30 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6150G (Diagnostic, testing, debugging and
                 evaluating systems)",
  corpsource =   "Space and Military Applications Div., Boeing Computer
                 Services Co., Seattle, WA, USA",
  keywords =     "ADA; embedding assertions; HAL/S; procedure oriented
                 languages; program testing; program verification;
                 programming languages",
  treatment =    "P Practical",
}

@Article{Rosen:1980:HPP,
  author =       "Barry K. Rosen",
  title =        "How practical is {POPL?}",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "1",
  pages =        "115--116",
  month =        jan,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:30 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages)",
  corpsource =   "Computer Sci. Dept., IBM Thomas J. Watson Res. Center,
                 Yorktown Heights, NY, USA",
  keywords =     "POPL; problem oriented languages",
  treatment =    "P Practical",
}

@Article{Firestone:1980:ELS,
  author =       "Roger M. Firestone",
  title =        "An experimental {LISP} system for the {Sperry Univac
                 1100} series",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "1",
  pages =        "117--129",
  month =        jan,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:30 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages)",
  corpsource =   "Sperry Univac, Blue Bell, PA, USA",
  keywords =     "compiler; LISP; LISP system; logical structure; Sperry
                 Univac 1100 series",
  treatment =    "P Practical",
}

@Article{Mayor:1980:LNA,
  author =       "Michael A. Mayor",
  title =        "A language for network analysis and definition",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "1",
  pages =        "130--138",
  month =        jan,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:30 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C5620 (Computer networks and techniques); C6110
                 (Systems analysis and programming); C6150J (Operating
                 systems)",
  corpsource =   "Communications Systems Engng., Sperry Univac, Blue
                 Bell, PA, USA",
  keywords =     "computer communication networks; computer networks;
                 data sets; network analysis; network definition;
                 network management services; network topology;
                 operating systems (computers); systems analysis;
                 systems analysts; time sharing systems",
  treatment =    "P Practical",
}

@Article{Mehrlich:1980:PHL,
  author =       "F. P. Mehrlich and S. M. Tanner",
  title =        "Portability: high level language implementation",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "1",
  pages =        "139--145",
  month =        jan,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:30 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6110 (Systems analysis and programming); C6150C
                 (Compilers, interpreters and other processors)",
  corpsource =   "Language Processor Dev., Salt Lake City, UT, USA",
  keywords =     "COBOL compiler project; program compilers; single;
                 single source language; software portability; UTS400
                 Intelligent Terminal",
  treatment =    "P Practical",
}

@Article{Stodola:1980:PPL,
  author =       "Frank W. Stodola",
  title =        "The {PLUS} programming language",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "1",
  pages =        "146--155",
  month =        jan,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:30 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages)",
  corpsource =   "Language Systems, Sperry Univac, Roseville, MN, USA",
  keywords =     "ASCII FORTRAN; compilers; data management systems;
                 HVTS; interpreters; MACRO; operating systems; PL/1;
                 PLUS; PLUS programming language; procedure oriented
                 languages; security facilities; systems programmers;
                 Univac Systems",
  treatment =    "P Practical",
}

@Article{Weidner:1980:CCS,
  author =       "Thomas G. Weidner",
  title =        "{CHAMIL}: a case study in microprogramming language
                 design",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "1",
  pages =        "156--166",
  month =        jan,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:30 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages)",
  corpsource =   "Minicomputer Operations, Sperry Univac, Irvine, CA,
                 USA",
  keywords =     "CHAMIL; control structures; data structures;
                 microprogramming; microprogramming language design;
                 problem oriented languages; translator development",
  treatment =    "P Practical",
}

@Article{Baker:1980:SRI,
  author =       "Henry G. {Baker, Jr.}",
  title =        "A source of redundant identifiers in {PASCAL}
                 programs",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "2",
  pages =        "14--16",
  month =        feb,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sat Apr 25 11:46:37 MDT 1998",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6110 (Systems analysis and programming); C6140D
                 (High level languages)",
  corpsource =   "Computer Sci. Dept., Univ. of Rochester, Rochester,
                 NY, USA",
  keywords =     "cost; Pascal; PASCAL programs; programming; redundant
                 identifiers; symbol tables; symbolic debugging",
  treatment =    "P Practical",
}

@Article{Boute:1980:SAR,
  author =       "Raymond T. Boute",
  title =        "Simplifying {ADA} by removing limitations",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "2",
  pages =        "17--29",
  month =        feb,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:16:53 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages)",
  corpsource =   "Bell Telephone Mfg. Co., Antwerpen, Belgium",
  keywords =     "ADA; exception handling; modules; name equivalence;
                 parameterization problems; procedure oriented
                 languages; procedure oriented languages effects
                 handling; side effects handling; subprograms; type
                 equivalence; types",
  treatment =    "P Practical",
}

@Article{Ganzinger:1980:OIA,
  author =       "Harald Ganzinger and Knut Ripken",
  title =        "Operator identification in {ADA}: formal
                 specification, complexity, and concrete
                 implementation",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "2",
  pages =        "30--42",
  month =        feb,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:16:53 MST 2003",
  bibsource =    "http://portal.acm.org/",
  note =         "See comment \cite{Janas:1980:CSI}.",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages); C6150C (Compilers,
                 interpreters and other processors)",
  corpsource =   "Inst. fur Informatik, Tech. Univ. Munchen, Munchen,
                 West Germany",
  keywords =     "ADA; ADA design contract; ADA test translator;
                 complexity; concrete implementation; expression tree;
                 formal specification; operator identification
                 algorithms; overloading rules; procedure oriented
                 languages; program interpreters",
  treatment =    "P Practical",
}

@Article{Ince:1980:IIL,
  author =       "D. C. Ince",
  title =        "An interpretative implementation of limited entry
                 decision tables in {ALGOL 68}",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "2",
  pages =        "43--45",
  month =        feb,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:16:53 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6120 (File organisation); C6140D (High level
                 languages)",
  corpsource =   "Faculty of Math., Open Univ., Bletchley, UK",
  keywords =     "ALGOL 68; implementation; limited entry decision
                 tables; table lookup; table lookup table lookup",
  treatment =    "P Practical",
}

@Article{Kral:1980:PP,
  author =       "Jaroslav Kr{\'a}l",
  title =        "Parkinson programming",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "2",
  pages =        "46--50",
  month =        feb,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:16:53 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6110 (Systems analysis and programming)",
  corpsource =   "Inst. for Computation Tech., CVUT, Praha,
                 Czechoslovakia",
  keywords =     "Parkinson's laws; software engineering; structured
                 programming",
  treatment =    "P Practical",
}

@Article{Lee:1980:FPS,
  author =       "Godfrey Lee and Tim Boreham and Bob Minns and Fred
                 Smith and Rick Soderstrom",
  title =        "{FORTRAN} programming standards",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "2",
  pages =        "51--63",
  month =        feb,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:16:53 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6110 (Systems analysis and programming); C6140D
                 (High level languages)",
  corpsource =   "Quasar Systems Ltd., Ottawa, Ont., Canada",
  keywords =     "FORTRAN; FORTRAN programming; intermediate programmer;
                 junior programmers; programming; senior programmers;
                 standards; structured programming",
  treatment =    "P Practical",
}

@Article{Silberschatz:1980:ECA,
  author =       "A. Silberschatz and R. B. Kieburtz",
  title =        "The external consistency of abstract data types",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "2",
  pages =        "64--73",
  month =        feb,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:16:53 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6120 (File organisation)",
  corpsource =   "Univ. of Texas, Dallas, TX, USA",
  keywords =     "abstract data types; data structures; data structures
                 type definition; external consistency; specification;
                 type definition",
  treatment =    "P Practical",
}

@Article{Weber:1980:GRA,
  author =       "Manfred Weber and Susan L. Bernstein",
  title =        "Global register allocation for non-equivalent register
                 sets",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "2",
  pages =        "74--81",
  month =        feb,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:16:53 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6120 (File organisation); C6150J (Operating
                 systems)",
  keywords =     "register allocation; register architectures; register
                 sets; source code; storage allocation; structured
                 programming",
  treatment =    "P Practical",
}

@Article{Zucconi:1980:CSF,
  author =       "Linda Zucconi",
  title =        "A comment on {``Control flow complexity and
                 structuredness of programs''} by {Srinivasan} and
                 {Gopalakrishna}",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "2",
  pages =        "82--84",
  month =        feb,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:16:53 MST 2003",
  bibsource =    "http://portal.acm.org/",
  note =         "See \cite{Srinivasan:1979:CFC}.",
  acknowledgement = ack-nhfb,
}

@Article{Anderson:1980:TSL,
  author =       "Bruce Anderson",
  title =        "Type syntax in the language `{C}', an object lesson in
                 syntactic innovation",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "3",
  pages =        "21--27",
  month =        mar,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:16:54 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages)",
  corpsource =   "Man-Machine Lab., Univ. of Essex, Colchester, UK",
  keywords =     "C; compilers; formatter; Interdata 8/32; operating
                 systems; PDP 11; procedure oriented languages; RSX 11;
                 RT 11; syntax; syntax analyzers; systems implementation
                 language; type structure; Unix; user errors; VAX",
  treatment =    "P Practical",
}

@Article{Klaeren:1980:ASS,
  author =       "Herbert A. Klaeren",
  title =        "An abstract software specification technique based on
                 structural recursion",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "3",
  pages =        "28--34",
  month =        mar,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:16:54 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6110 (Systems analysis and programming)",
  corpsource =   "Lehrstuhl fur Informatik II, RWTH Aachen, Aachen, West
                 Germany",
  keywords =     "abstract software specification technique;
                 constructive algebraic methods; mathematical induction;
                 natural numbers; software engineering; software
                 engineering engineering; structural recursion",
  treatment =    "P Practical",
}

@Article{Raiha:1980:BAG,
  author =       "K.-J. Raiha",
  title =        "Bibliography on attribute grammars",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "3",
  pages =        "35--44",
  month =        mar,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sat Apr 25 11:46:37 MDT 1998",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic)",
  corpsource =   "Dept. of Computer Sci., Univ. of Helsinki, Helsinki,
                 Finland",
  keywords =     "attribute grammars; attributed graph grammars;
                 attributed transformation grammars; grammars; semantic
                 attributes; semantic formalisms",
  treatment =    "B Bibliography",
}

@Article{Shaw:1980:TRA,
  author =       "Mary Shaw and Wm. A. Wulf",
  title =        "Toward relaxing assumptions in languages and their
                 implementations",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "3",
  pages =        "45--61",
  month =        mar,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:16:54 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C6140D (High level
                 languages)",
  corpsource =   "Computer Sci. Dept., Carnegie Mellon Univ.,
                 Pittsburgh, PA, USA",
  keywords =     "abstraction techniques; formal languages; involuted
                 code; language decisions; language features; languages;
                 procedure oriented languages; relaxing assumptions",
  treatment =    "G General Review",
}

@Article{Addyman:1980:DPP,
  author =       "A. M. Addyman",
  title =        "A draft proposal for {PASCAL}",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "4",
  pages =        "1--66",
  month =        apr,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:16:54 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages)",
  corpsource =   "Dept. of Computer Sci., Univ. of Manchester,
                 Manchester, UK",
  keywords =     "blocks; compliance; expressions; function
                 declarations; hardware representation; input and
                 output; lexical tokens; PASCAL; Pascal; processors;
                 programs; requirements; standard; standards;
                 statements",
  treatment =    "P Practical",
}

@Article{Addyman:1980:PS,
  author =       "A. M. Addyman",
  title =        "{PASCAL} standardisation",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "4",
  pages =        "67--69",
  month =        apr,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:16:54 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages)",
  corpsource =   "Dept. of Computer Sci., Univ. of Manchester,
                 Manchester, UK",
  keywords =     "British Standards Institution; DPS/13/4; Pascal;
                 PASCAL standardisation; programming languages;
                 standardisation; technical committee",
  treatment =    "P Practical",
}

@Article{Cohen:1980:GNN,
  author =       "Norman H. Cohen",
  title =        "{G{\"o}del} numbers: a new approach to structured
                 programming",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "4",
  pages =        "70--74",
  month =        apr,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:16:54 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6110 (Systems analysis and programming)",
  corpsource =   "Software Res. Group, Sperry Univac, Blue Bell, PA,
                 USA",
  keywords =     "computable function; G{\"o}del numbers; programming
                 problems; structured programming; universal Turing
                 machine",
  treatment =    "P Practical",
}

@Article{Harel:1980:DCO,
  author =       "David Harel",
  title =        "``do considered od'' considered odder than ``do
                 considered ob''",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "4",
  pages =        "75--75",
  month =        apr,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:16:54 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6110 (Systems analysis and programming)",
  corpsource =   "IBM Thomas J. Watson Res. Center, Yorktown Heights,
                 NY, USA",
  keywords =     "keywords; programming; programming languages",
  treatment =    "P Practical",
}

@Article{Hetrick:1980:CCH,
  author =       "Brian A. Hetrick and H. Eisenberg",
  title =        "Confinement of a class of harmful effects of the goto
                 statement",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "4",
  pages =        "76--78",
  month =        apr,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:16:54 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6110 (Systems analysis and programming)",
  corpsource =   "Digital Equipment Corp., Merrimack, NH, USA",
  keywords =     "goto statement; programming; statement sequences",
  treatment =    "P Practical",
}

@Article{Schild:1980:RTP,
  author =       "R. Schild and H. Lienhard",
  title =        "Real-time programming in {PORTAL}",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "4",
  pages =        "79--92",
  month =        apr,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:16:54 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages)",
  corpsource =   "Central Res. Lab., Landis and Gyr Zug Corp., Zug,
                 Switzerland",
  keywords =     "holons; modules; PORTAL; procedure oriented languages;
                 real time programming",
  treatment =    "P Practical",
}

@Article{Cichelli:1980:FP,
  author =       "Richard J. Cichelli",
  title =        "Fixing {PASCAL}'s {I/O}",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "5",
  pages =        "19--19",
  month =        may,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:16:55 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6120 (File organisation); C6140D (High level
                 languages); C6150J (Operating systems)",
  corpsource =   "ANPA/RI, Easton, PA, USA",
  keywords =     "file facility; file organisation; input-output
                 programs; PASCAL; Pascal; relative record I/O; terminal
                 I/O",
  treatment =    "P Practical",
}

@Article{Crowley:1980:SPR,
  author =       "Charles Crowley",
  title =        "Structured programming is reductionistic!",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "5",
  pages =        "20--23",
  month =        may,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:16:55 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6110 (Systems analysis and programming)",
  corpsource =   "Computing and Information Sci., Univ. of New Mexico,
                 Albuquerque, NM, USA",
  keywords =     "block structure; closed subroutines; complexity;
                 control structures; looping; sequencing; structured
                 programming",
  treatment =    "P Practical",
}

@Article{Ellis:1980:LS,
  author =       "John R. Ellis",
  title =        "A {Lisp} shell",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "5",
  pages =        "24--34",
  month =        may,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:16:55 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages)",
  corpsource =   "Computer Sci. Dept., Yale Univ., New Haven, CT, USA",
  keywords =     "INTERLISP; LISP; shell system; UNIX system",
  treatment =    "P Practical",
}

@Article{Jones:1980:TPP,
  author =       "Douglas W. Jones",
  title =        "Tasking and parameters: a problem area in {Ada}",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "5",
  pages =        "37--40",
  month =        may,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:16:55 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages)",
  corpsource =   "Dept. of Computer Sci., Univ. of Illinois, Urbana, IL,
                 USA",
  keywords =     "Ada; data structures; parameters; procedure oriented
                 languages; tasking",
  treatment =    "P Practical",
}

@Article{Leinbaugh:1980:IC,
  author =       "Dennis W. Leinbaugh",
  title =        "Indenting for the compiler",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "5",
  pages =        "41--48",
  month =        may,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:16:55 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6150C (Compilers, interpreters and other
                 processors)",
  corpsource =   "Computer Sci. Dept., Univ. of Nebraska, Lincoln, NE,
                 USA",
  keywords =     "block structure; closing keywords; compiler; control
                 statement; indent statements; indentation rule; PASCAL
                 like language; program compilers",
  treatment =    "P Practical",
}

@Article{Levine:1980:WLB,
  author =       "John Levine",
  title =        "Why a {Lisp-based} command language?",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "5",
  pages =        "49--53",
  month =        may,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:16:55 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages)",
  corpsource =   "Dept. of Computer Sci., Yale Univ., New Haven, CT,
                 USA",
  keywords =     "LISP; programmable system command languages",
  treatment =    "G General Review",
}

@Article{Ljungkvist:1980:PEF,
  author =       "Sten Ljungkvist",
  title =        "{Pascal} and existing {Fortran} files",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "5",
  pages =        "54--55",
  month =        may,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:16:55 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages)",
  corpsource =   "Sveriges Meteorologiska och Hydrologiska Inst.,
                 Norrk{\"o}ping, Sweden",
  keywords =     "existing FORTRAN files; PASCAL; Pascal",
  treatment =    "P Practical",
}

@Article{Noodt:1980:SEP,
  author =       "Terje Noodt and Dag Belsnes",
  title =        "A simple extension of {PASCAL} for quasi-parallel
                 processing",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "5",
  pages =        "56--65",
  month =        may,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:16:55 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages); C6150J (Operating
                 systems)",
  corpsource =   "Computing Center, Univ. of Oslo, Oslo, Norway",
  keywords =     "parallel processing; Pascal; PASCAL; PASCAL compiler;
                 QPP; quasi parallel processing",
  treatment =    "P Practical",
}

@Article{VanZandt:1980:VTS,
  author =       "John {Van Zandt}",
  title =        "On visual and textual structures",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "5",
  pages =        "78--80",
  month =        may,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:16:55 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6110 (Systems analysis and programming)",
  corpsource =   "Electrical Engng. and Computer Sci. Dept., Univ. of
                 California, San Diego, CA, USA",
  keywords =     "formatting; program texts; structured programming;
                 textual structures",
  treatment =    "P Practical",
}

@Article{Galkowski:1980:CDC,
  author =       "J. T. Galkowski",
  title =        "A critique of the {DOD} common language effort",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "6",
  pages =        "15--18",
  month =        jun,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:16:55 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages)",
  keywords =     "ADA; common language; procedure oriented languages;
                 programming language; STEELMAN",
  treatment =    "A Application; G General Review",
}

@Article{Blatt:1980:GBS,
  author =       "D. W. E. Blatt",
  title =        "On the great big substitution problem",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "6",
  pages =        "19--27",
  month =        jun,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:16:55 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6120 (File organisation); C6130 (Data handling
                 techniques)",
  corpsource =   "Dept. of Math., Univ. of Newcastle, Newcastle, NSW,
                 Australia",
  keywords =     "data handling; SNOBOL; string processing; string
                 processing languages; substitution problem; text
                 editing; text editors; virtual storage",
  treatment =    "A Application",
}

@Article{Bradshaw:1980:PSL,
  author =       "Franklyn T. Bradshaw and George W. Ernst and Raymond
                 J. Hookway and William F. Ogden",
  title =        "Procedure semantics and language definition",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "6",
  pages =        "28--33",
  month =        jun,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:16:55 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages)",
  corpsource =   "Computer Engng. and Sci. Dept., Case Inst. of
                 Technol., Case Western Reserve Univ., Cleveland, OH,
                 USA",
  keywords =     "distributed computing; language definition; procedure
                 calls; procedure oriented languages; procedure
                 semantics",
  treatment =    "A Application",
}

@Article{Foster:1980:PMP,
  author =       "Victor S. Foster",
  title =        "Performance measurement of a {Pascal} compiler",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "6",
  pages =        "34--38",
  month =        jun,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:16:55 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages); C6150C (Compilers,
                 interpreters and other processors)",
  corpsource =   "Dept. of Appl. Math. and Computer Sci., Univ. of
                 Virginia, Charlottesville, VA, USA",
  keywords =     "execution efficiency; Pascal; PASCAL compiler;
                 performance measurement; program compilers",
  treatment =    "A Application",
}

@Article{Mahjoub:1980:NMC,
  author =       "Ahmed Mahjoub",
  title =        "A new {Modula} compiler for the {LSI-11}",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "6",
  pages =        "39--45",
  month =        jun,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:16:55 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6150C (Compilers, interpreters and other
                 processors)",
  corpsource =   "Philips Labs., Briarcliff Manor, NY, USA",
  keywords =     "LSI 11 microprocessor; Modula compiler; PASCAL;
                 program compilers",
  treatment =    "A Application",
}

@Article{McNeil:1980:PPE,
  author =       "Michael McNeil and William Tracz",
  title =        "{PL/I} program efficiency",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "6",
  pages =        "46--60",
  month =        jun,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:16:55 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6110 (Systems analysis and programming); C6140D
                 (High level languages)",
  corpsource =   "Federal Systems Div., IBM Corp., Owego, NY, USA",
  keywords =     "bit string manipulation; character string
                 manipulation; logical switches; multiway branching;
                 PL/1; PL/I compiler; PL/I program; program efficiency;
                 programming",
  treatment =    "A Application",
}

@Article{Meek:1980:SAP,
  author =       "Brian Meek",
  title =        "Serial attitudes, parallel attitudes",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "6",
  pages =        "61--63",
  month =        jun,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:16:55 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6150C (Compilers, interpreters and other
                 processors)",
  corpsource =   "Computer Unit, Queen Elizabeth Coll., Univ. of London,
                 London, UK",
  keywords =     "parallel attitudes; program compilers; serial
                 attitudes",
  treatment =    "A Application",
}

@Article{Moitra:1980:NAS,
  author =       "Abha Moitra",
  title =        "A note on algebraic specification of binary trees",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "6",
  pages =        "64--67",
  month =        jun,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:16:55 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic)",
  corpsource =   "Tata Inst. of Fundamental Res., Bombay, India",
  keywords =     "algebraic specification; binary trees; formal logic;
                 trees (mathematics)",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Reid:1980:FMF,
  author =       "J. K. Reid",
  title =        "Functions for manipulating floating-point numbers",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "6",
  pages =        "68--76",
  month =        jun,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:16:55 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C5230 (Digital arithmetic methods)",
  corpsource =   "Computer Sci. and Systems Div., AERE, Harwell, Didcot,
                 UK",
  keywords =     "complete computer programs; digital arithmetic;
                 floating point numbers; function manipulation;
                 portability; software portability",
  treatment =    "T Theoretical or Mathematical",
}

@Article{vandenBos:1980:CAP,
  author =       "Jan van den Bos",
  title =        "Comments on {ADA} process communication",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "6",
  pages =        "77--81",
  month =        jun,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:16:55 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages)",
  corpsource =   "Dept. of Informatics, Univ. of Nijmegen, Nijmegen,
                 Netherlands",
  keywords =     "ADA; procedure oriented languages; process
                 communication",
  treatment =    "A Application",
}

@Article{Chandy:1980:SMD,
  author =       "K. M. Chandy and J. Misra",
  title =        "A simple model of distributed programs based on
                 implementation-hiding and process autonomy",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "7--8",
  pages =        "26--35",
  month =        jul # "\slash " # aug,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:16:56 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6150J (Operating systems)",
  corpsource =   "Univ. of Texas, Austin, TX, USA",
  keywords =     "binding; distributed processing; distributed programs;
                 implementation hiding; invoked computation; parameter
                 passing; procedures; sequential programming",
  treatment =    "A Application",
}

@Article{DeRemer:1980:SDP,
  author =       "Frank DeRemer and Tom Pennello and Richard Meyers",
  title =        "A syntax diagram for (preliminary) {Ada}",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "7--8",
  pages =        "36--47",
  month =        jul # "\slash " # aug,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:16:56 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C6140D (High level
                 languages)",
  corpsource =   "Univ. of California, Santa Cruz, CA, USA",
  keywords =     "Ada; grammars; procedure oriented languages; regular
                 right part grammar; syntax diagram",
  treatment =    "A Application; T Theoretical or Mathematical",
}

@Article{Glass:1980:PWF,
  author =       "Robert L. Glass",
  title =        "The ``project which failed'' which succeeded",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "7--8",
  pages =        "48--51",
  month =        jul # "\slash " # aug,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:16:56 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6000 (Computer software)",
  keywords =     "computer software; programmers",
  treatment =    "G General Review",
}

@Article{Ince:1980:PIO,
  author =       "D. C. Ince",
  title =        "Paged input\slash output in some high level
                 languages",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "7--8",
  pages =        "52--57",
  month =        jul # "\slash " # aug,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:16:56 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6120 (File organisation); C6140D (High level
                 languages); C6160 (Database management systems
                 (DBMS))",
  corpsource =   "Faculty of Math., Open Univ., Milton Keynes, UK",
  keywords =     "algebraic manipulation; data structures; database
                 management systems; DBMS; file based data structures;
                 file organisation; high level languages; paging;
                 Pascal; procedure oriented languages; random access
                 input/output; virtual storage",
  treatment =    "A Application",
}

@Article{Jackel:1980:FPP,
  author =       "Manfred Jackel",
  title =        "A formatting parser for {PASCAL} programs",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "7--8",
  pages =        "58--63",
  month =        jul # "\slash " # aug,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:16:56 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C6140D (High level
                 languages)",
  corpsource =   "Seminar fur Informatik, EWH Rheinland-Pfalz, Koblenz,
                 West Germany",
  keywords =     "automatic formatting; formatting parser; grammars;
                 PASCAL; Pascal; syntax",
  treatment =    "A Application",
}

@Article{Nicolescu:1980:SSC,
  author =       "Radu Nicolescu",
  title =        "Some short comments on the definition and the
                 documentation of the {Ada} programming language",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "7--8",
  pages =        "64--71",
  month =        jul # "\slash " # aug,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:16:56 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages)",
  corpsource =   "Computing Centre, Univ. of Bucharest, Bucharest,
                 Romania",
  keywords =     "Ada; Ada design; documentation; procedure oriented
                 languages",
  treatment =    "A Application",
}

@Article{Pagan:1980:NSA,
  author =       "Frank G. Pagan",
  title =        "Nested sublanguages of {ALGOL 68} for teaching
                 purposes",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "7--8",
  pages =        "72--81",
  month =        jul # "\slash " # aug,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:16:56 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C0220 (Computing education and training); C6140D
                 (High level languages)",
  corpsource =   "Dept. of Computer Sci., Southern Illinois Univ.,
                 Carbondale, IL, USA",
  keywords =     "ALGOL 68; computer science education; nested
                 sublanguages; teaching",
  treatment =    "A Application",
}

@Article{Pennello:1980:SOI,
  author =       "Tom Pennello and Frank DeRemer and Richard Meyers",
  title =        "A simplified operator identification scheme for
                 {Ada}",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "7--8",
  pages =        "82--87",
  month =        jul # "\slash " # aug,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:16:56 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C6140D (High level
                 languages)",
  corpsource =   "Univ. of California, Santa Cruz, CA, USA",
  keywords =     "Ada; expression tree; operator identification scheme;
                 procedure oriented languages; trees (mathematics)",
  treatment =    "A Application",
}

@Article{Smart:1980:PLV,
  author =       "Robert Smart",
  title =        "Pointers to local variables",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "7--8",
  pages =        "88--89",
  month =        jul # "\slash " # aug,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:16:56 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory)",
  corpsource =   "La Trobe Univ., Bundoora, Vic., Australia",
  keywords =     "Ada; PASCAL; pointers; programming theory; SIMULA;
                 variables",
  treatment =    "A Application",
}

@Article{Campbell:1980:OPP,
  author =       "Roy H. Campbell and Robert B. Kolstad",
  title =        "An overview of {Path Pascal}'s design",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "9",
  pages =        "13--14",
  month =        sep,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:16:57 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6120 (File organisation); C6140D (High level
                 languages)",
  corpsource =   "Dept. of Computer Sci., Univ. of Illinois, Urbana, IL,
                 USA",
  keywords =     "data structures; Pascal; path expressions; Path
                 Pascal; systems programming language",
  treatment =    "P Practical",
}

@Article{Kolstad:1980:PPU,
  author =       "Robert B. Kolstad and Roy H. Campbell",
  title =        "{Path Pascal} user manual",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "9",
  pages =        "15--24",
  month =        sep,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:16:57 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages)",
  corpsource =   "Dept. of Computer Sci., Univ. of Illinois, Urbana, IL,
                 USA",
  keywords =     "functions; PASCAL; Pascal; Path Pascal user manual",
  treatment =    "P Practical",
}

@Article{Chiarini:1980:FLC,
  author =       "A. Chiarini",
  title =        "On {FP} languages combining forms",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "9",
  pages =        "25--27",
  month =        sep,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:16:57 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages)",
  corpsource =   "CNEN-CSR 'E. Clementel', Bologna, Italy",
  keywords =     "ASCII terminals; combining forms; FP languages;
                 functional programming; grammars; LL (1) grammar;
                 procedure oriented languages; typing",
  treatment =    "P Practical",
}

@Article{Dodd:1980:SCR,
  author =       "W. P. Dodd",
  title =        "Some comments on a recent article by Salvadori and
                 Dumont regarding the evaluation of compound conditional
                 expressions",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "9",
  pages =        "28--31",
  month =        sep,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:16:57 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6120 (File organisation)",
  corpsource =   "Computer Centre, Univ. of Birmingham, Birmingham, UK",
  keywords =     "compound conditional expressions; data structures",
  treatment =    "P Practical",
}

@Article{Hanata:1980:CCP,
  author =       "Syuetsu Hanata and Tadamasa Satoh",
  title =        "Compact Chart-a program logic notation with high
                 describability and understandability",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "9",
  pages =        "32--38",
  month =        sep,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:16:57 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6110 (Systems analysis and programming)",
  corpsource =   "Data Processing Div., Yokosuka Electrical
                 Communication Lab., Kanagawa-ken, Japan",
  keywords =     "control transfer; flow chart notation; flowcharting;
                 high describability; process description; program logic
                 notation; understandability",
  treatment =    "P Practical",
}

@Article{Janas:1980:COI,
  author =       "J{\"u}rgen M. Janas",
  title =        "A comment on `operator identification in {ADA}' by
                 {Ganzinger} and {Ripken}",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "9",
  pages =        "39--43",
  month =        sep,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:16:57 MST 2003",
  bibsource =    "http://portal.acm.org/",
  note =         "See \cite{Ganzinger:1980:OIA}.",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages)",
  corpsource =   "Hochschule der Bundeswehr Munchen, Fachbereich
                 Informatik, Munchen, West Germany",
  keywords =     "ADA; ADA overloading rule; expression trees; operator
                 identification; passes; procedure oriented languages",
  treatment =    "P Practical",
}

@Article{Sharp:1980:DOP,
  author =       "John A. Sharp",
  title =        "Data oriented program design",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "9",
  pages =        "44--57",
  month =        sep,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:16:57 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6110 (Systems analysis and programming); C6140D
                 (High level languages)",
  corpsource =   "Dept. of Computer Sci., Univ. Coll. of Swansea,
                 Swansea, UK",
  keywords =     "concurrency; data oriented approach; natural
                 programming tool; parallel computation; parallel
                 processing; problem oriented languages; program design;
                 programming approach; programming language; software
                 engineering",
  treatment =    "P Practical",
}

@Article{Yucel:1980:BPF,
  author =       "M. Nadir Y{\"u}cel and Bo{\u{g}}os Pinar",
  title =        "Bit processing with {FORTRAN}",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "9",
  pages =        "58--60",
  month =        sep,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:16:57 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6130 (Data handling techniques); C6140D (High level
                 languages)",
  corpsource =   "Istanbul Tech. Univ., Inst. of Computer Sci.,
                 Istanbul, Turkey",
  keywords =     "bit processing; data handling; FORTRAN; FORTRAN IV",
  treatment =    "P Practical",
}

@Article{Takaoka:1980:IHV,
  author =       "Tadao Takaoka",
  title =        "Introduction of history to variables",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "9",
  pages =        "61--63",
  month =        sep,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:16:57 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6110 (Systems analysis and programming); C6130
                 (Data handling techniques)",
  corpsource =   "Dept. of Computer Sci., Univ. of Canterbury,
                 Christchurch, New Zealand",
  keywords =     "current value; data handling; history to variables;
                 programming; variables",
  treatment =    "P Practical",
}

@Article{Tanik:1980:TEP,
  author =       "Murat M. Tanik",
  title =        "Two experiments on a program complexity perception by
                 programmers",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "9",
  pages =        "64--66",
  month =        sep,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:16:57 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6110 (Systems analysis and programming)",
  corpsource =   "A.A. Collins Inc., College Station, TX, USA",
  keywords =     "COBOL; FORTRAN; high level languages; program
                 complexity perception; programmers; software
                 engineering",
  treatment =    "P Practical; X Experimental",
}

@Article{Ashcroft:1980:SCM,
  author =       "Ed Ashcroft and Bill Wadge",
  title =        "Some common misconceptions about {Lucid}",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "10",
  pages =        "15--26",
  month =        oct,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:16:57 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages)",
  corpsource =   "Computer Sci. Dept., Univ. of Waterloo, Waterloo,
                 Ont., Canada",
  keywords =     "high level languages; Lucid; programming language",
  treatment =    "P Practical",
}

@Article{Brender:1980:CAA,
  author =       "Ronald F. Brender",
  title =        "The case against {Ada} as an {APSE} command language",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "10",
  pages =        "27--34",
  month =        oct,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:16:57 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages)",
  corpsource =   "Digital Equipment Corp., Maynard, MA, USA",
  keywords =     "Ada; APSE command language; JCL; job control
                 languages",
  treatment =    "P Practical",
}

@Article{Gimpel:1980:CMP,
  author =       "James F. Gimpel",
  title =        "Contour: a method of preparing structured flowcharts",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "10",
  pages =        "35--41",
  month =        oct,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:16:57 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6110 (Systems analysis and programming)",
  corpsource =   "Sperry Univac, Blue Bell, PA, USA",
  keywords =     "computer graphics; conditionals; Contour;
                 flowcharting; loops; program's structure; structured
                 flowcharts",
  treatment =    "P Practical",
}

@Article{Gobin:1980:FHP,
  author =       "Marc A. Gobin",
  title =        "File handling in programming languages",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "10",
  pages =        "42--47",
  month =        oct,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:16:57 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6120 (File organisation); C6130 (Data handling
                 techniques)",
  corpsource =   "Military Acad., Brussels, Belgium",
  keywords =     "ALGOL68; COBOL; data handling; file organisation;
                 files; PL/1; programming languages; RPG",
  treatment =    "P Practical",
}

@Article{Goodenough:1980:AJS,
  author =       "J. B. Goodenough",
  title =        "{Ada (July 1980)} syntax cross reference listing",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "10",
  pages =        "48--56",
  month =        oct,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sat Apr 25 11:46:37 MDT 1998",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages)",
  corpsource =   "SofTech Inc., Waltham, MA, USA",
  keywords =     "Ada; Ada (July 1980) syntax cross reference listing;
                 July 1980 Ada Reference Manual",
  treatment =    "P Practical",
}

@Article{Ledgard:1980:HEV,
  author =       "Henry F. Ledgard",
  title =        "A human engineered variant of {BNF}",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "10",
  pages =        "57--62",
  month =        oct,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:16:57 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6110 (Systems analysis and programming)",
  corpsource =   "Computer and Information Sci. Dept., Univ. of
                 Massachusetts, Amherst, MA, USA",
  keywords =     "BNF; program and system documentation; programming
                 languages",
  treatment =    "P Practical",
}

@Article{Moffat:1980:CPB,
  author =       "D. V. Moffat",
  title =        "A categorized {Pascal} bibliography {(June, 1980)}",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "10",
  pages =        "63--75",
  month =        oct,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sat Apr 25 11:46:37 MDT 1998",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages)",
  corpsource =   "North Carolina State Univ., Raleigh, NC, USA",
  keywords =     "monographs; Pascal; PASCAL; Pascal bibliography;
                 professional journals; texts",
  treatment =    "B Bibliography",
}

@Article{Tai:1980:CSI,
  author =       "Kuo-Chung Tai and Ken Garrard",
  title =        "Comments on the suggested implementation of tasking
                 facilities in the {'Rationale for the design of the Ada
                 programming language'}",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "10",
  pages =        "76--84",
  month =        oct,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:16:57 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages); C6150C (Compilers,
                 interpreters and other processors)",
  corpsource =   "Dept. of Computer Sci., North Carolina State Univ.,
                 Raleigh, NC, USA",
  keywords =     "Ada; Ada compilers; Ada programming language; program
                 compilers; tasking facilities",
  treatment =    "P Practical",
}

@Article{Yehudai:1980:AIV,
  author =       "Amiram Yehudai",
  title =        "Automatic indention versus program formatting",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "10",
  pages =        "85--87",
  month =        oct,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:16:57 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6110 (Systems analysis and programming)",
  corpsource =   "Dept. of Math. Sci., Tel-Aviv Univ., Tel-Aviv,
                 Israel",
  keywords =     "automatic indention; program and system documentation;
                 program formating; programmer's style",
  treatment =    "P Practical",
}

@Article{Goodenough:1980:ACV,
  author =       "John B. Goodenough",
  title =        "The {Ada} compiler validation capability",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "11",
  pages =        "1--8",
  month =        nov,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:31 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages); C6150C (Compilers,
                 interpreters and other processors)",
  conflocation = "Boston, MA, USA; 9-11 Dec. 1980",
  conftitle =    "Proceedings of the ACM-SIGPLAN Symposium on the Ada
                 Programming Language",
  corpsource =   "SofTech Inc., Waltham, MA, USA",
  keywords =     "Ada; compiler validation capability; documentation;
                 program compilers",
  treatment =    "A Application",
}

@Article{Notkin:1980:EPA,
  author =       "David S. Notkin",
  title =        "An experience with parallelism in {Ada}",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "11",
  pages =        "9--15",
  month =        nov,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:31 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages)",
  conflocation = "Boston, MA, USA; 9-11 Dec. 1980",
  conftitle =    "Proceedings of the ACM-SIGPLAN Symposium on the Ada
                 Programming Language",
  corpsource =   "Dept. of Computer Sci., Carnegie-Mellon Univ.,
                 Pittsburgh, PA, USA",
  keywords =     "Ada; parallelism; tasking structure",
  treatment =    "A Application",
}

@Article{Fairley:1980:ADT,
  author =       "Richard E. Fairley",
  title =        "{Ada} debugging and testing support environments",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "11",
  pages =        "16--25",
  month =        nov,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:31 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages); C6150G (Diagnostic,
                 testing, debugging and evaluating systems)",
  conflocation = "Boston, MA, USA; 9-11 Dec. 1980",
  conftitle =    "Proceedings of the ACM-SIGPLAN Symposium on the Ada
                 Programming Language",
  corpsource =   "Computer Sci. Dept., Colorado State Univ., Fort
                 Collins, CO, USA",
  keywords =     "Ada; APSE; debugging; program debugging; program
                 testing; Programming Support Environments; source code;
                 testing",
  treatment =    "A Application",
}

@Article{Duncan:1980:UAI,
  author =       "A. G. Duncan and J. S. Hutchison",
  title =        "Using {Ada} for industrial embedded microprocessor
                 applications",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "11",
  pages =        "26--35",
  month =        nov,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:31 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages)",
  conflocation = "Boston, MA, USA; 9-11 Dec. 1980",
  conftitle =    "Proceedings of the ACM-SIGPLAN Symposium on the Ada
                 Programming Language",
  corpsource =   "General Electric Res. and Dev. Center, Schenectady,
                 NY, USA",
  keywords =     "Ada; compiler; high level implementation language;
                 industrial embedded microprocessor applications;
                 storage allocation; storage allocator",
  treatment =    "A Application",
}

@Article{Goos:1980:TCF,
  author =       "Gerhard Goos and Georg Winterstein",
  title =        "Towards a compiler front-end for {Ada}",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "11",
  pages =        "36--46",
  month =        nov,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:31 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages); C6150C (Compilers,
                 interpreters and other processors)",
  conflocation = "Boston, MA, USA; 9-11 Dec. 1980",
  conftitle =    "Proceedings of the ACM-SIGPLAN Symposium on the Ada
                 Programming Language",
  corpsource =   "Inst. fur Informatik, Univ. of Karlsruhe, Karlsruhe,
                 West Germany",
  keywords =     "Ada; AIDA; attributed structure tree; compiler
                 front-end; program compilers",
  treatment =    "A Application",
}

@Article{Persch:1980:OPA,
  author =       "Guido Persch and Georg Winterstein and Manfred
                 Dausmann and Sophia Drossopoulou",
  title =        "Overloading in preliminary {Ada}",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "11",
  pages =        "47--56",
  month =        nov,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:31 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages)",
  conflocation = "Boston, MA, USA; 9-11 Dec. 1980",
  conftitle =    "Proceedings of the ACM-SIGPLAN Symposium on the Ada
                 Programming Language",
  corpsource =   "Inst. fur Informatik II, Univ. Karlsruhe, Karlsruhe,
                 West Germany",
  keywords =     "Ada; aggregates; bottom-up; enumeration literals;
                 operators; overloading; semantic analysis; subprograms;
                 top-down; top-subprograms",
  treatment =    "A Application",
}

@Article{Belmont:1980:TRA,
  author =       "Peter A. Belmont",
  title =        "Type resolution in {Ada}: an implementation report",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "11",
  pages =        "57--61",
  month =        nov,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:31 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages)",
  conflocation = "Boston, MA, USA; 9-11 Dec. 1980",
  conftitle =    "Proceedings of the ACM-SIGPLAN Symposium on the Ada
                 Programming Language",
  corpsource =   "Intermetrics Inc., Cambridge, MA, USA",
  keywords =     "Ada; semantic analyzer; type resolution",
  treatment =    "A Application",
}

@Article{Sherman:1980:FSA,
  author =       "Mark S. Sherman and Martha S. Borkan",
  title =        "A flexible semantic analyzer for {Ada}",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "11",
  pages =        "62--71",
  month =        nov,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:31 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages); C6150C (Compilers,
                 interpreters and other processors)",
  conflocation = "Boston, MA, USA; 9-11 Dec. 1980",
  conftitle =    "Proceedings of the ACM-SIGPLAN Symposium on the Ada
                 Programming Language",
  corpsource =   "Dept. of Computer Sci., Carnegie-Mellon Univ.,
                 Pittsburgh, PA, USA",
  keywords =     "Ada; compilers; flexible semantic analyzer;
                 preliminary Ada; program compilers",
  treatment =    "A Application",
}

@Article{Rosenberg:1980:CAC,
  author =       "Jonathan Rosenberg and David Alex Lamb and Andy Hisgen
                 and Mark Sherman",
  title =        "The {Charrette Ada} compiler",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "11",
  pages =        "72--81",
  month =        nov,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:31 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages); C6150C (Compilers,
                 interpreters and other processors)",
  conflocation = "Boston, MA, USA; 9-11 Dec. 1980",
  conftitle =    "Proceedings of the ACM-SIGPLAN Symposium on the Ada
                 Programming Language",
  corpsource =   "Dept. of Computer Sci., Carnegie-Mellon Univ.,
                 Pittsburgh, PA, USA",
  keywords =     "Ada; Charrette Ada compiler; machine language;
                 preliminary Ada; program compilers; source program",
  treatment =    "A Application",
}

@Article{Hisgen:1980:RRA,
  author =       "Andy Hisgen and David Alex Lamb and Jonathan Rosenberg
                 and Mark Sherman",
  title =        "A runtime representation for {Ada} variables and
                 types",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "11",
  pages =        "82--90",
  month =        nov,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:31 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages)",
  conflocation = "Boston, MA, USA; 9-11 Dec. 1980",
  conftitle =    "Proceedings of the ACM-SIGPLAN Symposium on the Ada
                 Programming Language",
  corpsource =   "Dept. of Computer Sci., Carnegie-Mellon Univ.,
                 Pittsburgh, PA, USA",
  keywords =     "Ada; Charrette Ada implementation; runtime
                 representation; types; variables",
  treatment =    "A Application",
}

@Article{Sherman:1980:ACG,
  author =       "Mark Sherman and Andy Hisgen and David Alex Lamb and
                 Jonathan Rosenberg",
  title =        "An {Ada} code generator for {VAX 11\slash 780} with
                 {Unix}",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "11",
  pages =        "91--100",
  month =        nov,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:31 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages); C6150C (Compilers,
                 interpreters and other processors); C6150J (Operating
                 interpreters and other processors); C6150J (Operating
                 systems)",
  conflocation = "Boston, MA, USA; 9-11 Dec. 1980",
  conftitle =    "Proceedings of the ACM-SIGPLAN Symposium on the Ada
                 Programming Language",
  corpsource =   "Dept. of Computer Sci., Carnegie-Mellon Univ.,
                 Pittsburgh, PA, USA",
  keywords =     "Ada; Ada compiler; code generator; exception handling;
                 function return values; operating system; operating
                 systems (computers); parameter passing; program
                 compilers; subprogram calls; Unix; VAX 11/780",
  treatment =    "A Application",
}

@Article{Brosgol:1980:TME,
  author =       "Benjamin M. Brosgol",
  title =        "{TCOL$_{\rm Ada}$} and the ``middle end'' of the {PQCC
                 Ada} compiler",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "11",
  pages =        "101--112",
  month =        nov,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:31 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages); C6150C (Compilers,
                 interpreters and other processors)",
  conflocation = "Boston, MA, USA; 9-11 Dec. 1980",
  conftitle =    "Proceedings of the ACM-SIGPLAN Symposium on the Ada
                 Programming Language",
  corpsource =   "Intermetrics Inc., Cambridge, MA, USA",
  keywords =     "Ada; code generation; lexical; optimization; PQCC Ada
                 compiler; program compilers; semantic analysis;
                 syntactic; TCOL/sub Ada/",
  treatment =    "A Application",
}

@Article{Luckham:1980:PMD,
  author =       "David C. Luckham and Wolfgang Polak",
  title =        "A practical method of documenting and verifying {Ada}
                 programs with packages",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "11",
  pages =        "113--122",
  month =        nov,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:31 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6110 (Systems analysis and programming); C6140D
                 (High level languages)",
  conflocation = "Boston, MA, USA; 9-11 Dec. 1980",
  conftitle =    "Proceedings of the ACM-SIGPLAN Symposium on the Ada
                 Programming Language",
  corpsource =   "Computer Systems Lab., Stanford Univ., Stanford, CA,
                 USA",
  keywords =     "Ada; Ada programs; documenting; formal specification;
                 packages; program and system documentation; verifying",
  treatment =    "A Application",
}

@Article{Young:1980:GVA,
  author =       "William D. Young and Donald I. Good",
  title =        "Generics and verification in {Ada}",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "11",
  pages =        "123--127",
  month =        nov,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:31 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages)",
  conflocation = "Boston, MA, USA; 9-11 Dec. 1980",
  conftitle =    "Proceedings of the ACM-SIGPLAN Symposium on the Ada
                 Programming Language",
  corpsource =   "Inst. for Computing Sci. and Computer Applications,
                 Univ. of Texas, Austin, TX, USA",
  keywords =     "Ada; generic verification; generics; verification",
  treatment =    "A Application",
}

@Article{Krieg-Bruckner:1980:ATL,
  author =       "Bernd Krieg-Br{\"u}ckner and David C. Luckham",
  title =        "{ANNA}: towards a language for annotating {Ada}
                 programs",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "11",
  pages =        "128--138",
  month =        nov,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:31 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages)",
  conflocation = "Boston, MA, USA; 9-11 Dec. 1980",
  conftitle =    "Proceedings of the ACM-SIGPLAN Symposium on the Ada
                 Programming Language",
  corpsource =   "Computer Systems Lab., Stanford Univ., Stanford, CA,
                 USA",
  keywords =     "Ada; Ada programs; ANNA; semantics; syntax",
  treatment =    "A Application",
}

@Article{Clarke:1980:NAP,
  author =       "Lori A. Clarke and Jack C. Wileden and Alexander L.
                 Wolf",
  title =        "Nesting in {Ada} programs is for the birds",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "11",
  pages =        "139--145",
  month =        nov,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:31 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6110 (Systems analysis and programming); C6140D
                 (High level languages)",
  conflocation = "Boston, MA, USA; 9-11 Dec. 1980",
  conftitle =    "Proceedings of the ACM-SIGPLAN Symposium on the Ada
                 Programming Language",
  corpsource =   "Dept. of Computer and Information Sci., Univ. of
                 Massachusetts, Amherst, MA, USA",
  keywords =     "Ada; Ada programs; control flow; data abstraction;
                 data flow; nesting; programming; programming
                 methodology; tree structure",
  treatment =    "A Application",
}

@Article{MacLaren:1980:ETA,
  author =       "Lee MacLaren",
  title =        "Evolving toward {Ada} in real time systems",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "11",
  pages =        "146--155",
  month =        nov,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:31 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages)",
  conflocation = "Boston, MA, USA; 9-11 Dec. 1980",
  conftitle =    "Proceedings of the ACM-SIGPLAN Symposium on the Ada
                 Programming Language",
  corpsource =   "Boeing Military Airplane Co., Seattle, WA, USA",
  keywords =     "Ada; multitasking; real time systems; scheduling
                 complexity",
  treatment =    "A Application",
}

@Article{Eventoff:1980:RMC,
  author =       "W. Eventoff and D. Harvey and R. J. Price",
  title =        "The rendezvous and monitor concepts: is there an
                 efficiency difference? (concurrent programming
                 language)",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "11",
  pages =        "156--165",
  month =        nov,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:31 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages)",
  conflocation = "Boston, MA, USA; 9-11 Dec. 1980",
  conftitle =    "Proceedings of the ACM-SIGPLAN Symposium on the Ada
                 Programming Language",
  corpsource =   "Data Systems Group, Perkin-Elmer, Tinton Falls, NJ,
                 USA",
  keywords =     "Ada; concurrent Pascal; concurrent programming
                 language; monitor; Pascal; rendezvous",
  treatment =    "A Application",
}

@Article{Stevenson:1980:ATA,
  author =       "D. R. Stevenson",
  title =        "Algorithms for translating {Ada} multitasking",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "11",
  pages =        "166--175",
  month =        nov,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:31 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages); C6150C (Compilers,
                 interpreters and other processors)",
  conflocation = "Boston, MA, USA; 9-11 Dec. 1980",
  conftitle =    "Proceedings of the ACM-SIGPLAN Symposium on the Ada
                 Programming Language",
  corpsource =   "Computer Systems Lab., Stanford Univ., Stanford, CA,
                 USA",
  keywords =     "Ada; Ada-M; data structures; multitasking; program
                 compilers; program interpreters; scheduling;
                 translating",
  treatment =    "A Application",
}

@Article{Filipski:1980:AST,
  author =       "Gary L. Filipski and Donald R. Moore and John E.
                 Newton",
  title =        "{Ada} as a software transition tool",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "11",
  pages =        "176--182",
  month =        nov,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:31 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages); C6150C (Compilers,
                 interpreters and other processors)",
  conflocation = "Boston, MA, USA; 9-11 Dec. 1980",
  conftitle =    "Proceedings of the ACM-SIGPLAN Symposium on the Ada
                 Programming Language",
  corpsource =   "Air Force Manpower Personnel Center, Randolph AFB, TX,
                 USA",
  keywords =     "Ada; Ada compiler; bootstrap Ada translator; inquiry
                 system; Pascal; program interpreters; software
                 transition tool",
  treatment =    "A Application",
}

@Article{Albrecht:1980:SST,
  author =       "Paul F. Albrecht and Philip E. Garrison and Susan L.
                 Graham and Robert H. Hyerle and Patricia Ip and Bernd
                 Krieg-Br{\"u}ckner",
  title =        "Source-to-source translation: {Ada} to {Pascal} and
                 {Pascal} to {Ada}",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "11",
  pages =        "183--193",
  month =        nov,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:31 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages); C6150C (Compilers,
                 interpreters and other processors)",
  conflocation = "Boston, MA, USA; 9-11 Dec. 1980",
  conftitle =    "Proceedings of the ACM-SIGPLAN Symposium on the Ada
                 Programming Language",
  corpsource =   "Dept. of Electrical Engng. and Computer Sci., Univ. of
                 California, Berkeley, CA, USA",
  keywords =     "Ada; Ada to Pascal; internal tree representation;
                 Pascal; Pascal to Ada; program interpreters; program
                 transformations; source to source translation;
                 translators",
  treatment =    "A Application",
}

@Article{Dewar:1980:NAT,
  author =       "Robert B. K. Dewar and Gerald A. {Fisher, Jr.} and
                 Edmond Schonberg and Robert Froehlich and Stephen
                 Bryant and Clinton F. Goss and Michael Burke",
  title =        "The {NYU Ada} translator and interpreter",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "11",
  pages =        "194--201",
  month =        nov,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:31 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages); C6150C (Compilers,
                 interpreters and other processors)",
  conflocation = "Boston, MA, USA; 9-11 Dec. 1980",
  conftitle =    "Proceedings of the ACM-SIGPLAN Symposium on the Ada
                 Programming Language",
  corpsource =   "Courant Inst. of Math. Sci., New York Univ., New York,
                 NY, USA",
  keywords =     "Ada; compiler; high level languages; interpreter; NYU
                 Ada; program compilers; program interpreters
                 interpreters; semantic specification; SETI; translator;
                 very-high level language",
  treatment =    "A Application",
}

@Article{Belz:1980:MPI,
  author =       "F. C. Belz and E. K. Blum and D. Heimbigner",
  title =        "A multi-processing implementation-oriented formal
                 definition of {Ada} in {SEMANOL}",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "11",
  pages =        "202--212",
  month =        nov,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:31 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages)",
  conflocation = "Boston, MA, USA; 9-11 Dec. 1980",
  conftitle =    "Proceedings of the ACM-SIGPLAN Symposium on the Ada
                 Programming Language",
  corpsource =   "TRW Defense and Space Systems Group, Redondo Beach,
                 CA, USA",
  keywords =     "Ada; metaprogram; metaprogram Ada; multi-processing
                 implementation-oriented formal definition; SEMANOL;
                 semantics; syntax",
  treatment =    "A Application",
}

@Article{Lovengreen:1980:FMT,
  author =       "Hans Henrik L{\o}vengreen and Dines Bj{\o}rner",
  title =        "On a formal model of the tasking concept in {Ada}",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "11",
  pages =        "213--222",
  month =        nov,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:31 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages)",
  conflocation = "Boston, MA, USA; 9-11 Dec. 1980",
  conftitle =    "Proceedings of the ACM-SIGPLAN Symposium on the Ada
                 Programming Language",
  corpsource =   "Dept. of Computer Sci., Tech. Univ. of Denmark,
                 Lyngby, Denmark",
  keywords =     "Ada; Ada compiler; formal model; tasking concept",
  treatment =    "A Application",
}

@Article{Groves:1980:DVM,
  author =       "L. J. Groves and W. J. Rogers",
  title =        "The design of a virtual machine for {Ada}",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "11",
  pages =        "223--234",
  month =        nov,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:31 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6130 (Data handling techniques); C6140D (High level
                 languages); C6150C (Compilers, interpreters and other
                 processors); C6150J (Operating systems)",
  conflocation = "Boston, MA, USA; 9-11 Dec. 1980",
  conftitle =    "Proceedings of the ACM-SIGPLAN Symposium on the Ada
                 Programming Language",
  corpsource =   "Univ. of Waikato, Hamilton, New Zealand",
  keywords =     "Ada; addressing; blocks; compiler portability; control
                 flow; data handling; data storage; exceptions;
                 generating code; machine-independent translator;
                 manipulation; program compilers; program interpreters;
                 storage allocation; storage structure; subprograms;
                 task handling; virtual machine; virtual machines",
  treatment =    "A Application",
}

@Article{Bishop:1980:EMD,
  author =       "Judy M. Bishop",
  title =        "Effective machine descriptors for {Ada}",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "11",
  pages =        "235--242",
  month =        nov,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:31 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C5220 (Computer architecture); C6140D (High level
                 languages)",
  conflocation = "Boston, MA, USA; 9-11 Dec. 1980",
  conftitle =    "Proceedings of the ACM-SIGPLAN Symposium on the Ada
                 Programming Language",
  corpsource =   "Computer Sci. Div., Univ. of the Witwatersrand,
                 Johannesburg, South Africa",
  keywords =     "Ada; computer architecture; descriptors; efficient
                 execution; machine descriptors; structured high level
                 languages",
  treatment =    "A Application",
}

@Article{Anonymous:1980:C,
  author =       "Anonymous",
  title =        "Compilers",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "11",
  pages =        "??--??",
  month =        nov,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:31 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
}

@Article{Anonymous:1980:EMA,
  author =       "Anonymous",
  title =        "Execution models and architecture",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "11",
  pages =        "??--??",
  month =        nov,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:31 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
}

@Article{Anonymous:1980:S,
  author =       "Anonymous",
  title =        "Style",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "11",
  pages =        "??--??",
  month =        nov,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:31 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
}

@Article{Anonymous:1980:Ta,
  author =       "Anonymous",
  title =        "Tasking",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "11",
  pages =        "??--??",
  month =        nov,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:31 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
}

@Article{Anonymous:1980:Tb,
  author =       "Anonymous",
  title =        "Transition",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "11",
  pages =        "??--??",
  month =        nov,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:31 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
}

@Article{Anonymous:1980:U,
  author =       "Anonymous",
  title =        "Use",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "11",
  pages =        "??--??",
  month =        nov,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:31 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
}

@Article{Baxter:1980:VP,
  author =       "L. Baxter",
  title =        "The versatility of {PROLOG}",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "12",
  pages =        "15--16",
  month =        dec,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:16:58 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages); C7310 (Mathematics
                 computing)",
  corpsource =   "Dept. of Computer Sci., York Univ., Downsview, Ont.,
                 Canada",
  keywords =     "artificial intelligence; data base systems;
                 declarative programming language; drug interaction
                 prediction; general purpose programming language;
                 natural language analysis; plan formation; predicate
                 logic; programming languages; PROLOG; recreational
                 mathematics; symbolic integration",
  treatment =    "P Practical",
}

@Article{Buxton:1980:IBP,
  author =       "J. N. Buxton",
  title =        "An informal bibliography on programming support
                 environments",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "12",
  pages =        "17--30",
  month =        dec,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sat Apr 25 11:46:37 MDT 1998",
  acknowledgement = ack-nhfb,
  classification = "C6110 (Systems analysis and programming)",
  corpsource =   "Harvard Univ., Cambridge, MA, USA",
  keywords =     "bibliography; programming; programming support
                 environments",
  treatment =    "B Bibliography; G General Review; P Practical",
}

@Article{Cleaveland:1980:MS,
  author =       "J. Craig Cleaveland",
  title =        "Mathematical Specifications",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "12",
  pages =        "31--42",
  month =        dec,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:16:58 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory)",
  corpsource =   "Electrical Engng. and Computer Sci., Univ. of
                 Connecticut, Storrs, CT, USA",
  keywords =     "denotational semantics; description of programs;
                 formal specifications; functional; mathematical
                 specifications; meaning of programs; programming
                 theory; specification language; text editor",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Johnson:1980:DCR,
  author =       "LeRoy Johnson",
  title =        "do considered reflectively: a contribution to group
                 programming",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "12",
  pages =        "43--43",
  month =        dec,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:16:58 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
}

@Article{Johnson:1980:UDU,
  author =       "LeRoy Johnson",
  title =        "{\underline{do}} considered {\underline{ob}}viously
                 {\underline{odd}} in three dimensions",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "12",
  pages =        "44--44",
  month =        dec,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:16:58 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
}

@Article{Pentzlin:1980:SCS,
  author =       "Karl L. Pentzlin",
  title =        "A syntax for character and string constants supplying
                 user-defined character codes",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "12",
  pages =        "45--52",
  month =        dec,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:16:58 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4240 (Programming and
                 algorithm theory)",
  corpsource =   "Informatik-Forum GmbH, Muenchen, West Germany",
  keywords =     "character constants; formal languages; non-printable
                 characters; programming theory; readability of the
                 source code; string constants; syntactical construct;
                 user-defined character codes",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Sale:1980:CFS,
  author =       "Arthur Sale",
  title =        "Counterview in favour of strict type compatibility
                 (Pascal)",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "12",
  pages =        "53--55",
  month =        dec,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:16:58 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages)",
  corpsource =   "Dept. of Information Sci., Univ. of Tasmania, Hobart,
                 Tas., Australia",
  keywords =     "Ada; draft Pascal Standard; Pascal; redundant
                 identifiers; strict type compatibility; type matching",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Siero:1980:AAC,
  author =       "P. L. J. Siero",
  title =        "{APL} and {Algol68}, the correspondence and the
                 differences, especially in applications of
                 graph-analysis",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "12",
  pages =        "56--61",
  month =        dec,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:16:58 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C6140D (High
                 level languages)",
  corpsource =   "Leiden Univ. Computer Centre, Leiden, Netherlands",
  keywords =     "ALGOL 68; Algol68; APL; characteristics; compared;
                 correspondence; differences; graph theory",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Stroet:1980:ACP,
  author =       "Jan Stroet",
  title =        "An alternative to the communication primitives in
                 {ADA}",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "12",
  pages =        "62--74",
  month =        dec,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:16:58 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages)",
  corpsource =   "Informatica/Computer Graphics, Univ. of Nijmegen,
                 Nijmegen, Netherlands",
  keywords =     "Ada; ADA; alternative; clarity; communication
                 primitives; flexibility; input tool process; ITP;
                 orthogonality; power",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Sumpter:1980:CSH,
  author =       "Anthony G. Sumpter and Gerry E. Quick",
  title =        "Concurrency specification in high level languages",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "12",
  pages =        "75--81",
  month =        dec,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:16:58 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages)",
  corpsource =   "Dept. of Computer Sci., Univ. Coll. of Swansea,
                 Swansea, UK",
  keywords =     "concurrent; high level languages; parallel; parallel
                 processing; Pascal; PASCAL",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Taylor:1980:PPS,
  author =       "Nora M. Taylor",
  title =        "Protection of proprietary software",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "12",
  pages =        "82--84",
  month =        dec,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:16:58 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
}

@Article{Tutleman:1980:HLC,
  author =       "Jonathan S. Tutleman",
  title =        "Handling large, complex and variable job-control
                 streams using a procedure invocation package {(`PIP')}
                 and a pseudo-library",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "12",
  pages =        "85--91",
  month =        dec,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:16:58 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6150J (Operating systems)",
  corpsource =   "Abacus Programming Corp., Los Angeles, CA, USA",
  keywords =     "job sequences; job-control streams; PIP; procedure
                 invocation package; program-file development;
                 pseudo-library; supervisory and executive programs;
                 system-supplied software",
  treatment =    "P Practical",
}

@Article{Wagner:1980:FPL,
  author =       "Neal R. Wagner",
  title =        "A {FORTRAN} preprocessor for the large program
                 environment",
  journal =      j-SIGPLAN,
  volume =       "15",
  number =       "12",
  pages =        "92--103",
  month =        dec,
  year =         "1980",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:16:58 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages); C6150C (Compilers,
                 interpreters and other processors)",
  corpsource =   "Computer Sci. Dept., Univ. of Houston, Houston, TX,
                 USA",
  keywords =     "design philosophy; FORTRAN; FORTRAN preprocessor;
                 large program environment; maintenance; program
                 processors; structured programming",
  treatment =    "P Practical",
}

@Article{Mylopoulos:1981:OKR,
  author =       "John Mylopoulos",
  title =        "An overview of {Knowledge Representation}",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "1",
  pages =        "5--12",
  month =        jan,
  year =         "1981",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/960126.806869",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:11:45 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  abstract =     "This is a brief overview of terminology and issues
                 related to Knowledge Representation (here-after KR)
                 research, intended primarily for researchers working on
                 Semantic Data Models within Database Management and
                 Program Specifications within Programming
                 Languages/Software Engineering. Knowledge
                 Representation is a central problem in Artificial
                 Intelligence (AI) today. Its importance stems from the
                 fact that the current design paradigm for
                 ``intelligent'' systems stresses the need for expert
                 knowledge in the system along with associated
                 knowledge-handling facilities. This paradigm is in
                 sharp contrast to earlier ones which might be termed
                 ``power-oriented'' [Goldstein and Papert 77] in that
                 they placed an emphasis on general purpose heuristic
                 search techniques [Nilsson 71].",
  acknowledgement = ack-nhfb,
}

@Article{Anonymous:1981:TAI,
  author =       "Anonymous",
  title =        "Tutorial on artificial intelligence research",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "1",
  pages =        "13--18",
  month =        jan,
  year =         "1981",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/800227.806870",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:11:45 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  abstract =     "First of all, a few things about the basic terms I
                 will use. A knowledge representation scheme is a
                 formalism for representing knowledge. The term
                 knowledge representation will be used to refer to
                 knowledge representation schemes, knowledge
                 representation languages, and so on. The corresponding
                 term in database modelling is data model or semantic
                 data model. We're talking about natural ways of
                 capturing some sort of reality using a specification
                 language. The things produced when using a knowledge
                 representation scheme are referred to as knowledge
                 bases which correspond in database modelling and
                 programming languages with conceptual schema and
                 program specification respectively. What is a knowledge
                 base? What is modelled by a knowledge base? I am happy
                 to report that there is no one answer from people
                 working in knowledge representation. Some people will
                 argue that a knowledge base is a model of some world.
                 Others will say that it is linguistic information about
                 some world, and so on. Depending on the viewpoint,
                 there are differences in knowledge representation
                 schemes.",
  acknowledgement = ack-nhfb,
}

@Article{McLeod:1981:AD,
  author =       "Dennis McLeod and John Miles Smith",
  title =        "Abstraction in databases",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "1",
  pages =        "19--25",
  month =        jan,
  year =         "1981",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/960126.806871",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:11:45 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  abstract =     "This paper surveys current research and practice
                 concerning abstraction in database systems. Classical
                 and semantic database models are reviewed and
                 emphasized, as fundamental database abstraction
                 mechanisms.",
  acknowledgement = ack-nhfb,
}

@Article{Anonymous:1981:TDR,
  author =       "Anonymous",
  title =        "Tutorial on database research",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "1",
  pages =        "26--28",
  month =        jan,
  year =         "1981",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/960126.806872",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:11:45 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  abstract =     "McLeod: This tutorial surveys recent research in data
                 abstraction and conceptual modelling in the database
                 area. In particular, I will present recent results in
                 the area of higher level data models, sometimes called
                 semantic data models. The principal focus of database
                 research has been on database management systems
                 (DBMS's). A DBMS is a general purpose system which
                 provides tools for logical structuring of formatted
                 data, access interfaces, data control (protection and
                 integrity) and efficient storage of and access to data.
                 I would like to emphasize that results in database
                 research, while applicable to tailored systems, e.g.,
                 an airline reservation system, are really of a general
                 purpose nature.",
  acknowledgement = ack-nhfb,
}

@Article{Rowe:1981:DAP,
  author =       "Lawrence A. Rowe",
  title =        "Data abstraction from a programming language
                 viewpoint",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "1",
  pages =        "29--35",
  month =        jan,
  year =         "1981",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/960126.806873",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:11:45 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  abstract =     "This paper traces the development of data abstraction
                 concepts in programming languages. A data abstraction,
                 or abstract data type, describes a collection of
                 abstract entities and operations on the entities. A
                 program which uses a data abstraction can access or
                 modify the entities only through the abstract
                 operations. Specific research topics discussed in the
                 paper include: the role of type in a programming
                 language, the formal specification of the semantics of
                 a data abstraction, data abstraction language construct
                 design issues, type hierarchies, and type-checking.",
  acknowledgement = ack-nhfb,
}

@Article{Anonymous:1981:TPL,
  author =       "Anonymous",
  title =        "Tutorial on programming language research",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "1",
  pages =        "36--39",
  month =        jan,
  year =         "1981",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/960124.806874",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:11:45 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  abstract =     "Rowe: I am going to talk a little about data
                 abstraction from a programming language viewpoint. I
                 suspect that what I will say in some places will be
                 every bit as controversial amongst programming language
                 folks, as what Dennis said was amongst database folks.
                 Historically, programming languages evolve continually,
                 from very low-level representations or descriptions of
                 computations to higher-level descriptions. The idea is
                 to express computations in a way that makes them easier
                 to write, faster to debug, and make them survive
                 change. All these marvelous buzzwords!",
  acknowledgement = ack-nhfb,
}

@Article{Anonymous:1981:WSM,
  author =       "Anonymous",
  title =        "What should be modelled?",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "1",
  pages =        "40--42",
  month =        jan,
  year =         "1981",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/800227.806875",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:11:45 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  abstract =     "Balzer: This discussion is intended to set the stage
                 for further discussions by soliciting AI, DB and PL
                 views of ``what should be modelled?'' and the nature of
                 models. [This discussion suffered two problems. First,
                 it was the initial attempt at the workshop by people in
                 different areas to communicate on the same subject.
                 Second, the issue of ``what should be modelled?'' was
                 frequently confused with ``How should it be modelled?''
                 To aid the reader in understanding the issues that were
                 confused, comments by Deutsch, Hayes, Levesque, Rich
                 and Sibley have been extracted and placed at the
                 beginning, ed.]",
  acknowledgement = ack-nhfb,
}

@Article{Anonymous:1981:T,
  author =       "Anonymous",
  title =        "Types",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "1",
  pages =        "43--52",
  month =        jan,
  year =         "1981",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/960126.806876",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:11:45 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  abstract =     "Rowe: Data typing is a technique that researchers in
                 the various areas use to solve a variety of problems.
                 This session focuses on how types are used in a
                 particular domain to solve particular kinds of
                 problems. The long term goal is to answer the question,
                 what is a type? To begin we will have presentations by
                 representatives from the three areas, AI, DB and PL, on
                 how they see types being used. Mary Shaw will begin and
                 will be followed by Ira Goldstein and Ted Codd.",
  acknowledgement = ack-nhfb,
}

@Article{Anonymous:1981:B,
  author =       "Anonymous",
  title =        "Behaviour",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "1",
  pages =        "53--61",
  month =        jan,
  year =         "1981",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/960126.806877",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:11:45 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  abstract =     "In this session on behaviour I would like to raise, at
                 least the following issues: {\bullet} What is the
                 distinction between data and process? {\bullet} How are
                 process and data related? {\bullet} How is behaviour,
                 or system dynamics, modelled and specified? {\bullet}
                 What is the impact of behavioural specifications on
                 system evolvability? Rick Cattell, Peter Buneman and I
                 will start by commenting on these issues with respect
                 to database, AI, programming languages. Rich Cattell
                 will attempt to relate evolvability to behaviour and
                 discuss behaviour modelling in terms of different forms
                 of invocation. Peter Buneman will talk about how we
                 model processes in programming languages. I am going to
                 talk about tradeoffs between modelling things as data
                 or as process.",
  acknowledgement = ack-nhfb,
}

@Article{Anonymous:1981:P,
  author =       "Anonymous",
  title =        "Presentation",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "1",
  pages =        "62--71",
  month =        jan,
  year =         "1981",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/960126.806878",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:11:45 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  abstract =     "Presentation is intended to encompass notations and
                 languages for expressing models. This session will
                 focus on the linguistic and notational choices made in
                 particular approaches. Emphasis will be placed on
                 common ideas. For example, there have been some
                 assertions from proponents of the predicate calculus
                 that it is a notation that is capable of expressing
                 essentially all the interesting and important concepts
                 that are encountered in other notations. Emphasis will
                 also be placed on why the design choices were made, why
                 things are being represented a certain way, and what
                 the effects of those choices were. The purpose of this
                 workshop is to try to bring us all closer together.
                 Trying to bring us to a common terminology is something
                 I don't have much hope for at this point. However,
                 getting us to recognize in other areas problems and
                 solutions we have encountered in our own work is
                 something that I think is very possible, and I think it
                 has happened already to a certain extent. I see that as
                 a goal of this session.",
  acknowledgement = ack-nhfb,
}

@Article{Anonymous:1981:CM,
  author =       "Anonymous",
  title =        "Consistency of models",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "1",
  pages =        "72--76",
  month =        jan,
  year =         "1981",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/800227.806879",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:11:45 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  abstract =     "The topic of this session is the consistency of
                 models. (I believe that consistency and integrity are
                 substantially the same.) A model basically contains: -
                 states consisting of entities and various relationships
                 between them, - operations (functions) for examining
                 states, and - operations (procedures) for changing
                 states. The topic will be discussed in terms of the
                 following, rather controversial issues: 1. Kinds of
                 Consistency 2. Specifying Consistency 3. Detecting
                 Inconsistency 4. Living with Inconsistency 5.
                 Concurrency and Consistency 6. Recovery from Failure 7.
                 Exploiting Constraint Knowledge For each issue I will
                 present my own view, and I encourage alternative views
                 to be expressed.",
  acknowledgement = ack-nhfb,
}

@Article{Anonymous:1981:RBA,
  author =       "Anonymous",
  title =        "Relationships between and among models",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "1",
  pages =        "77--82",
  month =        jan,
  year =         "1981",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/960124.806880",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:11:45 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  abstract =     "Mylopoulos: When we talk about a model, it can be
                 either a program snapshot or execution, or a program, a
                 data base, a conceptual schema, or a knowledge base. We
                 can think of a program as consisting of units of some
                 sort, e.g., procedures, assertions, data types; and
                 they are related by relationships of various kinds.
                 Some relationships are user-defined and dependent on
                 the domain the model is dealing with. On the other
                 hand, some of the relationships used to describe the
                 model are primitive, in the sense that their semantics
                 are well-defined and embedded in the modelling
                 framework in terms of which the model has been defined.
                 Some examples from the three areas being represented
                 here are ISA, PART-OF, INSTANCE-OF. Certain other
                 relationships include procedural attachment, used in AI
                 to associate procedures to data classes to specify
                 operations on instances of the classes. In programming
                 languages, considering statements as the units,
                 statement sequencing is a primitive relationship
                 between these units. Considering ALGOL-like begin
                 blocks as the units, scoping rules are relationships
                 between units (blocks). Procedure activation rules
                 between blocks are another example of a relationship
                 that can be considered as primitive and embedded in the
                 modelling framework. Simula concatenation, which allows
                 the definition of classes to be given in terms of other
                 classes gives a relationship between classes. The
                 association of operations to a data type can also be
                 treated as a relationship that has been used in PLs.",
  acknowledgement = ack-nhfb,
}

@Article{Anonymous:1981:AMT,
  author =       "Anonymous",
  title =        "Application of modelling techniques",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "1",
  pages =        "83--87",
  month =        jan,
  year =         "1981",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/960124.806881",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:11:45 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  abstract =     "The main point of this session is to report
                 experiences with the development and application of
                 modelling tools and techniques. As Diane Smith puts it,
                 ``Have you used it yet?'' Despite the amount of work in
                 this area there seems to be a substantial lack of
                 application experience.",
  acknowledgement = ack-nhfb,
}

@Article{Anonymous:1981:WS,
  author =       "Anonymous",
  title =        "Workshop {Summary}",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "1",
  pages =        "88--90",
  month =        jan,
  year =         "1981",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/960126.806882",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:11:45 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  abstract =     "Zilles: Before the conference began, I asked three
                 people to give their perception of the conference as a
                 whole. This is in contrast to the session oriented
                 summaries that follow some of the topical session. Let
                 me begin by giving a couple of my own observations. One
                 thing that struck me very strongly, was the role of
                 mathematics in what we are all doing. It became very
                 clear that every notation should have some concrete
                 basis, that is, be defined using a well-understood
                 framework, e.g., predicate calculus, algebraics or
                 Scottery. Some reasons are: it helps you debug and
                 understand your system, it helps communicate your
                 framework to others, and, as expressed by Reiter and
                 Paolini, you can use a formalism for comparing
                 frameworks. One frequently made comment was that the
                 formalism doesn't have to be the user interface; it may
                 only be a formal tool for understanding a high-level
                 representation. There may still be considerable effort
                 in tailoring the user-interface to the modelling
                 formalism.",
  acknowledgement = ack-nhfb,
}

@Article{Albano:1981:IIS,
  author =       "Antonio Albano and Renzo Orsini",
  title =        "An interactive integrated system to design and use
                 data bases",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "1",
  pages =        "91--93",
  month =        jan,
  year =         "1981",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/960126.806883",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:11:45 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  abstract =     "Recent works on languages for modeling complex data
                 base application environments show overlapping issues
                 with other research areas such as Artificial
                 Intelligence and Programming Languages. Moreover, a lot
                 of attention is nowadays given to another important
                 field, the overall data base design process, which, as
                 it will be shown, furthermore extends the above
                 connections.",
  acknowledgement = ack-nhfb,
}

@Article{Amble:1981:IDB,
  author =       "Tore Amble",
  title =        "Integration of data base design in programming
                 languages",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "1",
  pages =        "94--94",
  month =        jan,
  year =         "1981",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/800227.806884",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:11:45 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  abstract =     "In 1978, the ASTRA research group at the University of
                 Trondheim was formed to create a prototype of a
                 relational data base machine with appropriate software.
                 A major part of this development was the definition and
                 implementation of an integrated data definition and
                 manipulation language ASTRAL \1.",
  acknowledgement = ack-nhfb,
}

@Article{Balzer:1981:DSS,
  author =       "Robert M. Balzer",
  title =        "Dynamic system specification",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "1",
  pages =        "95--97",
  month =        jan,
  year =         "1981",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/960126.806885",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:11:45 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  abstract =     "Our group is perhaps unique in that our approach to
                 modeling dynamic systems has a strong heritage from all
                 three fields represented at this workshop. Each of the
                 fields has contributed four major concepts to our
                 modeling approach. From the Data Base field, we have
                 adopted the idea of a single global model (data base)
                 which defines the state of the system. Fully
                 associative relations among typed atomic objects (no
                 internal structure) constitute the entire state
                 description. An information model (query language) is
                 defined for extracting information from the state (such
                 as one or all objects satisfying some description, or
                 the truthfulness of some proposition). Finally, the
                 model is updated via transactions, so that either the
                 entire operation is completed successfully, or the
                 state is unchanged.",
  acknowledgement = ack-nhfb,
}

@Article{Borgida:1981:DAE,
  author =       "Alexander T. Borgida and Sol Greenspan",
  title =        "Data and activities: {Exploiting} hierarchies of
                 classes",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "1",
  pages =        "98--100",
  month =        jan,
  year =         "1981",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/800227.806886",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:11:45 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  abstract =     "We wish to briefly discuss recent work in conceptual
                 modelling from a slightly different point of view in
                 order to highlight the parallels between data and
                 transactions, and then mention some benefits of this
                 view. A time-honoured way of describing a system
                 (portion of the world) is by positing a domain of
                 objects and then inter-relating them through function
                 and predicate symbols. The resulting description is a
                 set of axioms in a FOPC. If the world is dynamic, one
                 usually augments the description with the notion of
                 time or state, in which case axioms can be divided
                 naturally into ``general laws'' (heretofore
                 constraints) holding in all states, and state-specific
                 ``facts''. Given states, one then also has the ability
                 to describe state transitions (events) as predicates on
                 pairs of states or, as shown below, as objects in their
                 own right.",
  acknowledgement = ack-nhfb,
}

@Article{Brodie:1981:DAD,
  author =       "Michael L. Brodie",
  title =        "Data abstraction for designing database-intensive
                 applications",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "1",
  pages =        "101--103",
  month =        jan,
  year =         "1981",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/960124.806887",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:11:45 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  abstract =     "There is a growing exchange of ideas amongst
                 Artificial Intelligence (AI), Database (DB) and
                 Programming Language (PL) researchers concerning
                 conceptual modelling of complex, object-oriented
                 applications. The complexity of these applications
                 arises from complicated structural and behavioral
                 properties which change through time; concurrent,
                 interactive access by users with different processing
                 needs over a shared database; information locality
                 (i.e., DB views, PL data abstractions, AI
                 perspectives); and primarily update-oriented
                 transactions. Two main problems raised by these
                 applications are: managing the intellectual complexity
                 of their design, development and evolution, and
                 defining and ensuring semantic integrity.",
  acknowledgement = ack-nhfb,
}

@Article{Buneman:1981:UDT,
  author =       "Peter Buneman and Ira Winston",
  title =        "The use of data type information in an interactive
                 database environment",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "1",
  pages =        "104--106",
  month =        jan,
  year =         "1981",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/800227.806888",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:11:45 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  abstract =     "Despite the enormous advances that have been made in
                 the specification of data types and data models in the
                 fields of programming languages, databases and
                 artificial intelligence; there remain a number of
                 problems in attempting to unify the various approaches
                 to the formal description of data. The purpose of this
                 brief paper is to examine these problems from the point
                 (or points) of view of those people --- designers,
                 administrators, applications programmers, and end-users
                 --- whose main interest is with databases. In
                 particular, we hope to display special concern for the
                 tools provided for the end-user, who should be the
                 final beneficiary of whatever advances are made. In
                 order to pin down some of these problems, it is
                 worthwhile to attempt a definition of certain terms
                 used in databases: 1. A data model (or database
                 management system if one is describing an
                 implementation) is a set of parameterized or
                 ``generic'' data types. 2. A database schema is a set
                 of data types that result from instantiating the
                 generic types of the data model to produce a set of
                 data types that describe the data to be stored. 3. A
                 database is an instantiation of those types defined by
                 a schema.",
  acknowledgement = ack-nhfb,
}

@Article{Carbonell:1981:DRI,
  author =       "Jaime G. Carbonell",
  title =        "Default reasoning and inheritance mechanisms on type
                 hierarchies",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "1",
  pages =        "107--109",
  month =        jan,
  year =         "1981",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/800227.806889",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:11:45 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  abstract =     "Type hierarchies abound in Artificial Intelligence,
                 Data Bases and Programming Languages. Although their
                 size, use and complexity differs, all share a central
                 inference mechanism: Inheritance of information, their
                 raison d'{\^e}tre. This paper discusses various types of
                 type hierarchies and inheritance mechanisms, concluding
                 with a proposed generalized inheritance mapping
                 approach to resolve issues of lateral and upward
                 inheritance (to augment the traditional downward
                 approach), as well as default reasoning and limited
                 non-monotonic inference.",
  acknowledgement = ack-nhfb,
}

@Article{Cattell:1981:IDS,
  author =       "R. G. G. Cattell",
  title =        "Integrating a database system and programming \slash
                 information environment",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "1",
  pages =        "110--111",
  month =        jan,
  year =         "1981",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/960124.806890",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:11:45 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  abstract =     "Vast differences in terminology aside, there is
                 considerable overlap between work in knowledge
                 representation, programming language data types, and
                 database models. Our current work on the Cedar
                 programming environment has necessitated integrating a
                 number of ideas in these areas. As part of the Cedar
                 project in the Computer Science Lab at Xerox PARC, we
                 have been constructing a database management system.
                 The goal of the Cedar environment is to greatly
                 increase our productivity by combining the best
                 currently known principles from programming languages,
                 programming tools, and user interfaces into a single
                 integrated system. Cedar is based on the Mesa
                 programming language [1]. The goal of our database
                 subproject of Cedar is to provide a uniform prepackaged
                 way to perform access to data structures, as contrasted
                 to the current state of affairs in which Mesa
                 programmers repeatedly re-invent the facilities we
                 intend to provide to type, structure, index, link,
                 robustly store, concurrently access, and cache data
                 stored in the primary or secondary memory of one or
                 more computers on a network.",
  acknowledgement = ack-nhfb,
}

@Article{Codd:1981:DMD,
  author =       "E. F. Codd",
  title =        "Data models in database management",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "1",
  pages =        "112--114",
  month =        jan,
  year =         "1981",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/800227.806891",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:11:45 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  abstract =     "It is a combination of three components: 1) a
                 collection of data structure types (the building blocks
                 of any database that conforms to the model); 2) a
                 collection of operators or inferencing rules, which can
                 be applied to any valid instances of the data types
                 listed in (1), to retrieve or derive data from any
                 parts of those structures in any combinations desired;
                 3) a collection of general integrity rules, which
                 implicitly or explicitly define the set of consistent
                 database states or changes of state or both --- these
                 rules may sometimes be expressed as
                 insert-update-delete rules.",
  acknowledgement = ack-nhfb,
}

@Article{Cristian:1981:SBC,
  author =       "Flaviu Cristian",
  title =        "On the specification of behavioural constraints",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "1",
  pages =        "115--117",
  month =        jan,
  year =         "1981",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/800227.806892",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:11:45 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  abstract =     "When designing information processing systems, the key
                 problem is to find what symbols and constructs
                 (available in some given language) should be used so as
                 to be able to answer the questions that the users want
                 to ask and to perform the state transitions that the
                 users have to perform in order to keep in step with
                 some reality that is being modelled. If the language
                 that is being used cannot be interpreted directly by
                 the software of a computer (e.g. set theory, algebra,
                 semantic networks), the resulting model is called an
                 abstract model (e.g. a specification, a data base
                 schema). If all of the symbols and constructs used to
                 express the model can be interpreted by a computer, the
                 model is a concrete implementation (e.g. a data base
                 system). Both the abstract and concrete models capture
                 some aspects of the reality that is modelled. They
                 differ with respect to the languages in which they are
                 expressed. The choice of the languages which are
                 appropriate for writing such models is a subject of
                 intensive debate. The recent workshop on Data
                 Abstraction, Data Bases and Conceptual Modelling has
                 shown that this debate is not likely to diminish in the
                 near future. In the context of this debate, however, a
                 common opinion was expressed several times by data base
                 participants: the data models used to specify data base
                 schemas are lacking to support the specification of
                 operations tailored to particular application
                 environments. It is therefore expected that in the
                 context of data base modelling, the integration of
                 operations (behaviour) with data (structure) will be
                 one of the most fertile research areas for the next few
                 years.",
  acknowledgement = ack-nhfb,
}

@Article{Deutsch:1981:CUM,
  author =       "L. Peter Deutsch",
  title =        "Constraints: {A} uniform model for data and control",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "1",
  pages =        "118--120",
  month =        jan,
  year =         "1981",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/960126.806893",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:11:45 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  abstract =     "Most programming systems reflect a model of
                 computation which sharply distinguishes between
                 ``passive'' data objects and ``active'' program objects
                 (procedures). Furthermore, procedures describe not only
                 a set of computations but the precise flow of control
                 between them. In contrast, a group at MIT is
                 investigating a new paradigm called constraints in
                 which a single kind of object models both data and
                 procedures, and in which the description of procedures
                 minimizes commitment to the order in which
                 computational steps will be executed. A (primitive)
                 constraint is an object with some parts, which
                 correspond to fields of a data structure or
                 input/output parameters of a procedure, and a body
                 which describes how to compute the values of some parts
                 from other parts. The body consists of rules written in
                 an implementation language (Lisp in the MIT systems).
                 Constraints with no body behave like ordinary data
                 structures; constraints with substantial bodies behave
                 more like procedures. However, unlike procedures, which
                 always compute the same set of outputs from the same
                 set of inputs, a constraint may compute in different
                 directions depending on the available data.",
  acknowledgement = ack-nhfb,
}

@Article{Feather:1981:SCC,
  author =       "Martin S. Feather",
  title =        "Some contrasts and considerations of an approach to
                 modelling",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "1",
  pages =        "121--123",
  month =        jan,
  year =         "1981",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/800227.806894",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:11:45 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  abstract =     "We consider the approach to modelling that our group
                 has been developing, first to highlight differences
                 between this and the approaches of other researchers,
                 second to raise some issues related to
                 understandability of models that we feel are common to
                 modelling in general. The principles underlying our
                 approach may be found in Balzer's position paper to
                 this workshop.",
  acknowledgement = ack-nhfb,
}

@Article{Goldstein:1981:INS,
  author =       "Ira Goldstein",
  title =        "Integrating a network-structured database into an
                 object-oriented programming language",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "1",
  pages =        "124--125",
  month =        jan,
  year =         "1981",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/800227.806895",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:11:45 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  abstract =     "Smalltalk is an object-oriented language (Ingalls78,
                 KayGoldberg77, Hewitt73). PIE is a subsystem that
                 extends Smalltalk's descriptive power by supporting the
                 creation, storage, retrieval and manipulation of
                 network structures (GoldsteinBobrow80a,b,c;
                 BobrowGoldstein80). These networks have been employed
                 to represent software, documentation, electronic mail,
                 calendars, people, addresses, bibliographic references
                 and other items that together comprise the personal
                 information space of a user of an office information
                 system. By employing a common network representation,
                 PIE supports an integrated environment for software
                 development and office-related tasks. PIE has been
                 developed collaboratively with Dan Bobrow, and is
                 presently being used on an experimental basis by a
                 small community at Xerox PARC. Smalltalk represents
                 entities in the external world as objects. An object
                 has a state --- i.e. an assignment of values to a set
                 of state variables --- and a class. The class of an
                 object defines the behavior of the object in terms of a
                 set of methods. Thus the class is a generic description
                 of a collection of objects, while the objects
                 associated with a class provide a particular
                 description of the state of individual instances.",
  acknowledgement = ack-nhfb,
}

@Article{Hardgrave:1981:PDM,
  author =       "W. Terry Hardgrave and Donald R. Deutsch",
  title =        "Processing data model abstractions",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "1",
  pages =        "126--127",
  month =        jan,
  year =         "1981",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/800227.806896",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:11:45 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  abstract =     "A number of data abstraction, database, and conceptual
                 modeling issues border on the three technical areas
                 that this workshop addresses: artificial intelligence,
                 database management, and programming languages. We
                 assume that the workshop is dedicated to removing the
                 boundaries between these three fields in order to shape
                 research and development of common interest. While
                 enthusiastically supporting this objective, we believe
                 that each area has a unique perspective and emphasis
                 worth preserving. The three fields can truly benefit
                 from each other only if each one appreciates the
                 diversity of these research viewpoints. In this spirit
                 we describe a research project on Abstract Data Models
                 conducted by the Institute for Computer Sciences and
                 Technology (ICST) of the National Bureau of Standards
                 (NBS). Before doing so, however, we wish to discuss
                 from our perspective both some problems that database
                 management shares with the areas of artificial
                 intelligence and programming languages, and some
                 possible mathematical solutions to these problems.",
  acknowledgement = ack-nhfb,
}

@Article{Hayes:1981:LVT,
  author =       "Patrick J. Hayes and Gary G. Hendrix",
  title =        "A logical view of types",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "1",
  pages =        "128--130",
  month =        jan,
  year =         "1981",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/800227.806897",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:11:45 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  abstract =     "People working in the areas of data abstraction,
                 databases, and conceptual modeling have argued at
                 considerable length over the meanings of such terms as
                 ``abstraction'' and ``type.''* Rather than add to this
                 debate by offering yet another set of definitions, in
                 the paragraphs below we shall attempt to show how
                 ordinary predicate calculus can be used to talk about
                 most (perhaps all) the notions for which the terms
                 ``abstraction'' and ``type'' are currently being used
                 in various quarters of computer science. We do not
                 intend to argue that predicate calculus is a suitable
                 tool for implementing types, but rather that it
                 provides a well-understood, uniform conceptual
                 framework and notation for describing and precisely
                 comparing various ideas on typing --- and that special
                 notations developed for this purpose are therefore
                 unnecessary.",
  acknowledgement = ack-nhfb,
}

@Article{Hendrix:1981:MVD,
  author =       "Gary G. Hendrix",
  title =        "Mediating the views of databases and database users",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "1",
  pages =        "131--132",
  month =        jan,
  year =         "1981",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/960124.806898",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:11:45 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  abstract =     "The Natural-Language/Deduction group at SRI
                 International has undertaken several large projects
                 integrating knowledge representation, the modeling and
                 use of distributed conventional databases, logical
                 deduction, and natural-language processing. One of the
                 largest projects, LADDER [2], involved accessing data
                 distributed over a computer network by using queries
                 expressed in English. Work with LADDER (and several
                 similar systems) has revealed that: (1) Users wish to
                 talk about data in terms of the enterprise in which the
                 data are to be used. Users do not confine their
                 questions to concepts and terminology covered by the
                 database per se. (2) Users are seldom satisfied with
                 access only to the data in a database. They need to
                 know the KIND of data available (i.e., they want to ask
                 questions about the DB schema), and they expect systems
                 to include information that can be computed from
                 ``common knowledge'' and information stored explicitly
                 in the database (e.g., if a database records where two
                 ships are, users expect the system to know the distance
                 between them). (3) Users are not satisfied with access
                 to an existing database. They want to tell the system
                 new facts. Some of these are not suitable for storage
                 in conventional databases (e.g., statements involving
                 quantification), and some involve counter factuals
                 (e.g., ``Suppose the ship were 100 miles south of its
                 current location...''). (4) Given natural-language
                 access to a DBMS, users expect to interact in natural
                 language with other types of software, too. Moreover,
                 they expect the various underlying software packages to
                 understand one another's results (e.g., User: ``Who is
                 the commander of the ship?'' System: ``Admiral Brown.''
                 User: ``Send him a copy of Smith's memo.'' The mailer
                 is expected to understand the output from the
                 database).",
  acknowledgement = ack-nhfb,
}

@Article{Hitchcock:1981:DDO,
  author =       "Peter Hitchcock",
  title =        "Data dictionaries in open system communication",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "1",
  pages =        "133--134",
  month =        jan,
  year =         "1981",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/800227.806899",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:11:45 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  abstract =     "My current work is based on the premise that one
                 should be able to access a foreign database system with
                 the same ease that one can move from one type of
                 telephone system to another. Data dictionaries must
                 form the focal point in any architecture which would
                 support such a concept. Data from a foreign system must
                 be presented to the local system in such a way that the
                 local system can understand it if the databases are
                 disjoint, or merge the foreign conceptual model with
                 the local one if the data bases have some common
                 structure. Once such a rapport has been established,
                 other aspects of the conceptual models, such as
                 constraints and operations on the data, must be
                 translated from one system to the other. This raises
                 the following issues which I would like to see
                 discussed at the workshop.",
  acknowledgement = ack-nhfb,
}

@Article{Katz:1981:HDH,
  author =       "Randy H. Katz",
  title =        "Heterogeneous databases and high level abstraction",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "1",
  pages =        "135--137",
  month =        jan,
  year =         "1981",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/800227.806900",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:11:45 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  abstract =     "A heterogeneous database management system combines
                 multiple dissimilar models of data within a single
                 integrated system. The objective is to allow a user to
                 access data independently of how it is actually
                 organized. For example, a user may access a database as
                 though it were stored relationally (i.e., in tables)
                 [CODD70], even though it is actually stored as a
                 CODASYL/DBTG or network database [CODA71]. In addition,
                 different subpieces of the database may be organized
                 under different data models. The heterogeneous database
                 system must present these to the user as an integrated
                 whole. The user's model of his data may be different
                 from any of the models chosen to implement it. Rather
                 than construct a new database system from scratch, we
                 are interested in constructing a heterogeneous system
                 out of existing systems. The key difficulties with this
                 approach are: (1) the formulation of database design
                 methods that are applicable to a variety of different
                 data models, and (2) the development of techniques to
                 translate programs and data between dissimilar data
                 models. In this paper, we briefly describe how high
                 level abstraction has been applied to these problems.
                 The use of abstraction in database systems is related
                 to the application of abstraction techniques in
                 programming languages and artificial intelligence
                 research.",
  acknowledgement = ack-nhfb,
}

@Article{King:1981:MCR,
  author =       "Jonathan J. King",
  title =        "Modelling concepts for reasoning about access to
                 knowledge",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "1",
  pages =        "138--140",
  month =        jan,
  year =         "1981",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/800227.806901",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:11:45 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  abstract =     "There is growing agreement about the usefulness of
                 putting semantic database constraints into explicit
                 form that can be manipulated by various database
                 management programs. Indeed, this is a prerequisite for
                 building intelligent database mediators. These are
                 programs that perform the task of a good database
                 analyst: to pose the most effective and easily
                 processed queries to help solve a problem. Semantic
                 query optimization is a technique to exploit semantic
                 constraints for one aspect of intelligent database
                 mediation: increasing retrieval efficiency. The
                 technique is to use semantic constraints to transform a
                 query into an equivalent one that can be processed more
                 efficiently. Various kinds of semantic knowledge that
                 can be used for this purpose are described.",
  acknowledgement = ack-nhfb,
}

@Article{Kreps:1981:RVC,
  author =       "Peter Kreps",
  title =        "Relativism and views in a conceptual data base model",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "1",
  pages =        "141--143",
  month =        jan,
  year =         "1981",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/800227.806902",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:11:45 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  abstract =     "The purpose of the Pingree Park Workshop was to bring
                 together practitioners from the fields of Artificial
                 Intelligence (AI), Database Management (DB), and
                 Programming Languages (PL), to discover common issues,
                 and to explore commonalities and differences in
                 approaches to these issues. At the risk of being
                 superficial let me try to summarily characterize the
                 three fields and point to where I think they may
                 fruitfully interact. It seems to me that at its best,
                 AI is an interdisciplinary science of cognition. It
                 attempts to understand the bases for natural cognition,
                 primarily by developing models of structures and
                 processes that underlie cognition. By incorporation
                 into interactive systems these models can be both
                 exploited as artificially intelligent technology and
                 explored for their adequacy in explaining natural
                 cognition.",
  acknowledgement = ack-nhfb,
}

@Article{Lacroix:1981:ATD,
  author =       "Michel Lacroix and Alain Pirotte",
  title =        "Associating types with domains of relational data
                 bases",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "1",
  pages =        "144--146",
  month =        jan,
  year =         "1981",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/960126.806903",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:11:45 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  abstract =     "In the DB field, there are two interpretations (or
                 perceptions or schools of thought) concerning the
                 relational model: (a) one interpretation considers that
                 the relational model contribution to the DB field
                 essentially consists in the presentation of a clear and
                 simple notion of (flat) file, and that many users will
                 be very satisfied to describe their data structures as
                 tables; (b) another interpretation considers the
                 relational model as a (reasonable) support for a (weak)
                 entity relationship model.",
  acknowledgement = ack-nhfb,
}

@Article{Leavenworth:1981:DAA,
  author =       "B. Leavenworth",
  title =        "A data abstraction approach to database modelling",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "1",
  pages =        "147--149",
  month =        jan,
  year =         "1981",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/960126.806904",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:11:45 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  abstract =     "Attempts have been made for some time to reconcile the
                 notions of data base modelling and data abstraction.
                 Considering the overlapping concepts of information
                 hiding and encapsulation from the data abstraction
                 world, and data independence from the database world,
                 it should not be necessary to design yet another
                 programming language as others have done, specialized
                 to a particular data model. Instead, the starting point
                 for our work has been the proposition that an extant
                 general purpose language providing data abstractions
                 should be able to accommodate the popular data models
                 by serving both as a data definition and manipulation
                 language. The criticism has been made that while
                 abstract data types hide the representation details,
                 they also suppress the semantic structure of the data.
                 While this may be true for ``programming in the small''
                 [2], it is not the case for ``programming in the
                 large'' [2]. We will briefly indicate how a CLU-like
                 language [4] (hereafter called XPLS) with minor
                 extensions, plus its supporting module interconnection
                 language (hereafter called the External Structure) can
                 be used as a data-base definition and manipulation
                 language. XPLS has been designed as a front end to PL/I
                 and is supported by a preprocessor to the PL/I
                 compiler. It turns out that XPLS plus External
                 Structure supports and meshes more smoothly with a
                 semantic data model (for example: [1], [3],[5], [6])
                 than with the older data models. Our work differs from
                 a number of recent specialized languages which exploit
                 data abstractions and strong type checking but which
                 are based on the relation as a primitive data type. Our
                 approach is not based on any particular data model.",
  acknowledgement = ack-nhfb,
}

@Article{Levesque:1981:IKB,
  author =       "Hector J. Levesque",
  title =        "Incompleteness in knowledge bases",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "1",
  pages =        "150--152",
  month =        jan,
  year =         "1981",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/960124.806905",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:11:45 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  abstract =     "The first topic for discussion at the High Level
                 Abstraction Workshop was What should be modelled? that
                 is, what aspects of the world (slice of reality /
                 enterprise) must be dealt with in a high level
                 conceptual model. I would like to address this question
                 from the point of view of incomplete knowledge bases.
                 Although my remarks pertain mainly to AI applications,
                 I suspect that any application using an information
                 system of some sort will eventually have to face
                 similar issues. The knowledge bases required in many
                 applications can be characterized by a lack of complete
                 information about the world of interest.",
  acknowledgement = ack-nhfb,
}

@Article{Lundberg:1981:AIM,
  author =       "Bengt Lundberg and Janis A. {Bubenko, Jr.}",
  title =        "Axiomatic information modeling",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "1",
  pages =        "153--154",
  month =        jan,
  year =         "1981",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/960124.806906",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:11:45 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  abstract =     "The obvious task in information modeling is to arrive
                 at a model which is correct. However, the concept of
                 correctness has many faces e g the model must correctly
                 reflect the properties of the application at hand, and
                 it must adequately select relevant parts of the
                 application. The former case requires that the
                 information model is ``satisfied by the application''.
                 The latter case is dependent on the intended use of the
                 model. The problem of satisfiability is, in most
                 information modeling approaches, considered to be an
                 intuitive task. From logic we know that a theory, here
                 seen as an information model, can only be satisfied if
                 it is consistent. Thus, by applying predicate logic to
                 information modeling, we should have a possibility of
                 checking the satisfiability of an information model.
                 However, in order to ensure that the information model
                 is satisfied by the application in mind, requires an
                 intuitive reasoning. Consequently, our plans include to
                 further elaborate the use of predicate logic in
                 information modeling. It furthermore includes a study
                 of possibilities and limitations of such an approach.
                 The results obtained so far will be shortly reviewed in
                 the following.",
  acknowledgement = ack-nhfb,
}

@Article{Mark:1981:UDO,
  author =       "William Mark",
  title =        "Use of database organization in the {Consul} system",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "1",
  pages =        "155--157",
  month =        jan,
  year =         "1981",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/800227.806907",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:11:45 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  abstract =     "A fundamental aspect of the Consul system is the way
                 the organization of the database defines the system's
                 operation and unifies its components. Accessing and
                 maintaining the database is the focus of all system
                 activities, from parsing English to executing
                 programs.",
  acknowledgement = ack-nhfb,
}

@Article{Mayr:1981:MMD,
  author =       "Heinrich C. Mayr",
  title =        "Make more of data types",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "1",
  pages =        "158--160",
  month =        jan,
  year =         "1981",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/800227.806908",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:11:45 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  abstract =     "This position paper refers to some observations I made
                 at the 'High Level Abstraction Workshop', and it
                 exhibits a way to attack abstraction and specification
                 problems in the database field. Because of the fixed
                 page limit this will be done in a more or less cursory
                 collection of remarks.",
  acknowledgement = ack-nhfb,
}

@Article{McLeod:1981:CDM,
  author =       "Dennis McLeod",
  title =        "On conceptual database modelling",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "1",
  pages =        "161--163",
  month =        jan,
  year =         "1981",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/800227.806909",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:11:45 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  abstract =     "This research was supported, in part, by the Joint
                 Services Electronics Program through the Air Force
                 Office of Scientific research under contract
                 F44620-76-C-0061.",
  acknowledgement = ack-nhfb,
}

@Article{Meyer:1981:TLA,
  author =       "Bertrand Meyer",
  title =        "A three-level approach to the description of data
                 structures, and notational framework",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "1",
  pages =        "164--166",
  month =        jan,
  year =         "1981",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/800227.806910",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:11:45 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  abstract =     "When talking about data structures, whether local to a
                 program or persistent over time, three different
                 viewpoints are equally important. The first one is that
                 of the user, who is interested in the external
                 properties of a certain structure, more precisely, its
                 noticeable behavior in response to outside effects
                 (queries, requests for modifications, etc.). The second
                 viewpoint is that of the language designer, who is in
                 search of a small number of basic objects and building
                 mechanisms which will allow for the description of
                 complex objects in terms of simpler ones. The last view
                 is that of the implementor, who must find efficient
                 representations for the constructs thus described.
                 Based on this remark, a three-level description of data
                 structures has been used by the author in previous work
                 [6, 7, 8]. The three levels may be called:",
  acknowledgement = ack-nhfb,
}

@Article{Mylopoulos:1981:PRC,
  author =       "John Mylopoulos",
  title =        "A perspective for research on conceptual modelling",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "1",
  pages =        "167--170",
  month =        jan,
  year =         "1981",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/800227.806911",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:11:45 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  abstract =     "This position paper is intended to provide a
                 perspective for research on conceptual modelling
                 carried out over the past five years at the University
                 of Toronto and to draw some conclusions from the
                 experiences we have accumulated. ``Conceptual
                 modelling'' here refers to the activity of constructing
                 abstract models of knowledge about some world and is
                 synonymous with the terms ``knowledge representation''
                 and ``semantic data model'' as they have been used in
                 AI and Databases respectively. Much of the research on
                 the subject has focused on the development of
                 descriptive tools for the description of such models.
                 Less attention has been paid, so far, on methodologies
                 for building such models.",
  acknowledgement = ack-nhfb,
}

@Article{Paolini:1981:ADT,
  author =       "Paolo Paolini",
  title =        "Abstract data types and {Data Bases}",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "1",
  pages =        "171--173",
  month =        jan,
  year =         "1981",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/800227.806912",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:11:45 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  abstract =     "Several researchers have been working, recently, at
                 the attempt of using the ADT approach in the Data Base
                 area. Different specific problems have attacked and we
                 will review some of them.",
  acknowledgement = ack-nhfb,
}

@Article{Reiter:1981:DBL,
  author =       "Raymond Reiter",
  title =        "Data bases: {A} logical perspective",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "1",
  pages =        "174--176",
  month =        jan,
  year =         "1981",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/960124.806913",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:11:45 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  abstract =     "My work in data base theory is a natural outgrowth of
                 my longstanding concern with the problem of
                 representing and reasoning with domain specific
                 knowledge, a problem of major concern in Artificial
                 Intelligence. In data base terminology this is the
                 conceptual modelling issue. My own methodological bias
                 favours logic as a representation language for
                 conceptual modelling, a bias which historically arose
                 within AI in response to AI's emphasis on the ability
                 to reason deductively with representations. In this
                 position paper I shall argue that logic has other
                 advantages for data base theory. Specifically my
                 objective is to provide the outline of a logical
                 reconstruction of certain aspects of conventional data
                 base theory.",
  acknowledgement = ack-nhfb,
}

@Article{Rich:1981:MPV,
  author =       "Charles Rich",
  title =        "Multiple points of view in modelling programs",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "1",
  pages =        "177--179",
  month =        jan,
  year =         "1981",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/800227.806914",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:11:45 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  abstract =     "An important issue discussed at the workshop on data
                 abstraction is the need to represent multiple,
                 overlapping points of view and relationships between
                 them. The first two sections of this paper motivate the
                 use of multiple and overlapping points of view in
                 modelling programs and data structures. The final
                 section of the paper briefly describes a new formalism,
                 called overlays, which has been developed for this
                 purpose, and which may be of general interest. The
                 overall goal of the research from which this paper is
                 drawn is to compile a library of standard, generally
                 used data and control abstractions to be used in the
                 interactive analysis, synthesis and verification of
                 programs. Multiple points of view were needed in this
                 context is in order to decompose the data and control
                 structures of users' programs in a way which makes
                 explicit their relationship to the library of standard
                 abstractions.",
  acknowledgement = ack-nhfb,
}

@Article{Rowe:1981:IDD,
  author =       "Lawrence A. Rowe",
  title =        "Issues in the design of database programming
                 languages",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "1",
  pages =        "180--182",
  month =        jan,
  year =         "1981",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/960124.806915",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:11:45 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  abstract =     "This paper discusses two issues in the design of
                 database constructs for programming languages. The
                 first issue is whether records in a database correspond
                 to records in a programming language or to a distinct
                 type such as tuple. The second issue is what facilities
                 are provided to define the interface between an
                 application program and a database. The discussion
                 below is based on our research on the RIGEL database
                 programming language [Rowe 79, 80a]. RIGEL is a
                 block-structured language with constructs for accessing
                 relational databases, a module construct for data
                 abstraction, and an exception-handling mechanism. The
                 first implementation of the language has recently been
                 completed and is being distributed.",
  acknowledgement = ack-nhfb,
}

@Article{dosSantos:1981:TCA,
  author =       "C. S. dos Santos and A. L. Furtado and J. M. V. de
                 Castilho and S. E. R. de Carvalho",
  title =        "Towards constructive axiomatic specifications",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "1",
  pages =        "183--185",
  month =        jan,
  year =         "1981",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/800227.806916",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:11:45 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  abstract =     "The main goal of our efforts is the specification of
                 data bases whose structure and behaviour are restricted
                 by semantic integrity constraints. Research proceeds
                 along the following stages: 1. Choose a data model; 2.
                 Establish a taxonomy of integrity constraints; 3.
                 Specify the data model formally; 4. Develop a
                 methodology for specifying conceptual schemas for
                 different applications, based on the data model; 5.
                 Provide a conceptual characterization of query and
                 update operations.",
  acknowledgement = ack-nhfb,
}

@Article{Schmidt:1981:DAT,
  author =       "Joachim W. Schmidt",
  title =        "Data abstraction tools: {Design}, specification and
                 application",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "1",
  pages =        "186--188",
  month =        jan,
  year =         "1981",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/960124.806917",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:11:45 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  abstract =     "Current research in data modeling is motivated by the
                 following dilemma: - At the application level - being
                 confronted with ``slices of reality'' - details are
                 perceived that, in general, cannot be represented. - At
                 the representation level - being confronted with
                 ``levels of machines'' - details are represented that,
                 in general, cannot be perceived. Abstraction methods
                 cope with that problem by suppressing unnecessary
                 details and by formalizing and structuring the relevant
                 information.",
  acknowledgement = ack-nhfb,
}

@Article{Shaw:1981:ADT,
  author =       "Mary Shaw",
  title =        "Abstraction, data types, and models for software",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "1",
  pages =        "189--191",
  month =        jan,
  year =         "1981",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/800227.806918",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:11:45 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  abstract =     "In the area of software development and maintenance, a
                 major issue is managing the complexity of the systems.
                 Programming methodologies and languages to support them
                 have grown in response to new ideas about how to cope
                 with this complexity. A dominant theme in the growth of
                 methodologies and languages is the development of tools
                 dealing with abstractions. An abstraction is a
                 simplified description, or specification, of a system
                 that emphasizes some of its details or properties while
                 suppressing others. A good abstraction is one in which
                 information that is significant to the reader (i.e.,
                 the user) is emphasized while details that are
                 immaterial, at least for the moment, are suppressed.
                 What we call ``abstraction'' in programming systems
                 corresponds closely to what is called ``modelling'' in
                 many other fields. It shares many of the same problems
                 deciding which characteristics of the system are
                 important, what variability (i.e., parameters) should
                 be included, which descriptive formalism to use, how
                 the model can be validated, and so on",
  acknowledgement = ack-nhfb,
}

@Article{Sibley:1981:DMS,
  author =       "E. H. Sibley",
  title =        "Database management systems past and present",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "1",
  pages =        "192--192",
  month =        jan,
  year =         "1981",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/800227.806919",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:11:45 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  abstract =     "The theme of this note is on the two points: 1. Many
                 of the ideas discussed in both data base and the other
                 two areas were well known in the sixties --- some go
                 back to the fifties. 2.Too much attention was placed on
                 trivia.",
  acknowledgement = ack-nhfb,
}

@Article{Sowa:1981:CSK,
  author =       "John F. Sowa",
  title =        "A conceptual schema for {Knowledge-based} systems",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "1",
  pages =        "193--195",
  month =        jan,
  year =         "1981",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/960126.806920",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:11:45 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  abstract =     "Knowledge-based systems are data bases with more
                 powerful front ends for dealing with the meaning of
                 data. This paper discusses requirements for a
                 conceptual schema that is general enough to support
                 knowledge bases as well as ordinary data bases. It
                 presents seven features that such a schema must support
                 and evaluates various approaches to data base semantics
                 in terms of them. The AI notations for semantic
                 networks or conceptual graphs are highly general ones
                 that can support all seven features.",
  acknowledgement = ack-nhfb,
}

@Article{Thatcher:1981:DAD,
  author =       "J. W. Thatcher",
  title =        "Data abstraction, data bases and conceptual modelling
                 (Position {Paper)}",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "1",
  pages =        "196--197",
  month =        jan,
  year =         "1981",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/800227.806921",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:11:45 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  abstract =     "There is no paper with a mathematical foundation that
                 I know of that strikes more at the heart of the subject
                 of this Workshop than that of R.M. Burstall and J.A.
                 Goguen [10], presented at the Fifth International Joint
                 Conference on Artificial Intelligence in August of
                 1977.",
  acknowledgement = ack-nhfb,
}

@Article{Wasserman:1981:EDA,
  author =       "Anthony I. Wasserman",
  title =        "The extension of data abstraction to database
                 management",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "1",
  pages =        "198--200",
  month =        jan,
  year =         "1981",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/960124.806922",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:11:45 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  abstract =     "The long-term goal of the User Software Engineering
                 (USE) project at the University of California, San
                 Francisco, is to provide an integrated homogeneous
                 programming environment for the design and development
                 of interactive information systems. Realization of this
                 goal involves the development of new software tools,
                 their integration with existing tools, and the creation
                 of an information system development methodology in
                 which these tools are systematically used [1,2]. The
                 successful construction of interactive information
                 systems requires the utilization of principles of
                 user-centered design [3,4,5], combined with features
                 traditionally associated with the separate areas of
                 programming languages, operating systems, and data base
                 management [6]. It has become increasingly clear that
                 the key to being able to provide such a unified view
                 lies in providing a unified view of data [7]. The
                 potential benefits of such a unification are
                 considerable, including: 1) conceptual simplification
                 of the system structure permitting, for example, joint
                 design of data structures and data bases 2) the
                 elimination of duplication or inconsistencies among
                 diverse software components 3) the ability to achieve
                 greater reliability in systems because of reduced
                 dependence upon multiple software systems",
  acknowledgement = ack-nhfb,
}

@Article{Weber:1981:DTU,
  author =       "Herbert Weber",
  title =        "Are data types universal modelling concepts for data
                 base systems?",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "1",
  pages =        "201--202",
  month =        jan,
  year =         "1981",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/960124.806923",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:11:45 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  abstract =     "Modelling encompasses two intellectual tasks: (1) the
                 perception of some reality and (2) the representation
                 of the perceived reality in accordance to a given model
                 (obviously is a representation once again some kind of
                 reality and hence subject to another representation in
                 accordance to another model or notation). Because of
                 human beings limited capabilities to perceive and
                 completely and correctly represent reality any
                 representation is an abstraction of the reality. A
                 representation in accordance to a given model is of
                 course constrained by that model. Any facet of reality
                 not representable with the model cannot be represented
                 at all. Moreover any model constrains at the very same
                 time the perception capabilities as well. Experience
                 verifies that knowledge of a model tends to force the
                 modeller to model according to this model even though
                 it may not result in the most accurate representation.
                 These two facts speak against an universal model but
                 makes for a variety of models for different purposes.
                 It is common practice for the representation of the
                 reality in data bases to apply different models for the
                 conceptual description of data bases or to apply
                 different kinds of models for the physical description
                 of data bases, etc.",
  acknowledgement = ack-nhfb,
}

@Article{Wedekind:1981:CAD,
  author =       "Hartmut H. Wedekind",
  title =        "Constructive {Abstract Data} types {(CAD)}",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "1",
  pages =        "203--206",
  month =        jan,
  year =         "1981",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/960126.806924",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:11:45 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  abstract =     "1. Distinction from conventional approaches The
                 motivation for CAD is to extend the idea of data
                 abstraction to application programming. Conventional
                 approaches confine themselves to operational concepts
                 of system programming like STACK, QUEUE etc. and do not
                 consider concepts like CONTRACT, INVOICE etc. of the
                 application world (AW) with an arbitrary number of
                 operations applicable to them, including those of the
                 ad hoc type.",
  acknowledgement = ack-nhfb,
}

@Article{Zilles:1981:TAM,
  author =       "Stephen N. Zilles",
  title =        "Types, algebras and modeling",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "1",
  pages =        "207--209",
  month =        jan,
  year =         "1981",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/960126.806925",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:11:45 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  abstract =     "Programming languages, database systems and artificial
                 intelligence systems all have the notion that entities
                 can be classified into types. As might be expected,
                 however, the usage of the notion of type is not the
                 same throughout or even within these areas. In this
                 paper, I propose a notion of typing that is derived
                 from work on programming languages and indicate how
                 this notion might be used in the context of database
                 systems. Thus, the paper is a step toward unifying the
                 notions of type in data-bases and programming
                 languages.",
  acknowledgement = ack-nhfb,
}

@Article{Bixler:1981:ASS,
  author =       "David C. Bixler",
  title =        "{Los Angeles SIGSPACE\slash SIGSOFT\slash SIGPLAN
                 December} meeting",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "2",
  pages =        "12--12",
  month =        feb,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:33 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
}

@Article{Ashworth:1981:PP,
  author =       "Robert Ashworth",
  title =        "Prettyprinting for power ({FORTRAN})",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "2",
  pages =        "16--17",
  month =        feb,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:33 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages); C7310 (Mathematics
                 computing)",
  corpsource =   "Southern Illinois Univ., Carbondale, IL, USA",
  keywords =     "FORTRAN; numerical data; power; prettyprinting;
                 programming languages; scientific notation",
  treatment =    "P Practical",
}

@Article{Bandyopadhyay:1981:SPL,
  author =       "S. K. Bandyopadhyay",
  title =        "A study on program level dependency of implemented
                 algorithms on its potential operands",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "2",
  pages =        "18--25",
  month =        feb,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:33 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory); C6140D
                 (High level languages)",
  corpsource =   "Avionics Div., Aeronautical Dev. Establ., Bangalore,
                 India",
  keywords =     "high level languages; high level programming language;
                 implemented algorithms; potential operands; program
                 level dependency; programming language; programming
                 theory",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Bandyopadhyay:1981:TRB,
  author =       "S. K. Bandyopadhyay",
  title =        "Theoretical relationships between potential operands
                 and basic measurable properties of algorithm
                 structure",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "2",
  pages =        "26--34",
  month =        feb,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:33 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory)",
  corpsource =   "Avionics Div., Aeronautical Dev. Establ., Bangalore,
                 India",
  keywords =     "algorithm structure; algorithm theory; basic
                 measurable properties; computer programs; potential
                 operands; programming theory; software parameters",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Haridi:1981:IEE,
  author =       "Seif Haridi and John-Olof Bauner and Gert Svensson",
  title =        "An implementation and empirical evaluation of the
                 tasking facilities in {ADA}",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "2",
  pages =        "35--47",
  month =        feb,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:33 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages)",
  corpsource =   "Dept. of Telecommunication and Computer Systems, Royal
                 Inst. of Technol., Stockholm, Sweden",
  keywords =     "Ada; empirical evaluation; implementation; kernel;
                 LSI-11 microcomputer; performance; size; tasking
                 facilities",
  treatment =    "P Practical",
}

@Article{Cormack:1981:ASO,
  author =       "G. V. Cormack",
  title =        "An algorithm for the selection of overloaded functions
                 in {ADA}",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "2",
  pages =        "48--52",
  month =        feb,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:33 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages)",
  corpsource =   "Dept. of Computer Sci., Univ. of Manitoba, Winnipeg,
                 Man., Canada",
  keywords =     "Ada; recursive algorithm; selects functions; stack",
  treatment =    "P Practical",
}

@Article{Dewhurst:1981:ERT,
  author =       "Stephen C. Dewhurst",
  title =        "An equivalence result for temporal logic",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "2",
  pages =        "53--55",
  month =        feb,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:33 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic)",
  keywords =     "equivalence; formal logic; linear time logic; temporal
                 logic",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Rutter:1981:UHL,
  author =       "Paul Rutter",
  title =        "Using a high level language as a cross assembler",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "2",
  pages =        "56--58",
  month =        feb,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:33 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages); C6150C (Compilers,
                 interpreters and other processors)",
  corpsource =   "Computer Systems Res., Philips Labs., Briarcliff
                 Manor, NY, USA",
  keywords =     "cross assembler; high level language; high level
                 languages; Motorola 68000; program assemblers",
  treatment =    "P Practical",
}

@Article{Hanson:1981:PL,
  author =       "David R. Hanson",
  title =        "The {Y} programming language",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "2",
  pages =        "59--68",
  month =        feb,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:33 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages)",
  corpsource =   "Dept. of Computer Sci., Univ. of Arizona, Tucson, AZ,
                 USA",
  keywords =     "high level languages; modules; semantics; semantics
                 structured control flow constructs; structured control
                 flow constructs; structured programming; syntax;
                 systems programming; systems software; Y programming
                 language",
  treatment =    "P Practical",
}

@Article{McLeanJones:1981:IS,
  author =       "Douglas {McLean Jones}",
  title =        "Introduction to {SQURL}",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "2",
  pages =        "69--76",
  month =        feb,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:33 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages); C7830 (Home
                 computing)",
  corpsource =   "Computer Sci., Texas Christian Univ., Fort Worth, TX,
                 USA",
  keywords =     "compiler; general purpose applications; high level
                 languages; microcomputers; programming language; SQURL;
                 structured; structured language; structured
                 programming",
  treatment =    "P Practical",
}

@Article{Moffat:1981:EPA,
  author =       "David V. Moffat",
  title =        "Enumerations in {Pascal}, {Ada}, and beyond",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "2",
  pages =        "77--82",
  month =        feb,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:33 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages)",
  corpsource =   "North Carolina State Univ., Raleigh, NC, USA",
  keywords =     "Ada; data structures; enumerations; language; Pascal;
                 programmer definable data type",
  treatment =    "P Practical",
}

@Article{Magee:1981:ICC,
  author =       "Patrick W. Magee",
  title =        "Improving the {COBOL CALLed} and {CALLing} program
                 interface with a pre-processor or {CALL} statements are
                 harmful, but can be controlled",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "2",
  pages =        "83--88",
  month =        feb,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:33 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages)",
  corpsource =   "Appl. Data Res. Inc., Princeton, NJ, USA",
  keywords =     "CALL statements; COBOL; IBM systems; pre-processor;
                 programmers; support system",
  treatment =    "P Practical",
}

@Article{Mahjoub:1981:SCA,
  author =       "Ahmed Mahjoub",
  title =        "Some comments on {Ada} as a real-time programming
                 language",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "2",
  pages =        "89--95",
  month =        feb,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:33 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages)",
  corpsource =   "Philips Labs., Briarcliff Manor, NY, USA",
  keywords =     "Ada; design; design distributed real-time systems;
                 distributed real-time systems; implementation; online
                 operation; real-time programming language",
  treatment =    "P Practical",
}

@Article{Silberschatz:1981:SMA,
  author =       "Abraham Silberschatz",
  title =        "On the synchronization mechanism of the {Ada}
                 language",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "2",
  pages =        "96--103",
  month =        feb,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:33 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages)",
  corpsource =   "Dept. of Computer Sci., Univ. of Texas, Austin, TX,
                 USA",
  keywords =     "accept statements; Ada; Ada language; select
                 statements; synchronization mechanism",
  treatment =    "P Practical",
}

@Article{Whitaker:1981:SAI,
  author =       "William A. Whitaker",
  title =        "Summary of the {ADA} implementor's meeting: {December
                 1980}",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "2",
  pages =        "104--109",
  month =        feb,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:33 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
}

@Article{Whitaker:1981:CPA,
  author =       "William A. Whitaker",
  title =        "Comments on portions of the {ACM SIGPLAN} conference
                 on the {ADA} programming language not available in the
                 proceedings",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "2",
  pages =        "110--112",
  month =        feb,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:33 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
}

@Article{Young:1981:SVP,
  author =       "William D. Young and Donald I. Good",
  title =        "Steelman and the verifiability of (preliminary)
                 {ADA}",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "2",
  pages =        "113--119",
  month =        feb,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:33 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages)",
  corpsource =   "Inst. of Computing Sci. and Computer Applications,
                 Univ. of Texas, Austin, TX, USA",
  keywords =     "Ada; DoD; language design; program testing; Steelman;
                 verifiability",
  treatment =    "P Practical",
}

@Article{Zimmer:1981:CFC,
  author =       "J. A. Zimmer",
  title =        "A control form for complex iterations",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "2",
  pages =        "120--131",
  month =        feb,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:33 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory)",
  corpsource =   "Dept. of Computer Sci., Worcester Polytech. Inst.,
                 Worcester, MA, USA",
  keywords =     "by states; complex iterations; control form;
                 programming theory",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Bates:1981:PPD,
  author =       "Rodney M. Bates",
  title =        "A {PASCAL} prettyprinter with a different purpose",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "3",
  pages =        "10--17",
  month =        mar,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:16:59 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6150C (Compilers, interpreters and other
                 processors)",
  corpsource =   "Dept. of Computer Sci., Kansas State Univ., Manhattan,
                 KS, USA",
  keywords =     "indentation; PASCAL prettyprinter; program processors;
                 reformulating",
  treatment =    "P Practical",
}

@Article{Cole:1981:ASC,
  author =       "S. N. Cole",
  title =        "{Ada} syntax cross reference",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "3",
  pages =        "18--47",
  month =        mar,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sat Apr 25 11:46:37 MDT 1998",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages); C6150C (Compilers,
                 interpreters and other processors)",
  keywords =     "Ada; Ada syntax; compiler validation; compiler
                 writing; language analyses; program compilers",
  treatment =    "P Practical",
}

@Article{Dailey:1981:PIS,
  author =       "Thomas M. {Dailey III}",
  title =        "A procedure invocation syntax for enhanced
                 readability",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "3",
  pages =        "48--52",
  month =        mar,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:16:59 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6110 (Systems analysis and programming)",
  corpsource =   "Training Control Systems Center, Honewell Inc., West
                 Covina, CA, USA",
  keywords =     "parenthesis; procedure invocation syntax; programming;
                 readability",
  treatment =    "P Practical",
}

@Article{Furtado:1981:PSI,
  author =       "A. L. Furtado and P. A. S. Veloso",
  title =        "Procedural specifications and implementations for
                 abstract data types",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "3",
  pages =        "53--62",
  month =        mar,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:16:59 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6120 (File organisation)",
  corpsource =   "Pontificia Univ. Catolica do Rio de Janeiro, Rio de
                 Janeiro, Brazil",
  keywords =     "abstract data types; algebraic specification;
                 canonical forms; data structures; procedural formalism;
                 SNOBOL; string manipulation language",
  treatment =    "P Practical",
}

@Article{Harrison:1981:CMB,
  author =       "Warren A. Harrison and Kenneth I. Magel",
  title =        "A complexity measure based on nesting level",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "3",
  pages =        "63--74",
  month =        mar,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:16:59 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6110 (Systems analysis and programming)",
  corpsource =   "Computer Sci. Dept., Univ. of Missouri, Rolla, MO,
                 USA",
  keywords =     "complexity measure; graphical techniques; graphs;
                 nesting level; program complexity; programming",
  treatment =    "P Practical",
}

@Article{Mengarini:1981:MFA,
  author =       "Bill Mengarini",
  title =        "Macro facilities in {ADA}",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "3",
  pages =        "75--81",
  month =        mar,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:16:59 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages)",
  keywords =     "Ada; macro facilities; macros; portability",
  treatment =    "P Practical",
}

@Article{Orejas:1981:EMA,
  author =       "Fernando Orejas",
  title =        "Even more on advice on structuring compilers and
                 proving them correct: changing an arrow",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "3",
  pages =        "82--84",
  month =        mar,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:16:59 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory); C6120
                 (File organisation); C6150C (Compilers, interpreters
                 and other organisation); C6150C (Compilers,
                 interpreters and other processors)",
  corpsource =   "Facultad de Matematicas, Univ. Complutense Madrid,
                 Spain",
  keywords =     "correctness; data structures; data types; program
                 compilers; programming theory; structuring compilers",
  treatment =    "P Practical",
}

@Article{Persch:1981:LGR,
  author =       "G. Persch and G. Winterstein and S. Drossopoulou and
                 M. Dausmann",
  title =        "An {LALR} (1) grammar for (revised) {Ada}",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "3",
  pages =        "85--98",
  month =        mar,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:16:59 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C6140D (High level languages);
                 C6150C (Compilers, interpreters and other processors)",
  corpsource =   "Univ. Karlsruhe, Karlsruhe, West Germany",
  keywords =     "Ada; bottom-up parsing; compilers; grammars; LALR (1)
                 grammar; program compilers",
  treatment =    "P Practical",
}

@Article{Tripathi:1981:HVV,
  author =       "Anand R. Tripathi and William D. Young and Donald I.
                 Good and James C. Browne",
  title =        "{HAL/S/V}: a verifiable subset for {HAL/S}",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "3",
  pages =        "102--113",
  month =        mar,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:16:59 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6110 (Systems analysis and programming); C6150G
                 (Diagnostic, testing, debugging and evaluating
                 systems)",
  corpsource =   "Inst. for Computing Sci. and Computer Appl., Univ. of
                 Texas, Austin, TX, USA",
  keywords =     "HAL/S/V; NASA space shuttle; program testing; program
                 verification; verifiable subset",
  treatment =    "P Practical",
}

@Article{Barach:1981:STR,
  author =       "David R. Barach and Frederick N. Webb",
  title =        "The symbol table representation of types in the
                 {PROPHET} system",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "4",
  pages =        "17--26",
  month =        apr,
  year =         "1981",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/988131.988133",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:14:38 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6150C (Compilers, interpreters and other
                 processors)",
  corpsource =   "Bolt Beranek and Newman Inc., Cambridge, MA, USA",
  keywords =     "one pass compiler; program compilers; PROPHET system;
                 routine system; symbol table representation; system
                 software; types",
  treatment =    "P Practical",
}

@Article{Bergstra:1981:CDS,
  author =       "J. A. Bergstra and J. J. Ch. Meyer",
  title =        "{I/O}-computable data structures",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "4",
  pages =        "27--32",
  month =        apr,
  year =         "1981",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/988131.988134",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:14:38 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
}

@Article{Bergstra:1981:ICD,
  author =       "J. A. Bergstra and J. J. Ch. Meyer",
  title =        "{I/O}-computable data structures",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "4",
  pages =        "27--32",
  month =        apr,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sat Apr 25 11:46:37 MDT 1998",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory); C6120
                 (File organisation)",
  corpsource =   "Dept. of Computer Sci., Univ. of Leiden, Leiden,
                 Netherlands",
  keywords =     "computable data structure; computable data structure
                 equivalence; data structures; I/O- equivalence;
                 I/O-computable data structure",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Crowley:1981:FSM,
  author =       "Charles Crowley",
  title =        "A finite state machine for {Western Swing}",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "4",
  pages =        "33--35",
  month =        apr,
  year =         "1981",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/988131.988135",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:14:38 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C7820 (Humanities computing)",
  corpsource =   "Computer Sci. Dept., Univ. of New Mexico, Albuquerque,
                 NM, USA",
  keywords =     "art; finite automata; finite state machines; graph
                 form; sports and entertainment; Western Swing dance
                 routines",
  treatment =    "A Application",
}

@Article{Falcone:1981:VPL,
  author =       "Joseph R. Falcone",
  title =        "A vector programming language",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "4",
  pages =        "36--50",
  month =        apr,
  year =         "1981",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/988131.988136",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:14:38 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages)",
  corpsource =   "Univ. of California, Berkeley, CA, USA",
  keywords =     "flan; high level languages; modern high level
                 language; vector programming language; vpl",
  treatment =    "P Practical",
}

@Article{Harrison:1981:TAC,
  author =       "Warren Harrison and Kenneth Magel",
  title =        "A topological analysis of the complexity of computer
                 programs with less than three binary branches",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "4",
  pages =        "51--63",
  month =        apr,
  year =         "1981",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/988131.988137",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:14:38 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory)",
  corpsource =   "Univ. of Missouri, Rolla, MO, USA",
  keywords =     "computational complexity; computer programs;
                 cyclomatic complexity model; scope complexity measure;
                 topological analysis; topology",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Hunt:1981:BPC,
  author =       "J. G. Hunt",
  title =        "Bracketing programme constructs",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "4",
  pages =        "64--67",
  month =        apr,
  year =         "1981",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/988131.988138",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:14:38 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6110 (Systems analysis and programming)",
  corpsource =   "Landis Gyr Zug AG, Zug, Switzerland",
  keywords =     "begin-end pairs; bracketing; programming; programming
                 constructs; symmetric keyword pairs; tag-ragend pairs",
  treatment =    "G General Review",
}

@Article{Kylov:1981:SPP,
  author =       "Haim I. Kylov and S. Nudelman",
  title =        "Structured programs in {PL/I}",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "4",
  pages =        "68--69",
  month =        apr,
  year =         "1981",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/988131.988139",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:14:38 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  abstract =     "This paper contains examples of structured PL/I
                 programs. For a number of years these programs were
                 assigned to LGU students majoring in economics/math in
                 their programming classes. This paper is designated for
                 students and other people studying programming.",
  acknowledgement = ack-nhfb,
  classification = "C6110 (Systems analysis and programming)",
  keywords =     "PL/I; structured programming; structured programs",
  treatment =    "G General Review",
}

@Article{Marca:1981:SPS,
  author =       "David Marca",
  title =        "Some {Pascal} style guidelines",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "4",
  pages =        "70--80",
  month =        apr,
  year =         "1981",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/988131.988140",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:14:38 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  abstract =     "The need for developing a style of writing Pascal
                 programs to allow reasonable rehosting success prompted
                 a study on Pascal style. Presented is a subset of
                 guidelines developed from that research, plus some
                 philosophy behind proper interpretation and enforcement
                 of those guidelines. Styling is defined for the
                 programming areas of: description using comments,
                 expression with identifier names and conditionals, and
                 the constructs of block, decision, repetition, and
                 qualification. Enforcement of style and using it in a
                 practical setting are also discussed.",
  acknowledgement = ack-nhfb,
  classification = "C6110 (Systems analysis and programming); C6140D
                 (High level languages)",
  corpsource =   "Commercial Systems Div., SofTech Inc., Waltham, MA,
                 USA",
  keywords =     "description using comments; identifier names; Pascal;
                 Pascal programs; Pascal style; programming; rehosting
                 success; style guidelines",
  treatment =    "P Practical",
}

@Article{Perkins:1981:LA,
  author =       "Hal Perkins",
  title =        "Lazy {I/O} is not the answer",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "4",
  pages =        "81--88",
  month =        apr,
  year =         "1981",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/988131.988141",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:14:38 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  abstract =     "Synchronization problems with input from terminal
                 devices in Pascal have existed for several years.
                 Recently, a technique known as 'lazy I/O' has achieved
                 popularity with implementors, and the latest published
                 version of the draft ISO Pascal Standard is carefully
                 worded to allow its use. This paper contends that lazy
                 I/O is not an adequate general solution to the problem,
                 and a simple solution that has been used successfully
                 in several implementations is proposed as an
                 alternative.",
  acknowledgement = ack-nhfb,
}

@Article{Perkins:1981:LIA,
  author =       "H. Perkins",
  title =        "Lazy {I/O} is not the answer",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "4",
  pages =        "81--88",
  month =        apr,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sat Apr 25 11:46:37 MDT 1998",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages); C6150J (Operating
                 systems)",
  corpsource =   "Computer Sci. Dept., Cornell Univ., Ithaca, NY, USA",
  keywords =     "input; input-output programs; lazy I/O; Pascal;
                 synchronisation",
  treatment =    "P Practical",
}

@Article{Tanik:1981:PMC,
  author =       "Murat M. Tanik",
  title =        "Prediction models for cyclomatic complexity",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "4",
  pages =        "89--97",
  month =        apr,
  year =         "1981",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/988131.988142",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:14:38 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory)",
  corpsource =   "Merle Collins Found., College Station, TX, USA",
  keywords =     "COBOL; computational complexity; cyclomatic
                 complexity; FORTRAN; prediction equations; prediction
                 models; program complexity; regression analysis;
                 software engineering; static program characteristics;
                 statistical analysis",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Sale:1981:ARU,
  author =       "A. H. J. Sale",
  title =        "Addition of {\tt repeat} \& {\tt until} as
                 identifiers",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "4",
  pages =        "98--103",
  month =        apr,
  year =         "1981",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/988131.988143",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:14:38 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6110 (Systems analysis and programming); C6140D
                 (High level languages)",
  corpsource =   "Dept. of Information Sci., Univ. of Tasmania, Hobart,
                 Tas., Australia",
  keywords =     "directives; identifiers; Pascal; programming; repeat;
                 until",
  treatment =    "P Practical",
}

@Article{Wolberg:1981:CCS,
  author =       "John R. Wolberg",
  title =        "Comparing the cost of software conversion to the cost
                 of reprogramming",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "4",
  pages =        "104--110",
  month =        apr,
  year =         "1981",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/988131.988144",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:14:38 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C0310 (EDP management)",
  corpsource =   "Faculty of Mech. Engng., Technion-Israel Inst. of
                 Technol., Haifa, Israel",
  keywords =     "cost comparison; DP management; reprogramming;
                 software conversion; software engineering; software
                 engineering management",
  treatment =    "E Economic",
}

@Article{Wexelblat:1981:NB,
  author =       "R. L. Wexelblat",
  title =        "New books",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "5",
  pages =        "16--18",
  month =        may,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:16:59 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
}

@Article{Cook:1981:SAP,
  author =       "Michael L. Cook and Mark G. Arnold",
  title =        "A structured {APL} preprocessor",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "5",
  pages =        "22--31",
  month =        may,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:16:59 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6120 (File organisation); C6140D (High level
                 languages); C6150C (Compilers, interpreters and other
                 processors)",
  corpsource =   "Computer Sci. Dept. Univ. of Wyoming, Laramie, WY,
                 USA",
  keywords =     "APL editor; APL interpreter; APL syntax; data
                 structures; debugging; high level languages; IF;
                 indented listing; keywords; program processors;
                 structured APL preprocessor; structured control
                 statements; syntactically valid places; translation;
                 WHILE",
  treatment =    "P Practical",
}

@Article{Levy:1981:MMS,
  author =       "Michael Levy",
  title =        "Meeting on melpomenes-a story used to introduce the
                 theory of data types",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "5",
  pages =        "32--35",
  month =        may,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:16:59 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C0220 (Computing education and training); C6120
                 (File organisation)",
  corpsource =   "Dept. of Computer Sci., Univ. of Victoria, Victoria,
                 BC, Canada",
  keywords =     "data structures; data types",
  treatment =    "G General Review",
}

@Article{Redwine:1981:PDE,
  author =       "Samuel T. {Redwine, Jr.}",
  title =        "A paradigm for dealing with exceptions",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "5",
  pages =        "36--38",
  month =        may,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:16:59 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6120 (File organisation); C6130 (Data handling
                 techniques)",
  corpsource =   "MITRE Corp., McLean, VA, USA",
  keywords =     "data handling; data structures; error function;
                 exceptions; input domain; paradigm; software
                 procedure",
  treatment =    "P Practical",
}

@Article{Remy:1981:EMC,
  author =       "J. L. Remy and P. A. S. Veloso",
  title =        "An economical method for comparing data type
                 specifications",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "5",
  pages =        "39--42",
  month =        may,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:16:59 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6120 (File organisation)",
  corpsource =   "CRIN, Nancy, France",
  keywords =     "abstract data type; data structures; data structures
                 normal forms; data type specifications; equivalence;
                 normal forms",
  treatment =    "P Practical",
}

@Article{Sassa:1981:PMR,
  author =       "Masataka Sassa",
  title =        "A poor man's realization of Recursive Structured
                 {FORTRAN}",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "5",
  pages =        "43--53",
  month =        may,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:16:59 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6110 (Systems analysis and programming); C6140D
                 (High level languages); C6150C (Compilers, interpreters
                 and other languages); C6150C (Compilers, interpreters
                 and other processors)",
  corpsource =   "Dept. of Information Sci., Tokyo Inst. of Technol.,
                 Tokyo, Japan",
  keywords =     "assembly-coded routine; ENTRY statements; FORTRAN;
                 macro processor; macros; program processors; recursive
                 procedures; Recursive Structured FORTRAN; structured
                 programming",
  treatment =    "P Practical",
}

@Article{Stepoway:1981:ELB,
  author =       "Stephen L. Stepoway and Abraham Silberschatz",
  title =        "An extension to the language-based access-control
                 mechanism of {Jones} and {Liskov}",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "5",
  pages =        "54--58",
  month =        may,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:16:59 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6120 (File organisation); C6130 (Data handling
                 techniques)",
  corpsource =   "Univ. of Texas, Dallas, TX, USA",
  keywords =     "abstract data types; data handling; data structures;
                 language-based access-control mechanism; programming
                 language; semantically correct programs; type
                 checking",
  treatment =    "P Practical",
}

@Article{Wasserman:1981:RRP,
  author =       "A. I. Wasserman and D. D. Sheretz and M. L. Kersten
                 and {van de Riet} and R. P. and M. D. Dippe",
  title =        "Revised report on the programming language {PLAIN}",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "5",
  pages =        "59--80",
  month =        may,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sat Apr 25 11:46:37 MDT 1998",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages)",
  corpsource =   "Section on Medical Information Sci., Univ. of
                 California, San Francisco, CA, USA",
  keywords =     "high level languages; interactive programs; PASCAL;
                 programming language PLAIN",
  treatment =    "P Practical",
}

@Article{Anonymous:1981:NBa,
  author =       "Anonymous",
  title =        "New books",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "5",
  pages =        "??--??",
  month =        may,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:16:59 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
}

@Article{Wood:1981:ZPE,
  author =       "Steven R. Wood",
  title =        "{Z}: the 95\% program editor",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "6",
  pages =        "1--7",
  month =        jun,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:34 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6130 (Data handling techniques); C6150C (Compilers,
                 interpreters and other processors)",
  conflocation = "Portland, OR, USA; 8-10 June 1981",
  conftitle =    "Proceedings of the ACM SIGPLAN SIGOA Symposium on Text
                 Manipulation",
  corpsource =   "Dept. of Computer Sci., Yale Univ., New Haven, CT,
                 USA",
  keywords =     "ASCII display terminals; design; full-duplex lines;
                 languages; program editor; program interpreters;
                 structure oriented editor; text editing; TOPS-20
                 monitor; Z-editor",
  subject =      "D.2.3 Software, SOFTWARE ENGINEERING, Coding, Program
                 editors \\ D.3.1 Software, PROGRAMMING LANGUAGES,
                 Formal Definitions and Theory, Semantics \\ D.3.1
                 Software, PROGRAMMING LANGUAGES, Formal Definitions and
                 Theory, Syntax \\ I.7 Computing Methodologies, TEXT
                 PROCESSING, Document Preparation",
  treatment =    "A Application",
}

@Article{Teitelbaum:1981:WWC,
  author =       "Tim Teitelbaum and Thomas Reps and Susan Horwitz",
  title =        "The why and wherefore of the {Cornell Program
                 Synthesizer}",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "6",
  pages =        "8--16",
  month =        jun,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:34 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C0220 (Computing education and training); C6130
                 (Data handling techniques); C6150G (Diagnostic,
                 testing, debugging and evaluating systems)",
  conflocation = "Portland, OR, USA; 8-10 June 1981",
  conftitle =    "Proceedings of the ACM SIGPLAN SIGOA Symposium on Text
                 Manipulation",
  corpsource =   "Dept. of Computer Sci., Cornell Univ., Ithaca, NY,
                 USA",
  keywords =     "algorithms; computer science education; design;
                 instructional dialect; placeholder; program debugging;
                 program synthesizer; syntax-directed programming;
                 template; text editing",
  subject =      "D.4.7 Software, OPERATING SYSTEMS, Organization and
                 Design, Interactive systems \\ D.2.3 Software, SOFTWARE
                 ENGINEERING, Coding, Program editors \\ D.2.5 Software,
                 SOFTWARE ENGINEERING, Testing and Debugging, Debugging
                 aids",
  treatment =    "A Application",
}

@Article{Fraser:1981:SDE,
  author =       "Christopher W. Fraser",
  title =        "{SYNTAX}-directed editing of general data structures",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "6",
  pages =        "17--21",
  month =        jun,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:34 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6120 (File organisation); C6130 (Data handling
                 techniques); C6150J (Operating systems)",
  conflocation = "Portland, OR, USA; 8-10 June 1981",
  conftitle =    "Proceedings of the ACM SIGPLAN SIGOA Symposium on Text
                 Manipulation",
  corpsource =   "Dept. of Computer Sci., Univ. of Arizona, Tucson, AZ,
                 USA",
  keywords =     "binary tree editor; connecting node; data structures;
                 design; directed editing; documents formatting; formal
                 language description; languages; line drawings;
                 supervisory and executive programs; syntactically
                 correct program; syntax directed editing; text
                 editing",
  subject =      "D.2.3 Software, SOFTWARE ENGINEERING, Coding, Program
                 editors \\ D.4.7 Software, OPERATING SYSTEMS,
                 Organization and Design, Hierarchical design \\ D.3.1
                 Software, PROGRAMMING LANGUAGES, Formal Definitions and
                 Theory, Syntax",
  treatment =    "A Application",
}

@Article{Stromfors:1981:IES,
  author =       "O. Str{\"o}mfors and L. Jonesj{\"o}",
  title =        "The implementation and experiences of a
                 structure-oriented text editor.",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "6",
  pages =        "22--27",
  month =        jun,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:34 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6130 (Data handling techniques); C6150J (Operating
                 systems)",
  conflocation = "Portland, OR, USA; 8-10 June 1981",
  conftitle =    "Proceedings of the ACM SIGPLAN SIGOA Symposium on Text
                 Manipulation",
  corpsource =   "Software Systems Res. Center, Link{\"o}ping Univ.,
                 Link{\"o}ping, Sweden",
  keywords =     "algorithms; data editing; data formatting; data
                 records; design; languages; structure-oriented text
                 editor; supervisory and executive programs; text
                 editing",
  subject =      "D.4.7 Software, OPERATING SYSTEMS, Organization and
                 Design, Interactive systems \\ I.7.1 Computing
                 Methodologies, TEXT PROCESSING, Text Editing, Languages
                 \\ I.4 Computing Methodologies, IMAGE PROCESSING,
                 Applications \\ D.2.7 Software, SOFTWARE ENGINEERING,
                 Distribution and Maintenance, Documentation",
  treatment =    "A Application",
}

@Article{Morris:1981:DLD,
  author =       "Joseph M. Morris and Mayer D. Schwartz",
  title =        "The design of a language-directed editor for
                 block-structured languages",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "6",
  pages =        "28--33",
  month =        jun,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:34 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6130 (Data handling techniques); C6140D (High level
                 languages)",
  conflocation = "Portland, OR, USA; 8-10 June 1981",
  conftitle =    "Proceedings of the ACM SIGPLAN SIGOA Symposium on Text
                 Manipulation",
  corpsource =   "Appl. Res. Group, Tektronix Labs., Tektronix Inc.,
                 Beaverton, OR, USA",
  keywords =     "algorithms; block-structured languages; design; high
                 level languages; language-directed editor; languages;
                 semantic; structured language; text editing; text
                 manipulation",
  subject =      "D.2.3 Software, SOFTWARE ENGINEERING, Coding, Program
                 editors \\ D.3.4 Software, PROGRAMMING LANGUAGES,
                 Processors, Compilers \\ D.3.1 Software, PROGRAMMING
                 LANGUAGES, Formal Definitions and Theory, Syntax \\
                 F.4.2 Theory of Computation, MATHEMATICAL LOGIC AND
                 FORMAL LANGUAGES, Grammars and Other Rewriting Systems,
                 Parsing",
  treatment =    "A Application",
}

@Article{Good:1981:EFU,
  author =       "Michael Good",
  title =        "{Etude} and the folklore of user interface design",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "6",
  pages =        "34--43",
  month =        jun,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:34 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C5610 (Computer interfaces); C6130 (Data handling
                 techniques)",
  conflocation = "Portland, OR, USA; 8-10 June 1981",
  conftitle =    "Proceedings of the ACM SIGPLAN SIGOA Symposium on Text
                 Manipulation",
  corpsource =   "Lab. for Computer Sci., MIT, Cambridge, MA, USA",
  keywords =     "bit-map display; computer interfaces; display screen;
                 high resolution display; interactive editor; MIT
                 Laboratory; text editing",
  subject =      "D.3.2 Software, PROGRAMMING LANGUAGES, Language
                 Classifications, Very high-level languages \\ H.4.1
                 Information Systems, INFORMATION SYSTEMS APPLICATIONS,
                 Office Automation, Equipment \\ D.2.5 Software,
                 SOFTWARE ENGINEERING, Testing and Debugging, Monitors",
  treatment =    "A Application",
}

@Article{Walker:1981:DES,
  author =       "Janet H. Walker",
  title =        "The document editor: {A} support environment for
                 preparing technical documents",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "6",
  pages =        "44--50",
  month =        jun,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:34 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6130 (Data handling techniques)",
  conflocation = "Portland, OR, USA; 8-10 June 1981",
  conftitle =    "Proceedings of the ACM SIGPLAN SIGOA Symposium on Text
                 Manipulation",
  corpsource =   "Bolt Beranek and Newman Inc., Cambridge, MA, USA",
  keywords =     "copying; design; document editor; languages; technical
                 writing; text editing",
  subject =      "I.7.2 Computing Methodologies, TEXT PROCESSING,
                 Document Preparation, Format and notation \\ I.7.2
                 Computing Methodologies, TEXT PROCESSING, Document
                 Preparation, Languages \\ I.7 Computing Methodologies,
                 TEXT PROCESSING, Index Generation",
  treatment =    "A Application; G General Review",
}

@Article{Turba:1981:CST,
  author =       "Thomas N. Turba",
  title =        "Checking for spelling and typographical errors in
                 computer-based text",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "6",
  pages =        "51--60",
  month =        jun,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:34 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6130 (Data handling techniques)",
  conflocation = "Portland, OR, USA; 8-10 June 1981",
  conftitle =    "Proceedings of the ACM SIGPLAN SIGOA Symposium on Text
                 Manipulation",
  keywords =     "computer-based text; design; format; languages;
                 phonetic language; proofreading; spelling; text
                 editing; typographical errors; word composition",
  subject =      "I.7.1 Computing Methodologies, TEXT PROCESSING, Text
                 Editing, Spelling \\ I.2.8 Computing Methodologies,
                 ARTIFICIAL INTELLIGENCE, Problem Solving, Control
                 Methods, and Search, Graph and tree search strategies
                 \\ D.2.2 Software, SOFTWARE ENGINEERING, Tools and
                 Techniques, User interfaces",
  treatment =    "A Application",
}

@Article{Cherry:1981:CAW,
  author =       "Lorinda Cherry",
  title =        "Computer aids for writers",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "6",
  pages =        "61--67",
  month =        jun,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:34 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6130 (Data handling techniques)",
  conflocation = "Portland, OR, USA; 8-10 June 1981",
  conftitle =    "Proceedings of the ACM SIGPLAN SIGOA Symposium on Text
                 Manipulation",
  corpsource =   "Bell Labs., Murray, Hill, NJ, USA",
  keywords =     "copy editor; design; dictionary; document; end marker;
                 preprocessing phrase; punctuation errors; readability;
                 sentence; sentence openers; spelling; split
                 infinitives; suffixes; surface features; text editing;
                 word length",
  subject =      "I.7.1 Computing Methodologies, TEXT PROCESSING, Text
                 Editing, Languages \\ I.7.2 Computing Methodologies,
                 TEXT PROCESSING, Document Preparation, Languages",
  treatment =    "A Application",
}

@Article{Goldfarb:1981:GAD,
  author =       "C. F. Goldfarb",
  title =        "A generalized approach to document markup",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "6",
  pages =        "68--73",
  month =        jun,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:34 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6130 (Data handling techniques)",
  conflocation = "Portland, OR, USA; 8-10 June 1981",
  conftitle =    "Proceedings of the ACM SIGPLAN SIGOA Symposium on Text
                 Manipulation",
  corpsource =   "IBM Corp., San Jose, CA, USA",
  keywords =     "design; document; document markup; figure caption;
                 hanging indent; logical elements; script formatting
                 language; text editing; text processing",
  subject =      "I.7.2 Computing Methodologies, TEXT PROCESSING,
                 Document Preparation, Format and notation \\ D.3.4
                 Software, PROGRAMMING LANGUAGES, Processors,
                 Compilers",
  treatment =    "A Application",
}

@Article{Allen:1981:PHD,
  author =       "Todd Allen and Robert Nix and Alan Perlis",
  title =        "{PEN}: {A} hierarchical document editor",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "6",
  pages =        "74--81",
  month =        jun,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:34 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6130 (Data handling techniques)",
  conflocation = "Portland, OR, USA; 8-10 June 1981",
  conftitle =    "Proceedings of the ACM SIGPLAN SIGOA Symposium on Text
                 Manipulation",
  corpsource =   "Computer Sci. Dept., Yale Univ., New Haven, CT, USA",
  keywords =     "compilation; computer controlled typesetting; design;
                 formatting; hierarchical document editor; interactive
                 editor; manuscript preparation; PEN system; text
                 editing; windowing",
  subject =      "D.4.7 Software, OPERATING SYSTEMS, Organization and
                 Design, Hierarchical design \\ D.4.7 Software,
                 OPERATING SYSTEMS, Organization and Design, Interactive
                 systems \\ I.2.7 Computing Methodologies, ARTIFICIAL
                 INTELLIGENCE, Natural Language Processing, Language
                 generation \\ D.4.8 Software, OPERATING SYSTEMS,
                 Performance, Queueing theory",
  treatment =    "A Application",
}

@Article{Chamberlin:1981:JIS,
  author =       "Donald D. Chamberlin and James C. King and Donald R.
                 Slutz and Stephen J. P. Todd and Bradford W. Wade",
  title =        "{JANUS}: {An} interactive system for document
                 composition",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "6",
  pages =        "82--91",
  month =        jun,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:34 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6130 (Data handling techniques)",
  conflocation = "Portland, OR, USA; 8-10 June 1981",
  conftitle =    "Proceedings of the ACM SIGPLAN SIGOA Symposium on Text
                 Manipulation",
  corpsource =   "IBM Res. Lab., San Jose, CA, USA",
  keywords =     "declarative text; design; document composition; JANUS;
                 line art; page; page layouts; pasteup step; point
                 addressable printer; tag definition language; text
                 editing; text mixture; tone art",
  subject =      "I.7.2 Computing Methodologies, TEXT PROCESSING,
                 Document Preparation, Format and notation \\ D.4.7
                 Software, OPERATING SYSTEMS, Organization and Design,
                 Interactive systems \\ D.2.2 Software, SOFTWARE
                 ENGINEERING, Tools and Techniques, Programmer
                 workbench",
  treatment =    "A Application",
}

@Article{Kernighan:1981:PLT,
  author =       "Brian W. Kernighan",
  title =        "{PIC}: a language for typesetting graphics",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "6",
  pages =        "92--98",
  month =        jun,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:34 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C5540 (Terminals and graphic displays); C6130B
                 (Graphics techniques); C6140D (High level languages)",
  conflocation = "Portland, OR, USA; 8-10 June 1981",
  conftitle =    "Proceedings of the ACM SIGPLAN SIGOA Symposium on Text
                 Manipulation",
  corpsource =   "Bell Labs., Murray Hill, NJ, USA",
  keywords =     "arcs; arrows; boxes; circles; computer graphics;
                 design; document preparation; ellipses; formatter; high
                 level languages; languages; lines; paragraph; paragraph
                 preprocessor; preprocessor; splines; text editing;
                 typesetting graphics; Unix system",
  subject =      "I.7.2 Computing Methodologies, TEXT PROCESSING,
                 Document Preparation, Languages",
  treatment =    "A Application",
}

@Article{VanWyde:1981:GTL,
  author =       "C. T. {Van Wyde}",
  title =        "A graphics typesetting language",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "6",
  pages =        "97--107",
  month =        jun,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sat Aug 13 17:16:20 MDT 1994",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; languages",
  subject =      "I.7.2 Computing Methodologies, TEXT PROCESSING,
                 Document Preparation, Photocomposition",
}

@Article{VanWyk:1981:GTL,
  author =       "Christopher J. {Van Wyk}",
  title =        "A graphics typesetting language",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "6",
  pages =        "99--107",
  month =        jun,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:34 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6130 (Data handling techniques); C6140D (High level
                 languages)",
  conflocation = "Portland, OR, USA; 8-10 June 1981",
  conftitle =    "Proceedings of the ACM SIGPLAN SIGOA Symposium on Text
                 Manipulation",
  corpsource =   "Bell Labs., Murray Hill, NJ, USA",
  keywords =     "arcs; block structured language; box; document
                 preparation system; graphics typesetting language; high
                 level languages; IDEAL program; text editing;
                 text-formatting systems",
  treatment =    "A Application",
}

@Article{Mikelsons:1981:PIP,
  author =       "Martin Mikelsons",
  title =        "Prettyprinting in an interactive programming
                 environment",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "6",
  pages =        "108--116",
  month =        jun,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:34 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C5540 (Terminals and graphic displays); C6130B
                 (Graphics techniques)",
  conflocation = "Portland, OR, USA; 8-10 June 1981",
  conftitle =    "Proceedings of the ACM SIGPLAN SIGOA Symposium on Text
                 Manipulation",
  corpsource =   "Computer Sci. Dept., IBM T.J. Watson Res. Center,
                 Yorktown Heights, NY, USA",
  keywords =     "algorithms; computer graphics; data representation;
                 design; ellipsis marks; formatter; interactive
                 programming; passed representation; prettyprinting;
                 sentence; sentence formatter; text editing; windowing",
  subject =      "D.2.3 Software, SOFTWARE ENGINEERING, Coding, Pretty
                 printers \\ I.4.0 Computing Methodologies, IMAGE
                 PROCESSING, General, Image displays",
  treatment =    "A Application",
}

@Article{Achugbue:1981:LBP,
  author =       "James O. Achugbue",
  title =        "On the line breaking problem in text formatting",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "6",
  pages =        "117--122",
  month =        jun,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:34 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6130 (Data handling techniques)",
  conflocation = "Portland, OR, USA; 8-10 June 1981",
  conftitle =    "Proceedings of the ACM SIGPLAN SIGOA Symposium on Text
                 Manipulation",
  corpsource =   "Dept. of Math. and Computer Sci., Michigan Technol.
                 Univ., Houghton, MI, USA",
  keywords =     "algorithm; break points; character position; design;
                 line breaking; line-by-line method; paragraph; surplus
                 space; text alignment; text editing; text formatting;
                 word string",
  subject =      "I.7.2 Computing Methodologies, TEXT PROCESSING,
                 Document Preparation, Format and notation \\ I.2.8
                 Computing Methodologies, ARTIFICIAL INTELLIGENCE,
                 Problem Solving, Control Methods, and Search, Dynamic
                 programming",
  treatment =    "A Application",
}

@Article{Gosling:1981:RA,
  author =       "James Gosling",
  title =        "A redisplay algorithm",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "6",
  pages =        "123--129",
  month =        jun,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:34 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C1180 (Optimisation techniques); C5540 (Terminals
                 and graphic displays); C6130 (Data handling
                 techniques)",
  conflocation = "Portland, OR, USA; 8-10 June 1981",
  conftitle =    "Proceedings of the ACM SIGPLAN SIGOA Symposium on Text
                 Manipulation",
  corpsource =   "Carnegie-Mellon Univ., Pittsburgh, PA, USA",
  keywords =     "algorithms; common subsequence; dynamic programming;
                 formatter; insert/delete character; insert/delete line;
                 performance; redisplay algorithm; sentence;
                 string-to-string correction; text editing; theory;
                 video terminal; windowing",
  subject =      "B.4.2 Hardware, INPUT/OUTPUT AND DATA COMMUNICATIONS,
                 Input/Output Devices, Data terminals and printers \\
                 B.4.2 Hardware, INPUT/OUTPUT AND DATA COMMUNICATIONS,
                 Input/Output Devices, Image display",
  treatment =    "A Application",
}

@Article{Barach:1981:DPV,
  author =       "David R. Barach and David H. Taenzer and Robert E.
                 Wells",
  title =        "Design of the {PEN} video editor display module",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "6",
  pages =        "130--136",
  month =        jun,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:34 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C5540 (Terminals and graphic displays); C6130B
                 (Graphics techniques)",
  conflocation = "Portland, OR, USA; 8-10 June 1981",
  conftitle =    "Proceedings of the ACM SIGPLAN SIGOA Symposium on Text
                 Manipulation",
  corpsource =   "Bolt Beranek and Newman Inc., Cambridge, MA, USA",
  keywords =     "computer graphics; design; formatter; keystroke;
                 modules; PEN; text editing; video editor display
                 module; windowing",
  subject =      "B.4.2 Hardware, INPUT/OUTPUT AND DATA COMMUNICATIONS,
                 Input/Output Devices, Image display \\ D.2.3 Software,
                 SOFTWARE ENGINEERING, Coding, Program editors \\ D.3.3
                 Software, PROGRAMMING LANGUAGES, Language Constructs,
                 Control structures",
  treatment =    "A Application",
}

@Article{Hammer:1981:IEI,
  author =       "Michael Hammer and Richard Ilson and Tim Anderson and
                 Edward Gilbert and Michael Good and Bahram Niamir and
                 Larry Rosentein and Sandor Schoichet",
  title =        "The implementation of {Etude}, an integrated and
                 interactive document production system",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "6",
  pages =        "137--146",
  month =        jun,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:34 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6130 (Data handling techniques)",
  conflocation = "Portland, OR, USA; 8-10 June 1981",
  conftitle =    "Proceedings of the ACM SIGPLAN SIGOA Symposium on Text
                 Manipulation",
  corpsource =   "Lab. for Computer Sci., MIT, Cambridge, MA, USA",
  keywords =     "anxiety factor; design; document production system;
                 Etude; experimentation; formatting; functionality; high
                 resolution screen; scribe system; text editing; text
                 processing system",
  subject =      "D.2.2 Software, SOFTWARE ENGINEERING, Tools and
                 Techniques, User interfaces \\ I.7.2 Computing
                 Methodologies, TEXT PROCESSING, Document Preparation,
                 Format and notation \\ H.4.1 Information Systems,
                 INFORMATION SYSTEMS APPLICATIONS, Office Automation,
                 Equipment \\ I.4.0 Computing Methodologies, IMAGE
                 PROCESSING, General, Image displays",
  treatment =    "A Application",
}

@Article{Stallman:1981:EEC,
  author =       "Richard M. Stallman",
  title =        "{EMACS}: the extensible, customizable self-documenting
                 display editor",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "6",
  pages =        "147--156",
  month =        jun,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:34 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6130 (Data handling techniques)",
  conflocation = "Portland, OR, USA; 8-10 June 1981",
  conftitle =    "Proceedings of the ACM SIGPLAN SIGOA Symposium on Text
                 Manipulation",
  corpsource =   "Artificial Intelligence Lab., MIT, Cambridge, MA,
                 USA",
  keywords =     "command languages; EMACS system; languages; MIT;
                 self-documenting display editor; text editing",
  subject =      "B.4.2 Hardware, INPUT/OUTPUT AND DATA COMMUNICATIONS,
                 Input/Output Devices, Image display \\ D.4.9 Software,
                 OPERATING SYSTEMS, Systems Programs and Utilities,
                 Command and control languages \\ D.2.7 Software,
                 SOFTWARE ENGINEERING, Distribution and Maintenance,
                 Extensibility",
  treatment =    "A Application",
}

@Article{Reid:1981:ABB,
  author =       "Brian K. Reid and David Hanson",
  title =        "An annotated bibliography of background material on
                 text manipulation",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "6",
  pages =        "157--160",
  month =        jun,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:34 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C0310 (EDP management); C6130 (Data handling
                 techniques)",
  conflocation = "Portland, OR, USA; 8-10 June 1981",
  conftitle =    "Proceedings of the ACM SIGPLAN SIGOA Symposium on Text
                 Manipulation",
  corpsource =   "Stanford Univ., Stanford, CA, USA",
  keywords =     "document formatting; graphic communication; pattern
                 matching; string communication; string matching; text
                 editing; text manipulation; typography; writing style",
  treatment =    "G General Review",
}

@Article{Goguen:1981:CMS,
  author =       "J. A. Goguen and J. Meseguer",
  title =        "Completeness of many-sorted equational logic",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "7",
  pages =        "24--32",
  month =        jul,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:17:00 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4240 (Programming and
                 algorithm theory)",
  corpsource =   "Computer Sci. Lab., SRI Internat., Menlo Park, CA,
                 USA",
  keywords =     "abstract data types; completeness theorem; computer
                 science; data structures; deduction; explicit
                 quantifiers; formal logic; many-sorted equational
                 logic",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Gonnet:1981:CBU,
  author =       "Gaston H. Gonnet",
  title =        "Coding benchmark for {Utopia84}",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "7",
  pages =        "33--34",
  month =        jul,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:17:00 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages)",
  corpsource =   "Dept. of Computer Sci., Univ. of Waterloo, Waterloo,
                 Ont., Canada",
  keywords =     "algorithms; benchmark; code; general purpose
                 languages; programming; programming languages",
  treatment =    "P Practical",
}

@Article{Hankin:1981:DFP,
  author =       "C. L. Hankin and H. W. Glaser",
  title =        "The data flow programming language {CAJOLE-an}
                 informal introduction",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "7",
  pages =        "35--44",
  month =        jul,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:17:00 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C5220 (Computer architecture); C6140D (High level
                 languages)",
  corpsource =   "Westfield Coll., London, UK",
  keywords =     "CAJOLE; computer architecture; computer organisation;
                 data flow; high level languages; high level textual
                 language; low level graphical programming language;
                 programming language",
  treatment =    "G General Review; P Practical",
}

@Article{Kneis:1981:DSI,
  author =       "Wilfried Kneis",
  title =        "Draft standard industrial real-time {FORTRAN}",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "7",
  pages =        "45--60",
  month =        jul,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:17:00 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages); C7420 (Control
                 engineering computing)",
  keywords =     "control; FORTRAN; industrial processes; industrial
                 real-time FORTRAN; process computer control; standard;
                 standards",
  treatment =    "P Practical",
}

@Article{Magel:1981:REP,
  author =       "Kenneth Magel",
  title =        "Regular expressions in a program complexity metric",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "7",
  pages =        "61--65",
  month =        jul,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:17:00 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory)",
  corpsource =   "Computer Sci. Dept., Univ. of Missouri, Rolla, MO,
                 USA",
  keywords =     "computational complexity; execution sequences; program
                 complexity metric; program control flow complexity;
                 regular expressions",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Moffat:1981:MPL,
  author =       "David V. Moffat",
  title =        "A model for {Pascal-like} typing",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "7",
  pages =        "66--74",
  month =        jul,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:17:00 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages)",
  corpsource =   "Dept. of Computer Sci., North Carolina State Univ.,
                 Raleigh, NC, USA",
  keywords =     "flexibility; new type; Pascal; Pascal program;
                 strongly typed languages; TYPE; typing mechanism",
  treatment =    "A Application; T Theoretical or Mathematical",
}

@Article{Perrott:1981:UEI,
  author =       "R. H. Perrott and D. K. Stevenson",
  title =        "Users' experiences with the {ILLIAC IV} system and its
                 programming languages",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "7",
  pages =        "75--88",
  month =        jul,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:17:00 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages)",
  corpsource =   "Inst. for Advanced Computation, NASA-Ames Res. Center,
                 Moffett Field, CA, USA",
  keywords =     "CFD; GLYPNIR; high level languages; high-level
                 programming languages; ILLIAC IV; IVTRAN; lockstep
                 parallel processing; parallel processing; programming
                 languages",
  treatment =    "G General Review; P Practical",
}

@Article{Silberschatz:1981:NDP,
  author =       "Abraham Silberschatz",
  title =        "A note on the distributed program component cell",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "7",
  pages =        "89--96",
  month =        jul,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:17:00 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages)",
  corpsource =   "Dept. of Computer Sci., Univ. of Texas, Austin, TX,
                 USA",
  keywords =     "cell; distributed processing; distributed program;
                 high level languages; language construct; programmer;
                 simulate; synchronization",
  treatment =    "P Practical",
}

@Article{Wexelblat:1981:NBM,
  author =       "R. L. Wexelblat",
  title =        "New books: {May 1981}",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "8",
  pages =        "6--9",
  month =        aug,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:17:00 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
}

@Article{Wexelblat:1981:NBJ,
  author =       "R. L. Wexelblat",
  title =        "New books: {June 1981}",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "8",
  pages =        "10--13",
  month =        aug,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:17:00 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
}

@Article{Burgess:1981:IBL,
  author =       "C. Burgess and L. James",
  title =        "An indexed bibliography for {LR} grammars and
                 parsers",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "8",
  pages =        "14--26",
  month =        aug,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sat Apr 25 11:46:37 MDT 1998",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic)",
  corpsource =   "Dept. of Computer Sci., Univ. of Bristol, Bristol,
                 UK",
  keywords =     "grammars; indexed bibliography; LR grammars; parsers",
  treatment =    "B Bibliography",
}

@Article{Payne:1981:BSP,
  author =       "A. J. Payne",
  title =        "A basis for software physics?",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "8",
  pages =        "27--30",
  month =        aug,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:17:00 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory); C6110
                 (Systems analysis and programming)",
  corpsource =   "Waikato Univ., Hamilton, New Zealand",
  keywords =     "mean free path theorem; operational research
                 technique; programming theory; software engineering;
                 software physics; theory of search",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Rapin:1981:NL,
  author =       "Ch. Rapin and J. Menu",
  title =        "The {Newton} language",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "8",
  pages =        "31--40",
  month =        aug,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:17:00 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages)",
  corpsource =   "Dept de Math. Appl., EPF-Lausanne, Lausanne,
                 Switzerland",
  keywords =     "high level languages; Newton language; Pascal",
  treatment =    "P Practical",
}

@Article{Schilit:1981:SGB,
  author =       "Bill N. Schilit",
  title =        "A solution to the great big substitution problem:
                 subject modification during pattern matching in
                 {SNOBOL4}",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "8",
  pages =        "41--49",
  month =        aug,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:17:00 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages)",
  corpsource =   "Center for Computing Activities, Columbia Univ., New
                 York, NY, USA",
  keywords =     "data handling; high level languages; pattern matching;
                 programming language; SNOBOL4; substitution problem;
                 substrings",
  treatment =    "P Practical",
}

@Article{Shapiro:1981:PPE,
  author =       "Ehud Shapiro and Gregg Collins and Lewis Johnson and
                 John Ruttenberg",
  title =        "{PASES}: a programming environment for {PASCAL}",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "8",
  pages =        "50--57",
  month =        aug,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:17:00 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6110 (Systems analysis and programming); C6140D
                 (High level languages); C6150G (Diagnostic, testing,
                 debugging and evaluating systems)",
  corpsource =   "Dept. of Computer Sci., Yale Univ., New Haven, CT,
                 USA",
  keywords =     "debugging; debugging programming; Pascal; PASCAL;
                 PASES; program debugging; programming; programming
                 environment; top down programming",
  treatment =    "P Practical",
}

@Article{Spector:1981:FLP,
  author =       "David Spector",
  title =        "Full {LR(1)} parser generation",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "8",
  pages =        "58--66",
  month =        aug,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:17:00 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic)",
  corpsource =   "Prime Computer Inc., Framingham, MA, USA",
  keywords =     "grammars; language design; LR(1) parser generation;
                 pushdown automation",
  treatment =    "P Practical",
}

@Article{vanderLinden:1981:MFA,
  author =       "Peter van der Linden and Leonard K. Nicholson",
  title =        "Macro facilities in the {Ada} environment",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "8",
  pages =        "67--68",
  month =        aug,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:17:00 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages); C6150C (Compilers,
                 interpreters and other processors)",
  corpsource =   "Dept. of Computer Sci., Yale Univ., New Haven, CT,
                 USA",
  keywords =     "Ada; APL; APSE; compiler; INTERLISP; macro-processing
                 facility; program compilers",
  treatment =    "P Practical",
}

@Article{Winkler:1981:DBPa,
  author =       "J. F. H. Winkler",
  title =        "Differences between preliminary and final {Ada}",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "8",
  pages =        "69--81",
  month =        aug,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:17:00 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages)",
  corpsource =   "Siemens AG, Munich, West Germany",
  keywords =     "Ada",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Anonymous:1981:NBb,
  author =       "Anonymous",
  title =        "New books",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "8",
  pages =        "??--??",
  month =        aug,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:17:00 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
}

@Article{Bonet:1981:ASD,
  author =       "Rafael Bonet and Antonio Kung and Knut Ripken and
                 Robert K. Yates and Manfred Sommer and J{\"u}rgen
                 Winkler",
  title =        "{Ada} syntax diagrams for top-down analysis",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "9",
  pages =        "29--41",
  month =        sep,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:36 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C6140D (High level
                 languages)",
  corpsource =   "TECSI-Software, Paris, France",
  keywords =     "Ada; Ada grammar; extended BNF; grammars; LL grammar;
                 syntax diagrams; top-down analysis",
  treatment =    "P Practical",
}

@Article{Booch:1981:DSD,
  author =       "Grady Booch",
  title =        "Describing software design in {Ada}",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "9",
  pages =        "42--47",
  month =        sep,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:36 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages); C6150E (General
                 utility programs)",
  corpsource =   "Dept. of Astronautics/Computer Sci., USAF Acad., CO,
                 USA",
  keywords =     "Ada; FORTRAN mind set; object-oriented methodology;
                 programming support environment; software design;
                 software engineering; top down functional
                 methodologies; utility programs",
  treatment =    "P Practical",
}

@Article{DeRemer:1981:ASC,
  author =       "Frank DeRemer and Tom Penncllo and W. M. McKeeman",
  title =        "{Ada} syntax chart",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "9",
  pages =        "48--59",
  month =        sep,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:36 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C6140D (High level
                 languages)",
  corpsource =   "Computer and Information Sci., Univ. of California,
                 Santa Cruz, CA, USA",
  keywords =     "Ada; Ada syntax; grammars; LALR(1) Ada grammar;
                 MetaWare Translator Writing System; nonterminal
                 symbols",
  treatment =    "P Practical",
}

@Article{Konstam:1981:MCP,
  author =       "Aaron H. Konstam",
  title =        "A method for controlling parallelism in programming
                 languages",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "9",
  pages =        "60--65",
  month =        sep,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:36 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages)",
  corpsource =   "Trinity Univ., San Antonio, TX, USA",
  keywords =     "AMPLE; APL; Array Manipulation Programming Language
                 Extension; batch programming language; high level
                 languages; parallel processing; parallelism; PL/1;
                 PL/I; programming languages",
  treatment =    "P Practical",
}

@Article{Lauer:1981:SCP,
  author =       "P. E. Lauer",
  title =        "Synchronization of concurrent processes without
                 globality assumptions",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "9",
  pages =        "66--80",
  month =        sep,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:36 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6150J (Operating systems)",
  corpsource =   "Computing Lab., Univ. of Newcastle Upon Tyne,
                 Newcastle Upon Tyne, UK",
  keywords =     "automatic theory; concurrent processes; control;
                 distributed processing; globality assumptions;
                 observer; operating systems (computers); OS;
                 synchronization; system clock; system state",
  treatment =    "P Practical",
}

@Article{Rowland:1981:EPR,
  author =       "David A. Rowland",
  title =        "An extension to {PASCAL READ} and {WRITE} procedures",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "9",
  pages =        "81--82",
  month =        sep,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:36 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages)",
  corpsource =   "Real-Time Software Associates, Berkeley, CA, USA",
  keywords =     "character; PASCAL; Pascal; READ; user procedure; WRITE
                 procedures",
  treatment =    "P Practical",
}

@Article{Shimon:1981:SER,
  author =       "Cohen Shimon",
  title =        "Simplicity $=$ efficiency $=$ readability: a simple
                 {INFIX} to {PREFIX} algorithm",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "9",
  pages =        "83--89",
  month =        sep,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:36 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6110 (Systems analysis and programming)",
  corpsource =   "Computer Sci. Dept., Hebrew Univ., Jerusalem, Israel",
  keywords =     "INFIX; LISP; PASCAL; PREFIX; programming",
  treatment =    "P Practical",
}

@Article{Wetherell:1981:PAR,
  author =       "C. S. Wetherell",
  title =        "Problems with the {Ada} reference grammar",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "9",
  pages =        "90--104",
  month =        sep,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:36 MST 2003",
  bibsource =    "http://portal.acm.org/",
  note =         "See note \cite{Machanick:1983:NCW}.",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C6140D (High level
                 languages)",
  corpsource =   "Bell Labs., Murray Hill, NJ, USA",
  keywords =     "Ada; Ada reference grammar; compiler construction;
                 grammars; language design; LR(1) parsing; parser
                 generation system; programming languages; programming
                 parsing",
  treatment =    "P Practical",
}

@Article{Ganapathi:1981:BAR,
  author =       "M. Ganapathi and C. N. Fischer",
  title =        "Bibliography on automated retargetable code
                 generation",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "10",
  pages =        "9--12",
  month =        oct,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sat Apr 25 11:46:37 MDT 1998",
  acknowledgement = ack-nhfb,
  classification = "C6110 (Systems analysis and programming); C6150C
                 (Compilers, interpreters and other processors)",
  corpsource =   "Intel Corp., Santa Clara, CA, USA",
  keywords =     "automated retargetable code generation; compiler
                 research; portable code generation; program compilers;
                 software portability",
  treatment =    "B Bibliography",
}

@Article{Gustafson:1981:CFD,
  author =       "David A. Gustafson",
  title =        "Control flow, data flow and data independence",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "10",
  pages =        "13--19",
  month =        oct,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:37 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6110 (Systems analysis and programming)",
  corpsource =   "Dept. of Computer Sci., Kansas State Univ., Manhattan,
                 KS, USA",
  keywords =     "computer science; control flow; data flow; data
                 independence; flow diagrams; program testing; program
                 transformations; software engineering; symbolic
                 execution",
  treatment =    "G General Review; P Practical",
}

@Article{Maher:1981:DDS,
  author =       "B. Maher and D. H. Sleeman",
  title =        "A data driven system for syntactic transformations",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "10",
  pages =        "50--52",
  month =        oct,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:37 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6120 (File organisation); C6150C (Compilers,
                 interpreters and other processors)",
  corpsource =   "Dept. of Computer Studies, Univ. of Leeds, Leeds, UK",
  keywords =     "algorithmic languages; data structures; interpreters;
                 meta-language; program interpreters; syntactic
                 transformations; syntax",
  treatment =    "P Practical",
}

@Article{Malcolm:1981:BCC,
  author =       "James A. Malcolm",
  title =        "Brevity and clarity in command languages",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "10",
  pages =        "53--59",
  month =        oct,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:37 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages)",
  corpsource =   "Rothamsted Experimental Station, Harpenden, UK",
  keywords =     "command languages; high level languages; programming
                 language",
  treatment =    "P Practical",
}

@Article{Maurer:1981:ACP,
  author =       "W. D. Maurer",
  title =        "An alternate characterization of preorder, inorder,
                 and postorder",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "10",
  pages =        "60--61",
  month =        oct,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:37 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6130 (Data handling techniques)",
  corpsource =   "George Washington Univ. (SEAS), Washington, DC, USA",
  keywords =     "binary sequences; binary tree; characterisation;
                 inorder; postorder; preorder; sorting; trees
                 (mathematics)",
  treatment =    "P Practical",
}

@Article{Narayana:1981:FTP,
  author =       "K. T. Narayana and M. Clint",
  title =        "On the formal treatment of a permutation finding
                 program",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "10",
  pages =        "62--73",
  month =        oct,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:37 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory)",
  corpsource =   "Dept. of Computer Sci., Queen's Univ. of Belfast,
                 Belfast, UK",
  keywords =     "ordered sequence; permutation finding program;
                 programming theory; proof",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Jenks:1981:LCA,
  author =       "Richard D. Jenks and Barry M. Trager",
  title =        "A language for computational algebra",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "11",
  pages =        "22--29",
  month =        nov,
  year =         "1981",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/988125.988127",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:15:01 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  abstract =     "This paper reports ongoing research at the IBM
                 Research Center on the development of a language with
                 extensible parameterized types and generic operators
                 for computational algebra. The language provides an
                 abstract data type mechanism for defining algorithms
                 which work in as general a setting as possible. The
                 language is based on the notions of domains and
                 categories. Domains represent algebraic structures.
                 Categories designate collections of domains having
                 common operations with stated mathematical properties.
                 Domains and categories are computed objects which may
                 be dynamically assigned to variables, passed as
                 arguments, and returned by functions. Although the
                 language has been carefully tailored for the
                 application of algebraic computation, it actually
                 provides a very general abstract data type mechanism.
                 Our notion of a category to group domains with common
                 properties appears novel among programming languages
                 (cf. image functor of RUSSELL) and leads to a very
                 powerful notion of abstract algorithms missing from
                 other work on data types known to the authors.",
  acknowledgement = ack-nhfb,
  classification = "C6120 (File organisation); C6140D (High level
                 languages)",
  corpsource =   "Math. Sci. Dept., IBM Res. Center, Yorktown Heights,
                 NY, USA",
  keywords =     "abstract data type mechanism; categories;
                 computational algebra; data structures; domains; high
                 level languages",
  treatment =    "P Practical",
}

@Article{Mayer:1981:VRP,
  author =       "Alastair J. W. Mayer",
  title =        "Value receiving procedures",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "11",
  pages =        "30--34",
  month =        nov,
  year =         "1981",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/988125.988128",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:15:01 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  abstract =     "The concept of value receiving procedures (functions
                 which may act as the target of an assignment statement)
                 is described and their utility discussed. The new
                 keyword receive is suggested as an Ada extension.
                 Extensions are also suggested for Pascal and PL/I.",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages)",
  corpsource =   "Concordia Univ. Computer Centre, Concordia Univ.,
                 Montreal, Que., Canada",
  keywords =     "Ada; assignment statement; PASCAL; PL/I; receive;
                 value receiving procedures",
  treatment =    "P Practical",
}

@Article{Winkler:1981:DBPb,
  author =       "J. F. H. Winkler",
  title =        "Differences between preliminary and final {Ada}",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "11",
  pages =        "35--48",
  month =        nov,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sat Apr 25 11:46:37 MDT 1998",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages)",
  corpsource =   "Siemens AG, Munich, West Germany",
  keywords =     "Ada",
  treatment =    "P Practical",
}

@Article{Ince:1981:IFS,
  author =       "Darrel C. Ince",
  title =        "The implementation of file structures in some high
                 level languages",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "11",
  pages =        "49--55",
  month =        nov,
  year =         "1981",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/988125.988129",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:15:01 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6120 (File organisation); C6140D (High level
                 languages)",
  corpsource =   "Faculty of Math., Open Univ., Milton Keynes, UK",
  keywords =     "Ada; ALGOL 68; Algol 68; file organisation; file
                 structures; hashed files; high level languages; indexed
                 sequential files; Pascal; PASCAL; Pascal",
  treatment =    "P Practical",
}

@Article{Elliott:1981:FSD,
  author =       "D. G. Elliott",
  title =        "{FORTRAN 77} and structured design",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "12",
  pages =        "7--9",
  month =        dec,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:38 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6110 (Systems analysis and programming); C6140D
                 (High level languages)",
  corpsource =   "Telecom, Melbourne, Vic., Australia",
  keywords =     "deficiencies; FORTRAN; FORTRAN 77; structured design;
                 structured programming",
  treatment =    "P Practical",
}

@Article{Morris:1981:CAR,
  author =       "Alfred H. {Morris, Jr.}",
  title =        "Can {Ada} replace {FORTRAN} for numerical
                 computation?",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "12",
  pages =        "10--13",
  month =        dec,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:38 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages); C7310 (Mathematics
                 computing)",
  corpsource =   "Naval Surface Weapons Center, Dahlgren, VA, USA",
  keywords =     "Ada; array; constructs; FORTRAN; numerical analysis;
                 numerical computation; programming language; scientific
                 computation",
  treatment =    "P Practical",
}

@Article{Fitzhorn:1981:CTC,
  author =       "Patrick A. Fitzhorn and Gearold R. Johnson",
  title =        "{C}: toward a concise syntactic description",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "12",
  pages =        "14--21",
  month =        dec,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:38 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages)",
  corpsource =   "Dept. of Computer Sci., Colorado State Univ., Ft.
                 Collins, CO, USA",
  keywords =     "C; host language; low level systems programming
                 language; operating system; programming languages;
                 syntactic description; UNIX",
  treatment =    "P Practical",
}

@Article{Ben-Ari:1981:MMU,
  author =       "Mordechai Ben-Ari and Amiram Yehudai",
  title =        "A methodology for modular use of {Ada}",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "12",
  pages =        "22--26",
  month =        dec,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:38 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages)",
  corpsource =   "Dept. of Computer Sci., Tel Aviv Univ., Ramat Aviv,
                 Israel",
  keywords =     "Ada; conventions; language; modular compiler; modular
                 programming methodology; programmers; programming",
  treatment =    "P Practical",
}

@Article{VanDeusen:1981:TR,
  author =       "Mary {Van Deusen}",
  title =        "Types in {RED}",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "12",
  pages =        "27--38",
  month =        dec,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Sun Dec 14 09:14:38 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages)",
  corpsource =   "Prime Computer Inc., Framingham, MA, USA",
  keywords =     "Department of Defense; high level languages;
                 high-order; high-order language; programming language;
                 RED; Steelman; type system",
  treatment =    "P Practical",
}

@Article{Backus:1981:HFI,
  author =       "J. Backus",
  title =        "The history of {FORTRAN I}, {II}, and {III}",
  journal =      j-SIGPLAN,
  volume =       "18",
  number =       "6",
  pages =        "25--74",
  month =        jun,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Mon Aug 22 14:20:57 1994",
  acknowledgement = ack-nhfb,
}

@Article{Perlis:1981:ASD,
  author =       "A. J. Perlis",
  title =        "The {American} side of the development of {ALGOL}",
  journal =      j-SIGPLAN,
  volume =       "18",
  number =       "6",
  pages =        "75--91",
  month =        jun,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Mon Aug 22 14:21:06 1994",
  acknowledgement = ack-nhfb,
  keywords =     "languages",
  review =       "ACM CR 39166",
  subject =      "D.3 Software, PROGRAMMING LANGUAGES, Language
                 Classifications \\ K.2 Computing Milieux, HISTORY OF
                 COMPUTING, ALGOL \\ K.2 Computing Milieux, HISTORY OF
                 COMPUTING, Software",
}

@Article{Naur:1981:ESL,
  author =       "P. Naur",
  title =        "The {European} side of the last phase of the
                 development of {ALGOL 60}",
  journal =      j-SIGPLAN,
  volume =       "18",
  number =       "6",
  pages =        "92--172",
  month =        jun,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Mon Aug 22 14:21:04 1994",
  acknowledgement = ack-nhfb,
  keywords =     "languages",
  review =       "ACM CR 39167",
  subject =      "D.3 Software, PROGRAMMING LANGUAGES, Language
                 Classifications \\ K.2 Computing Milieux, HISTORY OF
                 COMPUTING, ALGOL \\ K.2 Computing Milieux, HISTORY OF
                 COMPUTING, Software",
}

@Article{McCarthy:1981:HL,
  author =       "J. McCarthy",
  title =        "History of {LISP}",
  journal =      j-SIGPLAN,
  volume =       "18",
  number =       "6",
  pages =        "173--197",
  month =        jun,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Mon Aug 22 14:21:03 1994",
  acknowledgement = ack-nhfb,
  keywords =     "languages",
  review =       "ACM CR 39175",
  subject =      "D.3 Software, PROGRAMMING LANGUAGES, Language
                 Classifications \\ I.2 Computing Methodologies,
                 ARTIFICIAL INTELLIGENCE, Programming Languages and
                 Software \\ K.2 Computing Milieux, HISTORY OF
                 COMPUTING, LISP \\ K.2 Computing Milieux, HISTORY OF
                 COMPUTING, Software",
}

@Article{Sammet:1981:EHC,
  author =       "J. E. Sammet",
  title =        "The early history of {COBOL}",
  journal =      j-SIGPLAN,
  volume =       "18",
  number =       "6",
  pages =        "199--277",
  month =        jun,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Mon Aug 22 14:21:09 1994",
  acknowledgement = ack-nhfb,
  keywords =     "languages",
  review =       "ACM CR 39171",
  subject =      "K.2 Computing Milieux, HISTORY OF COMPUTING, Software
                 \\ K.2 Computing Milieux, HISTORY OF COMPUTING, COBOL
                 \\ D.3 Software, PROGRAMMING LANGUAGES, Language
                 Classifications",
}

@Article{Ross:1981:OAL,
  author =       "D. T. Ross",
  title =        "Origins of the {APT} language for automatically
                 programmed tools",
  journal =      j-SIGPLAN,
  volume =       "18",
  number =       "6",
  pages =        "279--367",
  month =        jun,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Mon Aug 22 14:21:08 1994",
  acknowledgement = ack-nhfb,
  keywords =     "languages",
  review =       "ACM CR 39169",
  subject =      "J Computer Applications, COMPUTER-AIDED ENGINEERING
                 \\
                 K.2 Computing Milieux, HISTORY OF COMPUTING, APT \\ K.2
                 Computing Milieux, HISTORY OF COMPUTING, Software",
}

@Article{Schwartz:1981:DJ,
  author =       "J. I. Schwartz",
  title =        "The development of {JOVIAL}",
  journal =      j-SIGPLAN,
  volume =       "18",
  number =       "6",
  pages =        "369--401",
  month =        jun,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Mon Aug 22 14:21:10 1994",
  acknowledgement = ack-nhfb,
  keywords =     "languages",
  review =       "ACM CR 39174",
  subject =      "D.3 Software, PROGRAMMING LANGUAGES, Language
                 Classifications \\ K.2 Computing Milieux, HISTORY OF
                 COMPUTING, JOVIAL \\ K.2 Computing Milieux, HISTORY OF
                 COMPUTING, Software",
}

@Article{Gordon:1981:DGP,
  author =       "G. Gordon",
  title =        "The development of the General Purpose Simulation
                 System ({GPSS})",
  journal =      j-SIGPLAN,
  volume =       "18",
  number =       "6",
  pages =        "403--437",
  month =        jun,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Mon Aug 22 14:21:00 1994",
  acknowledgement = ack-nhfb,
  keywords =     "languages",
  review =       "ACM CR 39173",
  subject =      "D.3 Software, PROGRAMMING LANGUAGES, Language
                 Classifications \\ I.6 Computing Methodologies,
                 SIMULATION AND MODELING, Simulation Languages \\ K.2
                 Computing Milieux, HISTORY OF COMPUTING, GPSS \\ K.2
                 Computing Milieux, HISTORY OF COMPUTING, Software",
}

@Article{Nygaard:1981:DSL,
  author =       "K. Nygaard",
  title =        "The development of the {SIMULA} languages",
  journal =      j-SIGPLAN,
  volume =       "18",
  number =       "6",
  pages =        "439--493",
  month =        jun,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Mon Aug 22 14:21:05 1994",
  acknowledgement = ack-nhfb,
  keywords =     "languages",
  subject =      "I.6.2 Computing Methodologies, SIMULATION AND
                 MODELING, Simulation Languages, SIMULA",
}

@Article{Kurtz:1981:B,
  author =       "T. E. Kurtz",
  title =        "{BASIC}",
  journal =      j-SIGPLAN,
  volume =       "18",
  number =       "6",
  pages =        "515--549",
  month =        jun,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Mon Aug 22 14:21:02 1994",
  acknowledgement = ack-nhfb,
  keywords =     "languages",
  review =       "ACM CR 39170",
  subject =      "D.3 Software, PROGRAMMING LANGUAGES, Language
                 Classifications \\ K.2 Computing Milieux, HISTORY OF
                 COMPUTING, BASIC \\ K.2 Computing Milieux, HISTORY OF
                 COMPUTING, Software",
}

@Article{Radin:1981:EHC,
  author =       "G. Radin",
  title =        "The early history and characteristics of {PL\slash
                 I}",
  journal =      j-SIGPLAN,
  volume =       "18",
  number =       "6",
  pages =        "551--599",
  month =        jun,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Mon Aug 22 14:21:07 1994",
  acknowledgement = ack-nhfb,
  keywords =     "languages",
  review =       "ACM CR 39176",
  subject =      "D.3 Software, PROGRAMMING LANGUAGES, Language
                 Classifications \\ K.2 Computing Milieux, HISTORY OF
                 COMPUTING, PL/I \\ K.2 Computing Milieux, HISTORY OF
                 COMPUTING, Software",
}

@Article{Griswold:1981:HSP,
  author =       "R. E. Griswold",
  title =        "A history of the {SNOBOL} programming languages",
  journal =      j-SIGPLAN,
  volume =       "18",
  number =       "6",
  pages =        "601--660",
  month =        jun,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Mon Aug 22 14:21:01 1994",
  acknowledgement = ack-nhfb,
  keywords =     "languages",
  review =       "ACM CR 39177",
  subject =      "D.3 Software, PROGRAMMING LANGUAGES, Language
                 Classifications \\ K.2 Computing Milieux, HISTORY OF
                 COMPUTING, SNOBOL \\ K.2 Computing Milieux, HISTORY OF
                 COMPUTING, Software",
}

@Article{Falkoff:1981:EA,
  author =       "A. D. Falkoff and K. E. Iverson",
  title =        "The evolution of {APL}",
  journal =      j-SIGPLAN,
  volume =       "18",
  number =       "6",
  pages =        "661--691",
  month =        jun,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Mon Aug 22 14:20:59 1994",
  acknowledgement = ack-nhfb,
  keywords =     "languages",
  review =       "ACM CR 39168",
  subject =      "K.2 Computing Milieux, HISTORY OF COMPUTING, APL \\
                 K.2 Computing Milieux, HISTORY OF COMPUTING, Software",
}

@Article{Wexelblat:1982:NBD,
  author =       "R. L. Wexelblat",
  title =        "New books: {December 1981}",
  journal =      j-SIGPLAN,
  volume =       "17",
  number =       "1",
  pages =        "4--8",
  month =        jan,
  year =         "1982",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:17:01 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
}

@Article{Goguen:1982:CMS,
  author =       "J. A. Goguen and J. Meseguer",
  title =        "Completeness of many-sorted equational logic",
  journal =      j-SIGPLAN,
  volume =       "17",
  number =       "1",
  pages =        "9--17",
  month =        jan,
  year =         "1982",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:17:01 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C6120 (File organisation)",
  corpsource =   "Computer Sci. Lab., SRI Internat., Menlo Park, CA,
                 USA",
  keywords =     "abstract data types; completeness theorem; computer
                 science; data structures; deduction; explicit
                 quantifiers; many-sorted equational logic; many-valued
                 logics",
  treatment =    "P Practical",
}

@Article{Booch:1982:NSC,
  author =       "Grady Booch",
  title =        "Naming subprograms with clarity",
  journal =      j-SIGPLAN,
  volume =       "17",
  number =       "1",
  pages =        "18--22",
  month =        jan,
  year =         "1982",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:17:01 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6110 (Systems analysis and programming); C6140D
                 (High level languages)",
  corpsource =   "Dept. of Computer Sci., USAF Acad., CO, USA",
  keywords =     "compilation time; FORTRAN; language construct; program
                 and system documentation; subprogram specification",
  treatment =    "P Practical",
}

@Article{Dixon:1982:PCT,
  author =       "Douglas F. Dixon",
  title =        "A {Pascal} compiler testing facility",
  journal =      j-SIGPLAN,
  volume =       "17",
  number =       "1",
  pages =        "23--26",
  month =        jan,
  year =         "1982",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:17:01 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6150C (Compilers, interpreters and other
                 processors); C6150G (Diagnostic, testing, debugging and
                 evaluating systems)",
  corpsource =   "RCA Lab., Princeton, NJ, USA",
  keywords =     "in-house compiler; PASCAL; Pascal; Pascal compiler
                 testing facility; production systems; program
                 compilers; program testing; test programs",
  treatment =    "P Practical",
}

@Article{Laski:1982:AGI,
  author =       "Janusz W. Laski",
  title =        "Application of the goal invariant to the structuring
                 of programs",
  journal =      j-SIGPLAN,
  volume =       "17",
  number =       "1",
  pages =        "27--36",
  month =        jan,
  year =         "1982",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:17:01 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6110 (Systems analysis and programming)",
  corpsource =   "School of Engng., Oakland Univ., Rochester, MI, USA",
  keywords =     "domain tuning; double exit loop; goal invariant; loop
                 nonrealizability; loop postludes; loop specification;
                 programs; range tuning; structured programming;
                 structured programs; structuring; termination
                 assertion; two-exit loop; while loop",
  treatment =    "P Practical",
}

@Article{Kilov:1982:GWP,
  author =       "Haim Kilov and S. Nudelman",
  title =        "Guidelines for writing {PL/I} programs",
  journal =      j-SIGPLAN,
  volume =       "17",
  number =       "1",
  pages =        "37--39",
  month =        jan,
  year =         "1982",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:17:01 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6110 (Systems analysis and programming); C6140D
                 (High level languages)",
  corpsource =   "Sperry Univac, Blue Bell, PA, USA",
  keywords =     "PL/1; PL/I; PL/I programs; programming; readable
                 programs",
  treatment =    "P Practical",
}

@Article{Bykat:1982:EPI,
  author =       "Alex Bykat",
  title =        "An extension to {PASCAL} input-output procedures",
  journal =      j-SIGPLAN,
  volume =       "17",
  number =       "1",
  pages =        "40--41",
  month =        jan,
  year =         "1982",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:17:01 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages); C6150J (Operating
                 systems)",
  corpsource =   "Dept. of Math., East Carolina Univ., Greenville, NC,
                 USA",
  keywords =     "compiler; input data; input-output programs; output
                 parameters; Pascal; PASCAL input-output procedures;
                 PASCAL READ; WRITE statement",
  treatment =    "P Practical",
}

@Article{Stroustrup:1982:CAD,
  author =       "Bjarne Stroustrup",
  title =        "Classes: an abstract data type facility for the {C}
                 language",
  journal =      j-SIGPLAN,
  volume =       "17",
  number =       "1",
  pages =        "42--51",
  month =        jan,
  year =         "1982",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:17:01 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6120 (File organisation); C6140D (High level
                 languages); C6150C (Compilers, interpreters and other
                 processors)",
  corpsource =   "Bell Labs., Murray Hill, NJ, USA",
  keywords =     "abstract data type; C class concept; C language; cc
                 compiler; class pre-processor; data structures; high
                 level languages; Motorola 68000; PDP11; portable C
                 compiler; program compilers; source file; UNIX; VAX",
  treatment =    "P Practical",
}

@Article{Anonymous:1982:NBa,
  author =       "Anonymous",
  title =        "New books",
  journal =      j-SIGPLAN,
  volume =       "17",
  number =       "1",
  pages =        "??--??",
  month =        jan,
  year =         "1982",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:17:01 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
}

@Article{Wexelblat:1982:NBF,
  author =       "R. L. Wexelblat",
  title =        "New books: {February 1981}",
  journal =      j-SIGPLAN,
  volume =       "17",
  number =       "2",
  pages =        "17--19",
  month =        feb,
  year =         "1982",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:17:01 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
}

@Article{Tai:1982:CPP,
  author =       "Kuo-Chung Tai",
  title =        "Comments on parameter passing techniques in
                 programming languages",
  journal =      j-SIGPLAN,
  volume =       "17",
  number =       "2",
  pages =        "24--27",
  month =        feb,
  year =         "1982",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:17:01 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6130 (Data handling techniques); C6140D (High level
                 languages)",
  corpsource =   "Dept. of Computer Sci., North Carolina State Univ.,
                 Raleigh, NC, USA",
  keywords =     "Ada; Ada reference manual; call-by-copy;
                 call-by-value-result parameter passing; data handling;
                 high level languages; parameter passing techniques;
                 programming languages",
  treatment =    "P Practical",
}

@Article{Jessop:1982:APD,
  author =       "Warren H. Jessop",
  title =        "{Ada} packages and distributed systems",
  journal =      j-SIGPLAN,
  volume =       "17",
  number =       "2",
  pages =        "28--36",
  month =        feb,
  year =         "1982",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:17:01 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6120 (File organisation); C6140D (High level
                 languages)",
  corpsource =   "Dept. of Computer Sci., Univ. of Washington, Seattle,
                 WA, USA",
  keywords =     "Ada; Ada packages; data structures; distributed
                 processing; distributed systems; package; package type;
                 task; virtual; virtual nodes",
  treatment =    "P Practical",
}

@Article{Topor:1982:NER,
  author =       "Rodney W. Topor",
  title =        "A note on error recovery in recursive descent
                 parsers",
  journal =      j-SIGPLAN,
  volume =       "17",
  number =       "2",
  pages =        "37--40",
  month =        feb,
  year =         "1982",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:17:01 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
}

@Article{Ford:1982:ORV,
  author =       "Gary Ford and Brian Hansche",
  title =        "Optional, repeatable, and varying type parameters",
  journal =      j-SIGPLAN,
  volume =       "17",
  number =       "2",
  pages =        "41--48",
  month =        feb,
  year =         "1982",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:17:01 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6120 (File organisation); C6130 (Data handling
                 techniques)",
  corpsource =   "Dept. of Computer Sci., Arizona State Univ., Tempe,
                 AZ, USA",
  keywords =     "ALGOL 68; Algol 68s union type; array-like structure;
                 data handling; data structures; PASCAL; Pascal-like
                 languages; passing parameters; programmer-defined
                 default value; type parameters; varying type
                 parameters",
  treatment =    "P Practical",
}

@Article{Roberts:1982:MBP,
  author =       "Tim N. Roberts",
  title =        "More on bit processing with {FORTRAN}",
  journal =      j-SIGPLAN,
  volume =       "17",
  number =       "2",
  pages =        "49--52",
  month =        feb,
  year =         "1982",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:17:01 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6130 (Data handling techniques); C6140D (High level
                 languages)",
  corpsource =   "Control Data Corp., Los Angeles, CA, USA",
  keywords =     "assembly language; bit processing; data handling;
                 FORTRAN; systems programmer",
  treatment =    "P Practical",
}

@Article{Johnson:1982:SDG,
  author =       "Mark Scott Johnson",
  title =        "A software debugging glossary",
  journal =      j-SIGPLAN,
  volume =       "17",
  number =       "2",
  pages =        "53--70",
  month =        feb,
  year =         "1982",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:17:01 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6150G (Diagnostic, testing, debugging and
                 evaluating systems)",
  corpsource =   "Hewlett-Packard Labs., Computer Res. Center, Palo
                 Alto, CA, USA",
  keywords =     "glossaries; program debugging; software debugging
                 glossary; software-engineering",
  treatment =    "B Bibliography",
}

@Article{Anonymous:1982:NBb,
  author =       "Anonymous",
  title =        "New books",
  journal =      j-SIGPLAN,
  volume =       "17",
  number =       "2",
  pages =        "??--??",
  month =        feb,
  year =         "1982",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:17:01 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
}

@Article{Magel:1982:TSP,
  author =       "Kenneth Magel",
  title =        "A theory of small program complexity",
  journal =      j-SIGPLAN,
  volume =       "17",
  number =       "3",
  pages =        "37--45",
  month =        mar,
  year =         "1982",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:17:02 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory)",
  corpsource =   "Univ. of Missouri, Rolla, MO, USA",
  keywords =     "computational complexity; interrelationships; mapping;
                 mapping systems; programming theory; small program
                 complexity; software systems",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Morrison:1982:SSD,
  author =       "Ronald Morrison",
  title =        "The string as a simple data type",
  journal =      j-SIGPLAN,
  volume =       "17",
  number =       "3",
  pages =        "46--52",
  month =        mar,
  year =         "1982",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:17:02 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6120 (File organisation)",
  corpsource =   "Dept. of Computational Sci., Univ. of St. Andrews, St.
                 Andrews, UK",
  keywords =     "data structures; simple data type; string; text
                 manipulation",
  treatment =    "P Practical",
}

@Article{Prael:1982:POS,
  author =       "C. E. Prael",
  title =        "{PASCAL} for operating software? {A} critical
                 examination",
  journal =      j-SIGPLAN,
  volume =       "17",
  number =       "3",
  pages =        "53--57",
  month =        mar,
  year =         "1982",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:17:02 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages); C6150J (Operating
                 systems)",
  keywords =     "operating software; operating systems (computers);
                 PASCAL; Pascal; utility program",
  treatment =    "G General Review",
}

@Article{Salt:1982:DSS,
  author =       "Norman F. Salt",
  title =        "Defining software science counting strategies",
  journal =      j-SIGPLAN,
  volume =       "17",
  number =       "3",
  pages =        "58--67",
  month =        mar,
  year =         "1982",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:17:02 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6110 (Systems analysis and programming)",
  corpsource =   "Dept. of Measurement, Evaluation and Computer
                 Applications, Ontario Inst. for Studies in Education,
                 Toronto, Ont., Canada",
  keywords =     "Halstead metrics; PASCAL; Pascal counting strategy;
                 Pascal counting strategy science counting strategies;
                 software engineering; software science counting
                 strategies",
  treatment =    "P Practical",
}

@Article{Scowen:1982:SSM,
  author =       "R. S. Scowen",
  title =        "A standard syntactic metalanguage",
  journal =      j-SIGPLAN,
  volume =       "17",
  number =       "3",
  pages =        "68--73",
  month =        mar,
  year =         "1982",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:17:02 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages)",
  corpsource =   "NPL, Teddington, UK",
  keywords =     "British Standard; high level languages; standards;
                 syntactic metalanguage",
  treatment =    "P Practical",
}

@Article{Scowen:1982:SSP,
  author =       "R. S. Scowen and Z. J. Ciechanowicz",
  title =        "Seven sorts of programs",
  journal =      j-SIGPLAN,
  volume =       "17",
  number =       "3",
  pages =        "74--79",
  month =        mar,
  year =         "1982",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:17:02 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6110 (Systems analysis and programming); C6150G
                 (Diagnostic, testing, debugging and evaluating
                 systems)",
  corpsource =   "NPL, Teddington, UK",
  keywords =     "ALGOL 60; Algol 60; computer scientists; correctness;
                 debugging programs; program testing",
  treatment =    "P Practical",
}

@Article{Spector:1982:MOG,
  author =       "David Spector",
  title =        "Minimal overhead garbage collection of complex list
                 structure",
  journal =      j-SIGPLAN,
  volume =       "17",
  number =       "3",
  pages =        "80--82",
  month =        mar,
  year =         "1982",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:17:02 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6150J (Operating systems)",
  corpsource =   "Prime Computer Inc., Framingham, MA, USA",
  keywords =     "complex list structure; garbage collection; list
                 cells; storage management",
  treatment =    "P Practical",
}

@Article{vandenBosch:1982:TPL,
  author =       "Peter van den Bosch",
  title =        "The translation of programming languages through the
                 use of a graph transformation language",
  journal =      j-SIGPLAN,
  volume =       "17",
  number =       "3",
  pages =        "83--92",
  month =        mar,
  year =         "1982",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:17:02 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6150C (Compilers, interpreters and other
                 processors)",
  corpsource =   "Dept. of Computer Sci., Univ. of British Columbia,
                 Vancouver, BC, Canada",
  keywords =     "abstract syntactic forms; abstract syntactic uniform
                 model; context dependent aspects; declaration; graph
                 transformation language; macro expansion; optimization;
                 program interpreters; program translation; programming
                 languages; structure editing; uniform model",
  treatment =    "P Practical",
}

@Article{vanderLinden:1982:AOA,
  author =       "Peter van der Linden",
  title =        "Ambiguity and orthogonality in {Ada}",
  journal =      j-SIGPLAN,
  volume =       "17",
  number =       "3",
  pages =        "93--94",
  month =        mar,
  year =         "1982",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:17:02 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages)",
  corpsource =   "Dept. of Computer Sci., Yale Univ., New Haven, CT,
                 USA",
  keywords =     "Ada; orthogonality; programming languages;
                 semantically different linguistic elements",
  treatment =    "P Practical",
}

@Article{Rattner:1982:HSC,
  author =       "Justin Rattner",
  title =        "Hardware\slash software cooperation in the {iAPX-32}",
  journal =      j-SIGPLAN,
  volume =       "17",
  number =       "4",
  pages =        "1--1",
  month =        apr,
  year =         "1982",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/964750.801819",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:15:07 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  abstract =     "The Intel iAPX-432 is an object-based microcomputer
                 system with a unified approach to the design and use of
                 its architecture, operating system, and primary
                 programming language. The concrete architecture of the
                 432 incorporates hardware support for data abstraction,
                 small protection domains, and language-oriented
                 run-time environments. It also uses its
                 object-orientation to provide hardware support for
                 dynamic heap storage management, interprocess
                 communication, and processor dispatching. We begin with
                 an overview of the 432 architecture so readers
                 unfamiliar with its basic concepts will be able to
                 follow the succeeding discussion without the need to
                 consult the references. Following that, we introduce
                 the various forms of hardware/software cooperation and
                 the criteria by which a function or service is selected
                 for migration. This is followed by several of the more
                 interesting examples of hardware/software cooperation
                 in the 432. A comparison of cooperation in the 432 with
                 several contemporary machines and discussions of
                 development issues, past and future, complete the
                 paper.",
  acknowledgement = ack-nhfb,
}

@Article{Hennessy:1982:HST,
  author =       "John Hennessy and Norman Jouppi and Forest Baskett and
                 Thomas Gross and John Gill",
  title =        "Hardware\slash software tradeoffs for increased
                 performance",
  journal =      j-SIGPLAN,
  volume =       "17",
  number =       "4",
  pages =        "2--11",
  month =        apr,
  year =         "1982",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/964750.801820",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:15:07 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  abstract =     "Most new computer architectures are concerned with
                 maximizing performance by providing suitable
                 instruction sets for compiled code and providing
                 support for systems functions. We argue that the most
                 effective design methodology must make simultaneous
                 tradeoffs across all three areas: hardware, software
                 support, and systems support. Recent trends lean
                 towards extensive hardware support for both the
                 compiler and operating systems software. However,
                 consideration of all possible design tradeoffs may
                 often lead to less hardware support. Several examples
                 of this approach are presented, including: omission of
                 condition codes, word-addressed machines, and imposing
                 pipeline interlocks in software. The specifics and
                 performance of these approaches are examined with
                 respect to the MIPS processor.",
  acknowledgement = ack-nhfb,
}

@Article{Rymarczyk:1982:CGP,
  author =       "James W. Rymarczyk",
  title =        "Coding guidelines for pipelined processors",
  journal =      j-SIGPLAN,
  volume =       "17",
  number =       "4",
  pages =        "12--19",
  month =        apr,
  year =         "1982",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/964750.801821",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:15:07 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  abstract =     "This paper is a tutorial for assembly language
                 programmers of pipelined processors. It describes the
                 general characteristics of pipelined processors and
                 presents a collection of coding guidelines for them.
                 These guidelines are particularly significant to
                 compiler developers who determine object code
                 patterns.",
  acknowledgement = ack-nhfb,
}

@Article{Johnsson:1982:OMP,
  author =       "Richard K. Johnsson and John D. Wick",
  title =        "An overview of the {Mesa} processor architecture",
  journal =      j-SIGPLAN,
  volume =       "17",
  number =       "4",
  pages =        "20--29",
  month =        apr,
  year =         "1982",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/964750.801822",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:15:07 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  abstract =     "This paper provides an overview of the architecture of
                 the Mesa processor, an architecture which was designed
                 to support the Mesa programming system [4]. Mesa is a
                 high level systems programming language and associated
                 tools designed to support the development of large
                 information processing applications (on the order of
                 one million source lines). Since the start of
                 development in 1971, the processor architecture, the
                 programming language, and the operating system have
                 been designed as a unit, so that proper tradeoffs among
                 these components could be made.",
  acknowledgement = ack-nhfb,
}

@Article{Berenbaum:1982:OSL,
  author =       "Alan D. Berenbaum and Michael W. Condry and Priscilla
                 M. Lu",
  title =        "The operating system and language support features of
                 the {BELLMACTM-32} microprocessor.",
  journal =      j-SIGPLAN,
  volume =       "17",
  number =       "4",
  pages =        "30--38",
  month =        apr,
  year =         "1982",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/964750.801823",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:15:07 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  abstract =     "The BELLMAC-32 microprocessor is a 32-bit
                 microprocessor, implemented with CMOS technology,
                 designed to support operating system functions and high
                 level languages efficiently. The architecture was
                 designed with the following objectives in mind:
                 {\bullet} High performance. {\bullet} Enhanced
                 operating system support capabilities. {\bullet} High
                 level language support. {\bullet} High reliability,
                 availability and maintainability.",
  acknowledgement = ack-nhfb,
}

@Article{Radin:1982:M,
  author =       "George Radin",
  title =        "The 801 minicomputer",
  journal =      j-SIGPLAN,
  volume =       "17",
  number =       "4",
  pages =        "39--47",
  month =        apr,
  year =         "1982",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/800050.801824",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:15:07 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  abstract =     "This paper provides an overview of an experimental
                 system developed at the IBM T. J. Watson Research
                 Center. It consists of a running hardware prototype, a
                 control program and an optimizing compiler. The basic
                 concepts underlying the system are discussed as are the
                 performance characteristics of the prototype. In
                 particular, three principles are examined: system
                 orientation towards the pervasive use of high level
                 language programming and a sophisticated compiler, a
                 primitive instruction set which can be completely
                 hard-wired, storage hierarchy and I/O organization to
                 enable the CPU to execute an instruction at almost
                 every cycle.",
  acknowledgement = ack-nhfb,
  remark =       "The IBM 801 was never marketed, but is now viewed,
                 along with machines from CDC and Cray, as ancestors of
                 modern RISC machines.",
}

@Article{Ditzel:1982:RAF,
  author =       "David R. Ditzel and H. R. McLellan",
  title =        "Register allocation for free: {The} {C} machine stack
                 cache",
  journal =      j-SIGPLAN,
  volume =       "17",
  number =       "4",
  pages =        "48--56",
  month =        apr,
  year =         "1982",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/800050.801825",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:15:07 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  abstract =     "The Bell Labs C Machine project is investigating
                 computer architectures to support the C programming
                 language. One of the goals is to match an efficient
                 architecture to the language and the compiler
                 technology available. Measurements of different C
                 programs show that roughly one out of every twenty
                 instructions executed is either a procedure call or
                 return. Procedure call overhead is therefore a very
                 important consideration in the overall machine design.
                 A second and related area of primary concern in overall
                 machine efficiency is the register allocation strategy.
                 While use of additional registers can offer
                 considerable improvement in execution times, adding
                 registers usually has the adverse effects of increasing
                 the procedure call overhead due to register saving and
                 creating an undue burden on the compiler. In this paper
                 we describe a piece of the C Machine architecture which
                 effectively eliminates the register allocation problem,
                 and improves procedure calling by drastically reducing
                 storage references required by traditional register
                 saving. The technique can be generalized for other
                 languages and architectures, though we will only
                 directly address those issues involving the C
                 language.",
  acknowledgement = ack-nhfb,
}

@Article{Harbison:1982:AAO,
  author =       "Samuel P. Harbison",
  title =        "An architectural alternative to optimizing compilers",
  journal =      j-SIGPLAN,
  volume =       "17",
  number =       "4",
  pages =        "57--65",
  month =        apr,
  year =         "1982",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/964750.801826",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:15:07 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  abstract =     "Programming languages are designed to make programming
                 productive. Computer architectures are designed to make
                 program execution efficient. Although architectures
                 should be designed with programming languages in mind,
                 it may be as inappropriate to make the computer execute
                 the programming language directly it is to make the
                 programmer use machine language. It is the compiler's
                 job to match the programming language and the computer
                 architectures, and therefore making compiler's
                 efficient and easy to write are important design goals
                 of a complete hardware/software system. This paper
                 summarizes research completed in 1980 [5] on a computer
                 architecture, TM, that takes over some of the more
                 burdensome tasks of optimizing compilers for
                 high-level-languages (HLL's), performing these tasks
                 dynamically during the execution of the object program.
                 This is a different approach to making compilers
                 efficient than is commonly taken; more common
                 approaches include devising more efficient optimization
                 algorithms[I], being clever about when to do
                 optimizations [4], and building the compilers
                 semiautomatically [6].",
  acknowledgement = ack-nhfb,
}

@Article{Lampson:1982:FPC,
  author =       "Butler W. Lampson",
  title =        "Fast procedure calls",
  journal =      j-SIGPLAN,
  volume =       "17",
  number =       "4",
  pages =        "66--76",
  month =        apr,
  year =         "1982",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/964750.801827",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:15:07 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  abstract =     "A mechanism for control transfers should handle a
                 variety of applications (e.g., procedure calls and
                 returns, coroutine transfers, exceptions, process
                 switches) in a uniform way. It should also allow an
                 implementation in which the common cases of procedure
                 call and return are extremely fast, preferably as fast
                 as unconditional jumps in the normal case. This paper
                 describes such a mechanism and methods for its
                 efficient implementation.",
  acknowledgement = ack-nhfb,
  keywords =     "Architecture; Call; Frame; Procedure; Registers;
                 Stack; Transfer",
}

@Article{Jones:1982:SPM,
  author =       "Douglas W. Jones",
  title =        "Systematic protection mechanism design",
  journal =      j-SIGPLAN,
  volume =       "17",
  number =       "4",
  pages =        "77--80",
  month =        apr,
  year =         "1982",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/960120.801828",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:15:07 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  abstract =     "This work describes an attempt to systematically
                 design a hardware resource protection mechanism when
                 given the requirements of a particular language as a
                 target. The design process is formalized as a
                 structured walk through the multidimensional computer
                 design space towards a hypothetical class of optimal
                 machines. Each step in this walk involves a change in
                 the distribution of work between the compiler and
                 run-time system but no change in the source language
                 semantics. The starting point for this walk is the
                 result of a semantic analysis of the language to be
                 implemented; typically, this produces a very high level
                 machine where the compiler, if any, is trivial. The
                 walk ends when no changes result in a net improvement.
                 This does not guarantee that the result is even locally
                 optimal, since the changes tried depend on the
                 ingenuity and persistence of the designer. This design
                 approach has been used to arrive at a practical,
                 general purpose protection mechanism oriented towards
                 the needs of the Ada language (preliminary version).
                 This architecture was evaluated by comparing it with
                 the PDP-11/45. For the purpose of this comparison, the
                 protection mechanism was incorporated into a partially
                 specified PDP-11 like instruction set. The number of
                 bits making up the processor state and the number of
                 operations involved in address computation were
                 evaluated. On this basis, the result appears to be
                 competitive and worth further investigation.",
  acknowledgement = ack-nhfb,
}

@Article{Reed:1982:GPM,
  author =       "Karl Reed",
  title =        "On a general property of memory mapping tables",
  journal =      j-SIGPLAN,
  volume =       "17",
  number =       "4",
  pages =        "81--86",
  month =        apr,
  year =         "1982",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/800050.801829",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:15:07 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  abstract =     "The paper shows that memory mapping tables can be used
                 to implement the display registers used in providing
                 architectural support for block-structured languages
                 such as Algol 60. This allows full lexical level
                 addressing to be implemented on so-called von-Neuman
                 machines. The problems of fragmentation of the paged
                 address space are explored, and machines with memory
                 mapping schemes capable of supporting the proposals
                 identified. Attention is drawn to the similarity
                 between segmented and paged schemes, and it is
                 suggested that the latter may be used to support the
                 former.",
  acknowledgement = ack-nhfb,
  keywords =     "Display; Memory mapping; Page tables; Segmentation;
                 Virtual memory",
}

@Article{Cook:1982:EIO,
  author =       "Robert P. Cook and Nitin Donde",
  title =        "An experiment to improve operand addressing",
  journal =      j-SIGPLAN,
  volume =       "17",
  number =       "4",
  pages =        "87--91",
  month =        apr,
  year =         "1982",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/800050.801830",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:15:07 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  abstract =     "MCODE is a high-level language, stack machine designed
                 to support strongly-typed, Pascal-based languages with
                 a variety of data types in a modular programming
                 environment. The instruction set, constructed for
                 efficiency and extensibility, is based on an analysis
                 of 120,000 lines of Pascal programs. The design was
                 compared for efficiency with the instruction sets of
                 the Digital Equipment PDP-11 and VAX by examining the
                 generated code from the same compiler for all three
                 machines. In addition, the original design choices were
                 tested by analyzing the generated code from 19,000
                 lines of StarMod programs. As a result of this
                 iterative experiment, we have summarized our
                 observations in an efficient reorganization of the
                 VAX's addressing modes.",
  acknowledgement = ack-nhfb,
  keywords =     "Addressing modes; Computer architecture; Stack
                 machine",
}

@Article{Fusaoka:1982:CCH,
  author =       "Akira Fusaoka and Masaharu Hirayama",
  title =        "Compiler chip: {A} hardware implementation of
                 compiler",
  journal =      j-SIGPLAN,
  volume =       "17",
  number =       "4",
  pages =        "92--95",
  month =        apr,
  year =         "1982",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/964750.801831",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:15:07 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  abstract =     "In this paper we discuss about another approach:
                 Compiler Chip, which is a VLSI implementation of a
                 compiler. Constructing a compiler by a few VLSI chip,
                 the computer manufacturer can deliver compilers by sets
                 of VLSI chips, and these chips are installed in a
                 intelligent terminal in order to remove the compilation
                 from the tasks which are processed in the mainframe.",
  acknowledgement = ack-nhfb,
}

@Article{Rau:1982:ASE,
  author =       "B. R. Rau and C. D. Glaeser and E. M. Greenawalt",
  title =        "Architectural support for the efficient generation of
                 code for horizontal architectures",
  journal =      j-SIGPLAN,
  volume =       "17",
  number =       "4",
  pages =        "96--99",
  month =        apr,
  year =         "1982",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/964750.801832",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:15:07 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  abstract =     "Horizontal architectures, such as the CDC Advanced
                 Flexible Processor [I] and the FPS APi20-B [2], consist
                 of a number of resources that can operate in parallel,
                 each of which is controlled by a field in the wide
                 instruction word. Such architectures have been
                 developed to perform high speed scientific computations
                 at a modest cost: Figure 1 displays those
                 characteristics of horizontal architectures that are
                 germane to the issues discussed in this paper. The
                 simultaneous requirements of high performance and low
                 cost lead to an architecture consisting of multiple
                 pipelined processing elements (PEs) such as adders and
                 multipliers, a memory (which for scheduling purposes
                 may be viewed as yet another PE with two operations: a
                 READ and a WRITE), and an interconnect which ties them
                 all together. The interconnect allows the result of one
                 operation to be directly routed to another PE as one of
                 the inputs for an operation that is to be performed
                 there. The required memory bandwidth is reduced since
                 temporary values need not be written to and read from
                 the memory. The final aspect of horizontal processors
                 that is of interest is that their program memories emit
                 wide instructions which synchronously specify the
                 actions of the multiple and possibly dissimilar PEs.
                 The program memory is sequenced by a conventional
                 sequencer that assumes sequential flow of control
                 unless a branch is explicitly specified. As a
                 consequence of the simplicity of such an architecture,
                 it is inexpensive relative to the potential performance
                 of the multiple pipelined PEs. However, if this
                 potential performance is to be realized, the multiple
                 resources of a horizontal processor must be scheduled
                 effectively. The scheduling task for conventional
                 horizontal processors is quite complex and the
                 construction of highly optimizing compilers for them is
                 a difficult and expensive project. The polycyclic
                 architecture [3- 6] is a horizontal architecture with
                 architectural support for the scheduling task. The
                 cause of the complexity involved in scheduling
                 conventional horizontal processors and the manner in
                 which the polycyclic architecture addresses this issue
                 are outlined in this paper.",
  acknowledgement = ack-nhfb,
}

@Article{SIGPLAN-280010015,
  author =       "R. E. McLear and D. M. Scheibelhut and E. Tammaru",
  title =        "Guidelines for creating a debuggable processor",
  journal =      j-SIGPLAN,
  volume =       "17",
  number =       "4",
  pages =        "100--106",
  month =        apr,
  year =         "1982",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/964750.801833",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:15:07 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  abstract =     "Hardware without software is of little use. Systems
                 that ease the task of debugging software reduce cost
                 and speed development. This paper presents guidelines
                 for designing processors that ease debugging for
                 real-time computer systems. Special hardware can aid
                 the debugging process by tracing execution and accesses
                 to memory. Such hardware requires access to signals
                 that may not be readily available. Other, less exotic
                 hardware provides an interface to the programmer and
                 other processors. The hardware and software of the
                 debugging system should not alter the real-time
                 characteristics of the system under test and should be
                 able to operate on a field-grade processor. It is
                 undesirable to require special versions of processor
                 hardware and software for the debugging system.",
  acknowledgement = ack-nhfb,
}

@Article{SIGPLAN-280010016,
  author =       "M. V. Wilkes",
  title =        "Hardware support for memory protection: {Capability}
                 implementations",
  journal =      j-SIGPLAN,
  volume =       "17",
  number =       "4",
  pages =        "107--116",
  month =        apr,
  year =         "1982",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/964750.801834",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:15:07 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  abstract =     "This paper is intended to stimulate discussion on the
                 present state of hardware supported capability systems.
                 Interest in such systems grew up in the mid-1960's and
                 since that time information has been published on
                 several different versions. In the opinion of some
                 observers, the software complexity of these systems
                 outweighs the advantage gained. The paper surveys the
                 situation, and endeavors to set out the general
                 features that a hardware supported capability system
                 should possess. An attempt is made to identify the
                 causes of the complexity and to make recommendations
                 for removing them. The arguments for and against the
                 tagging of capabilities are discussed and attention is
                 drawn to a system of semi-tagging previously proposed
                 by the author.",
  acknowledgement = ack-nhfb,
}

@Article{SIGPLAN-280010017,
  author =       "Fred J. Pollack and George W. Cox and Dan W.
                 Hammerstrom and Kevin C. Kahn and Konrad K. Lai and
                 Justin R. Rattner",
  title =        "Supporting {Ada} memory management in the {iAPX-432}",
  journal =      j-SIGPLAN,
  volume =       "17",
  number =       "4",
  pages =        "117--131",
  month =        apr,
  year =         "1982",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/964750.801835",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:15:07 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  abstract =     "In this paper, we describe how the memory management
                 mechanisms of the Intel iAPX-432 are used to implement
                 the visibility rules of Ada. At any point in the
                 execution of an Ada{\reg} program on the 432, the
                 program has a protected address space that corresponds
                 exactly to the program's accessibility at the
                 corresponding point in the program's source. This close
                 match of architecture and language did not occur
                 because the 432 was designed to execute Ada --- it was
                 not. Rather, both Ada and the 432 are the result of
                 very similar design goals. To illustrate this point, we
                 compare, in their support for Ada, the memory
                 management mechanisms of the 432 to those of
                 traditional computers. The most notable differences
                 occur in heap-space management and multitasking. With
                 respect to the former, we describe a degree of
                 hardware/software cooperation that is not typical of
                 other systems. In the latter area, we show how Ada's
                 view of sharing is the same as the 432, but differs
                 totally from the sharing permitted by traditional
                 systems. A description of these differences provide
                 some insight into the problems of implementing an Ada
                 compiler for a traditional architecture.",
  acknowledgement = ack-nhfb,
}

@Article{SIGPLAN-280010018,
  author =       "J. P. Sansonnet and M. Castan and C. Percebois and D.
                 Botella and J. Perez",
  title =        "Direct execution of {LISP} on a list-directed
                 architecture",
  journal =      j-SIGPLAN,
  volume =       "17",
  number =       "4",
  pages =        "132--139",
  month =        apr,
  year =         "1982",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/964750.801836",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:15:07 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  abstract =     "We have defined a direct-execution model dedicated to
                 non-numerical processing which is based upon an
                 internal representation of source programs derived from
                 LISP. This model provides good support for both
                 sophisticated editing (syntactical parsing, tree
                 manipulation, pretty-printing, ...) of conventional
                 languages and artificial intelligence languages. A high
                 level microprogramming language (LEM) was designed to
                 write the interpreters and the editors. A hardware
                 processor was built and a LISP interpreter,
                 microprogrammed in LEM, has been operational since
                 September 1980. First, the influence of LISP on the LEM
                 language and the architecture is discussed. At the LEM
                 level, we will see that LISP has prompted the control
                 constructs and the access functions to the
                 tree-structured internal form. As for the architecture,
                 we present the hardware implementation of a special
                 garbage collector based upon reference counters. In
                 turn, the machine has influenced the implementation of
                 LISP. We present here the structure of our LISP
                 interpreter and we give evaluation measures dealing
                 with size, development effort, speed; they prove that
                 programming in LEM is easy, short to debug and very
                 concise. Moreover, the speed of our LISP interpreter
                 confirms that the architecture is very efficient for
                 symbolic processing.",
  acknowledgement = ack-nhfb,
}

@Article{SIGPLAN-280010019,
  author =       "Mark Scott Johnson",
  title =        "Some requirements for architectural support of
                 software debugging",
  journal =      j-SIGPLAN,
  volume =       "17",
  number =       "4",
  pages =        "140--148",
  month =        apr,
  year =         "1982",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/964750.801837",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:15:07 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  abstract =     "Architectural support of high-level, symbolic
                 debugging is described at three levels of abstraction:
                 the user's view of desired debugging functionality, the
                 debugger implementor's view of architectural
                 requirements that support the functionality, and the
                 computer architect's view of architectural features or
                 attributes that implement the requirements. References
                 are made where possible to computing systems that meet
                 the requirements. The paper is written from the
                 viewpoint of debugger implementors, and is addressed
                 primarily to computer architects.",
  acknowledgement = ack-nhfb,
  keywords =     "Architectural debugging support; Breakpoints;
                 Debugging; Debugging-oriented architecture; Interactive
                 debugging; Profiles; Symbolic debugging; Traces",
}

@Article{SIGPLAN-280010020,
  author =       "C. A. Middelburg",
  title =        "The effect of the {PDP-11} architecture on code
                 generation for chill",
  journal =      j-SIGPLAN,
  volume =       "17",
  number =       "4",
  pages =        "149--157",
  month =        apr,
  year =         "1982",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/960120.801838",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:15:07 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  abstract =     "This paper outlines the implementation of the CCITT*)
                 high level programming language CHILL on PDP-11
                 computers in the CHILL compiler constructed at the Dr.
                 Neher Laboratories. The characteristics and structure
                 of the compiler are briefly described. The relationship
                 between the PDP-11 architecture and the implementation
                 of CHILL is outlined in more detail.",
  acknowledgement = ack-nhfb,
}

@Article{SIGPLAN-280010021,
  author =       "Richard E. Sweet and James G. {Sandman, Jr.}",
  title =        "Empirical analysis of the {Mesa} instruction set",
  journal =      j-SIGPLAN,
  volume =       "17",
  number =       "4",
  pages =        "158--166",
  month =        apr,
  year =         "1982",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/800050.801839",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:15:07 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  abstract =     "This paper describes recent work to refine the
                 instruction set of the Mesa processor. Mesa [8] is a
                 high level systems implementation language developed at
                 Xerox PARC during the middle 1970's. Typical systems
                 written in Mesa are large collections of programs
                 running on single-user machines. For this reason, a
                 major design goal of the project has been to generate
                 compact object programs. The computers that execute
                 Mesa programs are implementations of a stack
                 architecture [5]. The instructions of an object program
                 are organized into a stream of eight bit bytes. The
                 exact complement into of instructions in the
                 architecture has changed as the language and machine
                 micro architecture have evolved. In Sections 3 and 4,
                 we give a short history of the Mesa instruction set and
                 discuss the motivation for our most recent analysis of
                 it. In Section 5, we discuss the tools and techniques
                 used in this analysis. Section 6 shows the results of
                 this analysis as applied to a large sample of
                 approximately 2.5 million instruction bytes. Sections 7
                 and 8 give advice to others who might be contemplating
                 similar analyses.",
  acknowledgement = ack-nhfb,
}

@Article{SIGPLAN-280010022,
  author =       "Gene McDaniel",
  title =        "An analysis of a {Mesa} instruction set using dynamic
                 instruction frequencies",
  journal =      j-SIGPLAN,
  volume =       "17",
  number =       "4",
  pages =        "167--176",
  month =        apr,
  year =         "1982",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/964750.801840",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:15:07 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  abstract =     "The Mesa architecture is implemented on a variety of
                 processors, and dynamic instruction frequency data for
                 two programs is used to analyze the architecture in an
                 implementation independent fashion. The Mesa compiler
                 allocates variables in an order based upon their static
                 frequency of use, and measurements are provided that
                 show that these static predictions predict run time
                 usage as well. We provide an evaluation of the
                 advantages and costs of Mesa's compact byte encoding,
                 its reliance upon an evaluation stack, and its use of
                 memory. The Mesa language has evolved over time in a
                 hardware environment oriented around 16-bit quantities
                 with growing use of and accommodations to 32-bit
                 quantities. The cost of emulating 32-bit data paths on
                 a 16-bit machine is identified for a program that
                 heavily exploits longer values. Several potential areas
                 for improving the execution speed of a Mesa processor
                 with special purpose hardware are identified.",
  acknowledgement = ack-nhfb,
}

@Article{SIGPLAN-280010023,
  author =       "Cheryl A. Wiecek",
  title =        "A case study of {VAX-11} instruction set usage for
                 compiler execution",
  journal =      j-SIGPLAN,
  volume =       "17",
  number =       "4",
  pages =        "177--184",
  month =        apr,
  year =         "1982",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/964750.801841",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:15:07 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  abstract =     "Analysis of an instruction set as large and varied as
                 the one specified for the VAX-11 architecture is
                 important for aiding processor design evaluation. This
                 paper looks at dynamic VAX-11 instruction set usage by
                 one class of programs, and discusses the methodology
                 and tools which have been developed to provide that
                 information. Six VAX/VMS native mode compilers from
                 Digital Equipment Corporation were used: BASIC, BLISS,
                 COBOL, FORTRAN, PASCAL, and PL/I. A summary of results
                 generated by analyzing executions of these six
                 compilers is presented. Information is included for
                 instruction and class frequency, general instruction
                 features, operand specifiers, the memory data stream,
                 register utilization, instruction sequencing, and
                 branch displacements.",
  acknowledgement = ack-nhfb,
}

@Article{SIGPLAN-280010024,
  author =       "Mamoru Maekawa and Ken Sakamura and Chiaki Ishikawa",
  title =        "Firmware structure and architectural support for
                 monitors, vertical migration and user
                 microprogramming",
  journal =      j-SIGPLAN,
  volume =       "17",
  number =       "4",
  pages =        "185--194",
  month =        apr,
  year =         "1982",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/964750.801842",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:15:07 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  abstract =     "This paper describes firmware and hardware support
                 necessary for constructing easy-to-understand and high
                 performance operating systems including language
                 translators and interpreters. Basic principles are
                 one-to-one correspondence between logical hierarchy and
                 physical hierarchy, and vertical migration.
                 Implementation of monitors in firmware and
                 architectural support for it are discussed, and a
                 sample system is shown. Architectural support for user
                 microprogramming is then discussed and an example is
                 shown. After a total system firmware structure is
                 discussed, an experiment of vertical migration is
                 described. It is shown that a proper selection of
                 modules for migration is extremely important. It is
                 suggested that the direction shown in this paper is one
                 of future directions of computer systems.",
  acknowledgement = ack-nhfb,
}

@Article{SIGPLAN-280010025,
  author =       "N. Kamibayashi and H. Ogawana and K. Nagayama and H.
                 Aiso",
  title =        "{Heart}: {An} operating system nucleus machine
                 implemented by firmware",
  journal =      j-SIGPLAN,
  volume =       "17",
  number =       "4",
  pages =        "195--204",
  month =        apr,
  year =         "1982",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/800050.801843",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:15:07 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  abstract =     "This paper discusses the role of microprogramming in
                 operating system design and shows several things: (1)
                 advantages of the efficiency which may be gained from
                 microcoded operating system primitives, (2) selecting
                 the most appropriate primitives for implementation, and
                 (3) an analysis of the tradeoffs among software,
                 firmware, and hardware. The authors propose a practical
                 approach of enhancing computer architecture level, from
                 a view point of functional hierarchy of operating
                 systems. In order to prove the advantages of this
                 approach, we have designed and implemented an
                 experimental abstract machine for an operating system
                 nucleus. This research is an experimental design, and
                 evaluation on its operating system nucleus
                 machine,called HEART. HEART is a set of primitive and
                 universal functions, and works as a nucleus of a
                 multiprogrammed operating system. The research results
                 of our approach are the followings: First, to clarify
                 the properties of operating system nucleus, taking
                 functional hierarchy of operating system into
                 consideration. Second, to show the design of operating
                 system nucleus based on novel concepts. Third, to
                 confirm the possibility of implementing operating
                 system nucleus machine. Finally, we give a performance
                 evaluation on microcoded HEART and the effectiveness of
                 enhancing computer architecture level based on the
                 properties of operating systems.",
  acknowledgement = ack-nhfb,
}

%%% -*-BibTeX-*-

@Article{SIGPLAN-280010026,
  author =       "Sudhir R. Ahuja and Abhaya Asthana",
  title =        "A multi-microprocessor architecture with hardware
                 support for communication and scheduling",
  journal =      j-SIGPLAN,
  volume =       "17",
  number =       "4",
  pages =        "205--209",
  month =        apr,
  year =         "1982",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/960120.801844",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:15:07 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  abstract =     "We describe a multiprocessor system that attempts to
                 enhance the system performance by incorporating into
                 its architecture a number of key operating system
                 concepts. In particular: --- the scheduling and
                 synchronization of concurrent activities are built in
                 at the hardware level, --- the interprocess
                 communication functions are performed in hardware, and,
                 --- a coupling between the scheduling and communication
                 functions is provided which allows efficient
                 implementation of parallel systems that is precluded
                 when the scheduling and communication functions are
                 realized in software.",
  acknowledgement = ack-nhfb,
}

@Article{Dijkstra:1982:HDW,
  author =       "Edsger W. Dijkstra",
  title =        "How do we tell truths that might hurt?",
  journal =      j-SIGPLAN,
  volume =       "17",
  number =       "5",
  pages =        "13--15",
  month =        may,
  year =         "1982",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:17:03 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6110 (Systems analysis and programming)",
  keywords =     "computing science; intellectual integrity;
                 programming; truths",
  treatment =    "G General Review",
}

@Article{Barach:1982:TFSa,
  author =       "David R. Barach and David H. Taenzer and Robert E.
                 Wells",
  title =        "A technique for finding storage allocation errors in
                 {C}-language problems",
  journal =      j-SIGPLAN,
  volume =       "17",
  number =       "5",
  pages =        "16--23",
  month =        may,
  year =         "1982",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:17:03 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C6110 (Systems analysis and programming); C6140D
                 (High level languages); C6150J (Operating systems)",
  corpsource =   "Interactive Systems Inc., Estes Park, CO, USA",
  keywords =     "C-language; error detection; errors; high level
                 languages; long-running programs; problems; standard
                 memory allocator; storage allocation; text editors;
                 traced replacement",
  treatment =    "P Practical",
}

@Article{Ancona:1982:BCL,
  author =       "M. Ancona and G. Dodero and V. Gianuzzi",
  title =        "Building collections of {LR(k)} items with partial
                 expansion of lookahead strings",
  journal =      j-SIGPLAN,
  volume =       "17",
  number =       "5",
  pages =        "25--28",
  month =        may,
  year =         "1982",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340",
  bibdate =      "Tue Oct 28 16:17:03 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4240 (Programming and
                 algorithm theory)",
  corpsource =   "Math. Inst., Univ. of Genova, Genova, Italy",
  keywords =     "computational complexity; context strings; grammars;