default search action

• combined dblp search
• author search
• venue search
• publication search

Authors:

• no matches

• 

Venues:

• no matches

• 

Publications:

• no matches

• 

ask others

• Google
• Google Scholar
• Semantic Scholar
• Internet Archive Scholar
• CiteSeerX
• ORCID

Refine list

refinements active!

zoomed in on ?? of ?? records

dismiss all constraints

view refined list in

dblp search

export refined list as

XML

JSON

JSONP

BibTeX

showing all ?? records

• 
  John C. Reynolds:
  Reasoning about arrays. 23
• 
  John Beidler, John G. Meinke:
  An intermediate level dynamic storage capability. 24-33
• 
  Richard J. Cichelli:
  Pascal-I: interactive, conversational Pascal-S. 34-44
• 
  Karel Culík:
  What is a flowchart loop and about structured programming. 45-57
• 
  John D. Gannon, Paul R. McMullin, Richard G. Hamlet, Mark A. Ardis:
  Testing traversable stacks. 58-65
• 
  Douglas R. Kaye:
  Interactive Pascal input. 66-68
• 
  William P. LaPlant, Matthew A. Jaro:
  The UNIMAC lexical analyzer. 69-76
• 
  Janusz W. Laski:
  A hierarchical approach to program testing. 77-85
• 
  Christopher D. S. Moss:
  Structured programming with loop statements. 86-94
• 
  Roger Schoenberger:
  Resource management in PORTAL. 95-102
• 
  Stephen A. Sutton:
  An algorithm for user interaction. 103-104
• 
  Richard N. Taylor:
  Assertions in programming languages. 105-114
• 
  Barry K. Rosen:
  How practical is POPL? 115-116
• 
  Roger M. Firestone:
  An experimental LISP system for the SPERRY UNIVAC 1100 Series. 117-129
• 
  Michael A. Mayor:
  A language for network analysis and definition. 130-138
• 
  F. P. Mehrlich, S. M. Tanner:
  Portability: high level language implementation. 139-145
• 
  Frank W. Stodola:
  The PLUS programming language. 146-155
• 
  Thomas G. Weidner:
  CHAMIL: a case study in microprogramming language design. 156-166

• 
  Henry G. Baker:
  A source of redundant identifiers in PASCAL programs. 14-16
• 
  Raymond T. Boute:
  Simplifying ADA by removing limitations. 17-29
• 
  Harald Ganzinger, Knut Ripken:
  Operator identification in ADA: formal specification, complexity, and concrete implementation. 30-42
• 
  Darrel C. Ince:
  An interpretative implementation of limited entry decision tables in Algol 68. 43-45
• 
  Jaroslav Král:
  Parkinson programming. 46-50
• 
  Godfrey Lee, Tim Boreham, Bob Minns, Fred Smith, Rick Soderstrom:
  FORTRAN programming standards. 51-63
• 
  Avi Silberschatz, Richard B. Kieburtz:
  The external consistency of abstract data types. 64-73
• 
  Manfred Weber, Susan L. Bernstein:
  Global register allocation for non-equivalent register sets. 74-81
• 
  Linda Zucconi:
  A comment on "Control flow complexity and structuredness of programs" by Srinivasan and Gopalakrishna. 82-84

• 
  Bruce Anderson:
  Type syntax in the language "C": an object lesson in syntactic innovation. 21-27
• 
  Herbert Klaeren:
  An abstract software specification technique based on structural recursion. 28-34
• 
  Mary Shaw, William A. Wulf:
  Toward relaxing assumptions in languages and their implementations. 45-61

• 
  A. M. Addyman:
  A draft proposal for PASCAL. 1-66
• 
  A. M. Addyman:
  PASCAL standardisation. 67-69
• 
  Norman H. Cohen:
  Gödel numbers: a new approach to structured programming. 70-74
• 
  David Harel:
  "do considered od" considered odder than "do considered ob". 75
• 
  Brian A. Hetrick, H. Eisenberg:
  Confinement of a class of harmful effects of the goto statement. 76-78
• 
  R. Schild, H. Lienhard:
  Real-time programming in PORTAL. 79-92

• 
  Richard J. Cichelli:
  Fixing PASCAL'S I/O. 19
• 
  Charles Crowley:
  Structured programming is reductionistic! 20-23
• 
  John R. Ellis:
  A Lisp shell. 24-34
• 
  Douglas W. Jones:
  Tasking and parameters: a problem area in Ada. 37-40
• 
  Dennis W. Leinbaugh:
  Indenting for the compiler. 41-48
• 
  John R. Levine:
  Why a Lisp-based command language? 49-53
• 
  Sten Ljungkvist:
  Pascal and existing Fortran files. 54-55
• 
  Terje Noodt, Dag Belsnes:
  A simple extension of Pascal for quasi-parallel processing. 56-65
• 
  John Van Zandt:
  On visual and textual structures. 78-80

• 
  Jan Theodore Galkowski:
  A critique of the DOD common language effort. 15-18
• 
  David W. E. Blatt:
  On the great big substitution problem. 19-27
• 
  Franklyn T. Bradshaw, George W. Ernst, Raymond J. Hookway, William F. Ogden:
  Procedure semantics and language definition. 28-33
• 
  Victor S. Foster:
  Performance measurement of a Pascal compiler. 34-38
• 
  Ahmed Mahjoub:
  A new modula compiler for the LSI-11. 39-45
• 
  Michael McNeil, William J. Tracz:
  PL/I program efficiency. 46-60
• 
  Brian L. Meek:
  Serial attitudes, parallel attitudes. 61-63
• 
  Abha Moitra:
  A note on algebraic specification of binary trees. 64-67
• 
  John Ker Reid:
  Functions for manipulating floating-point numbers. 68-76
• 
  Jan van den Bos:
  Comments on ADA process communication. 77-81

• 
  K. Mani Chandy, Jayadev Misra:
  A simple model of distributed programs based on implementation-hiding and process autonomy. 26-35
• 
  Frank DeRemer, Thomas J. Pennello, Richard Meyers:
  A syntax diagram for (preliminary) Ada. 36-47
• 
  Robert L. Glass:
  The "project which failed" which succeeded. 48-51
• 
  Darrel C. Ince:
  Paged input/output in some high level languages. 52-57
• 
  Manfred Jackel:
  A formatting parser for PASCAL programs. 58-63
• 
  Radu Nicolescu:
  Some short comments on the definition and the documentation of the ADA programming language. 64-71
• 
  Frank G. Pagan:
  Nested sublanguages of Algol 68 for teaching purposes. 72-81
• 
  Thomas J. Pennello, Frank DeRemer, Richard Meyers:
  A simplified operator identification scheme for Ada. 82-87
• 
  Robert K. Smart:
  Pointers to local variables. 88-89

• 
  Roy H. Campbell, Robert B. Kolstad:
  An overview of path Pascal's design. 13-14
• 
  Robert B. Kolstad, Roy H. Campbell:
  Path PASCAL user manual. 15-24
• 
  A. Chiarini:
  On FP languages combining forms. 25-27
• 
  W. Peter Dodd:
  Some comments on a recent article by Salvadori and Dumont regarding the evaluation of compound conditional expressions. 28-30
• 
  Syuetsu Hanata, Tadamasa Satoh:
  Compact chart: a program logic notation with high describability and understandability. 32-38
• 
  Jürgen M. Janas:
  A comment on "operator identification in ADA" by Ganzinger and Ripken. 39-42
• 
  John A. Sharp:
  Data oriented program design. 44-57
• 
  M. Nadir Yücel, Bogos Pinar:
  Bit processing with FORTRAN. 58-60
• 
  Tadao Takaoka:
  Introduction of history to variables. 61-63
• 
  Murat M. Tanik:
  Two experiments on a program complexity perception by programmers. 64-66

• 
  Edward A. Ashcroft, William W. Wadge:
  Some common misconceptions about Lucid. 15-26
• 
  Ronald F. Brender:
  The case against Ada as an APSE command language. 27-34
• 
  James F. Gimpel:
  Contour: a method of preparing structured flowcharts. 35-41
• 
  Marc A. Gobin:
  File handling in programming languages. 42-47
• 
  Henry F. Ledgard:
  A human engineered variant of BNF. 57-62
• 
  Kuo-Chung Tai, Kenneth P. Garrard:
  Comments on the suggested implementation of tasking facilities in the "rationale for the design of the ADA programming language". 76-84
• 
  Amiram Yehudai:
  Automatic indention versus program formatting. 85-87

Proceedings of the ACM-SIGPLAN symposium on the Ada programming language

• 
  Paul W. Abrahams:
  Proceedings of the ACM-SIGPLAN symposium on The ADA programming language, SIGPLAN 1980, Boston, Massachusetts, USA, December 9, 1980. ACM 1980, ISBN 978-0-89791-030-9 [contents]

• 
  L. Baxter:
  The versatility of PROLOG. 15-16
• 
  J. Craig Cleaveland:
  Mathematical specifications. 31-42
• 
  Leroy Johnson:
  do considered reflectively: a contribution to group programming. 43
• 
  Leroy Johnson:
  <u>do</u> considered <u>ob</u>viously <u>odd</u> in three dimensions. 44
• 
  Karl L. Pentzlin:
  A syntax for character and string constants supplying user-defined character codes. 45-52
• 
  Arthur Sale:
  Counterview in favour of strict type compatibility. 53-55
• 
  P. L. J. Siero:
  APL and Algo168, the correspondence and the differences, especially in applications of graph-analysis. 56-61
• 
  Jan Stroet:
  An alternative to the communication primitives in ADA. 62-74
• 
  Anthony G. Sumpter, Gerry E. Quick:
  Concurrency specification in high level languages. 75-81
• 
  Nora M. Taylor:
  Protection of proprietary software. 82-84
• 
  Jonathan S. Tutleman:
  "Handling large, complex and variable job-control streams using a procedure invocation package ('PIP') and a pseudo-library". 85-91
• 
  Neal R. Wagner:
  A Fortran preprocessor for the large program environment. 92-103

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.

Unpaywalled article links

Add open access links from to the list of external document links (if available).

load links from unpaywall.org

Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.

Archived links via Wayback Machine

For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).

load content from archive.org

Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.

Reference lists

Add a list of references from , , and to record detail pages.

load references from crossref.org and opencitations.net

Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.

Citation data

Add a list of citing articles from and to record detail pages.

load citations from opencitations.net

Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.

OpenAlex data

Load additional information about publications from .

load data from openalex.org

Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.

last updated on 2025-12-04 01:29 CET by the dblp team

 all metadata released as open data under CC0 1.0 license

see also: Terms of Use | Privacy Policy | Imprint

dblp was originally created in 1993 at:

 

since 2018, dblp has been operated and maintained by:

 

the dblp computer science bibliography is funded and supported by: