SIGPLAN Notices, Volume 23

Volume 23, Number 1, January 1988

• Peter Wegner:
  Workshop on object-oriented programming ECOOP 1987, Paris, June 18, 1987. 16-37
  
• Victor B. Schneider:
  A reply to "A note on metrics of Pascal programs". 38-39
  
• Victor B. Schneider:
  Approximations for the Halstead software science software error rate and project effort estimators. 40-47
  
• P. Fairfield, Michael A. Hennell:
  Data flow analysis of recursive procedures. 48-57
  
• Alan Burns, Gordon Davies:
  Pascal-FC: a language for teaching concurrent programming. 58-66
  
• Fer-Jan de Vries:
  A functional program for the fast Fourier transform. 67-74
  
• Mike Joy, Tom Axford:
  A standard for a graph representation for functional programs. 75-82
  
• Shan-Jon Chao, Barrett R. Bryant:
  Denotational semantics for program analysis. 83-91
  
• Jayaram Bhasker:
  Implementation of an optimizing compiler for VHDL. 92-108
  
• Bruce J. MacLennan:
  Four relational programs. 109-119
  
• Eric van Gestel, Ivo van Horebeek:
  Remarks on many-sorted equational logic with respect to algebraic implementations. 120-126
  
• Hal Berghel, Richard Rankin, Sanjiv K. Bhatia:
  MS-DOS Prolog implementations revisited. 127-134
  
• Keith H. Bierman:
  A proposal for improving optimizer quality via dynamic analysis. 135-136
  
• Stephen G. Perelgut, James R. Cordy:
  Turing Plus: a comparison with C and Pascal. 137-143
  

Volume 23, Number 2, February 1988

• Howard Trickey:
  C++ versus LISP: a case study. 9-18
  
• Peter Sestoft, Harald Søndergaard:
  A bibliography on partial evaluation. 19-26
  
• P. F. Sorensen:
  In search of program complexity. 28-35
  
• Graham M. Birtwistle, Kenneth D. Loose:
  A model for procedures passed as parameters. 36-43
  
• Carl Ponder:
  Benchmark semantics. 44-48
  

Volume 23, Number 3, March 1988

• David Hemmendinger:
  Unfair process scheduling in Modula-2. 7-12
  
• Frank W. Calliss:
  Problems with automatic restructurers. 13-21
  
• Max J. Egenhofer, Andrew U. Frank:
  A precompiler for modular, transportable Pascal. 22-32
  
• Dashing Yeh, Uwe Kastens:
  Automatic construction of incremental LR(1)-parsers. 33-42
  
• Antonio L. Furtado:
  Towards functional programming in Prolog. 43-52
  
• Neelam Soundararajan, Roger L. Costello:
  Responsive sequential processes. 53-62
  
• Melvin Klerer, Hong Liu:
  A new benchmark test to estimate optimization quality of compilers. 63-72
  
• Joseph Bergin, Stuart Greenfield:
  What does Modular-2 need to fully support object oriented programming? 73-82
  
• Niklas Holsti:
  Using formal procedure parameters to represent and transmit complex data structures. 83-92
  
• P. David Coward:
  Determining path feasibility for commercial programs. 93-101
  
• Gerald Q. Maguire Jr., Jonathan M. Smith:
  Process migration: effects on scientific computation. 102-106
  
• Phillippe Ranger:
  Some comments on the forthcoming "extended Pascal" standard. 107-110
  

Volume 23, Number 4, April 1988

• Mark Molloy:
  Comment on dpANS X3.160-198x, extended Pascal concerning the initial value clause. 22-26
  
• Ronald Morrison, Malcolm P. Atkinson, Alfred L. Brown, Alan Dearle:
  Bindings persistent programming languages. 27-34
  
• Keith D. Cooper, Ken Kennedy:
  Efficient computation of flow-insensitive interprocedural summary information - a correction. 35-42
  
• Alistair D. N. Edwards:
  Visual programming languages: the next generation. 43-50
  
• Neil W. Rickert:
  The role of the language standards committee. 51-55
  
• M. A. Bhatti:
  Incremental execution environment. 56-64
  
• S. Mansoor Sarwar, S. J. Hahn, James A. Davis:
  Implementing functional languages on a combinator-based reduction machine. 65-70
  
• Chang Li:
  Concurrent programming language - LISPTALK. 71-80
  
• David Hemmendinger:
  The "Hamming problem" in Prolog. 81-86
  
• Giuseppe Cattaneo, Vincenzo Loia:
  A common-LISP implementation of an extended Prolog system. 87-102
  
• Robert B. Terwilliger:
  Please: a language combining imperative and logic programming. 103-110
  

Volume 23, Number 5, May 1988

Volume 23, Number 6, June 1988

• Paul E. Cohen:
  An abundance of registers. 24-34
  
• Victor B. Schneider:
  A pedagogic expert system shell in Prolog. 35-38
  
• Irving B. Elliott:
  The PRESTO system. 39-48
  
• Philip J. Beaudet, Michael A. Jenkins:
  Simulating the object-oriented paradigm to Nial. 49-58
  
• Hermann Kaindl:
  Portability of software. 59-68
  
• N. Anand:
  Clarify function]. 69-79
  
• George H. Roberts:
  OPG: an optimizing parser generator. 80-90
  
• Kasper Østerbye:
  Abstract data types with shared operations. 91-96
  
• Joseph C. H. Park:
  y+: A yacc preprocessor for certain semantic actions. 97-106
  
• Paul Philbrow, I. Armour, Malcolm P. Atkinson, J. Livingstone:
  PS-Algol's device-independent output statement. 107-114
  
• David Hemmendinger:
  The `Hamming' in Prolog. 115-120
  
• Peter Kokol:
  Spreadsheet language level: how high is it? 121-134
  
• Carl Ponder, Patrick C. McGeer, Anthony P.-C. Ng:
  Are applicative languages inefficient? 135-139
  
• Barry Dwyer:
  Regular right part programming languages. 140-144
  
• Scott N. Gerard:
  Adding an authorization dimension to strong type checking. 145-151
  
• Barton P. Miller:
  The frequency of dynamic pointer references in "C" programs. 152-156
  
• Carl Ponder:
  Benchmark semantics. 157-161
  

Volume 23, Number 7, July 1988

Volume 23, Number 8, August 1988

• Douglas W. Jones:
  How (not) to code a finite state machine. 19-22
  
• George H. Roberts:
  Recursive ascent: an LR analog to recursive descent. 23-29
  
• Simon L. Peyton Jones:
  FLIC - a functional language intermediate code. 30-48
  
• Reinhold Weicker:
  Dhrystone benchmark: rationale for version 2 and measurement rules. 49-62
  
• Linda Rising:
  Tasking troubles and tips. 63-72
  
• Jukka Paakki:
  A note on the speed of Prolog. 73-82
  
• Gerd Bohlender, Christian P. Ullrich, Jürgen Wolff von Gudenberg:
  New developments in Pascal-SC. 83-92
  
• Eric B. Levy:
  The linked class of Modula-3. 93-102
  
• Michael Share:
  Resolving ambiguities in the parsing of translation grammars. 103-109
  

Volume 23, Number 9, September 1988

Volume 23, Special Issue, September 1988

• Daniel G. Bobrow, Linda G. DeMichiel, Richard P. Gabriel, Sonya E. Keene, Gregor Kiczales, David A. Moon:
  Common Lisp Object System Specification X2JI3 Document 88-002R. 1.1-2.94
  

Volume 23, Number 10, October 1988

• Alan Burns, Gordon Davies, Andy J. Wellings:
  A Modula-2 implementation of a real-time process abstraction. 49-58
  
• Michael J. Kaelbling:
  Programming languages should NOT have comment statements. 59-60
  
• Paul W. Abrahams:
  Some sad remarks about string handling in C. 61-68
  
• Jean E. Sammet:
  Notes on what language maturity means, and how to measure it. 69-71
  
• Hong Liu, Melvin Klerer:
  Timing results of various compilers using an optimization quality benchmark. 72-74
  
• Melvin Klerer, Hong Liu:
  Benchmark test to estimate optimization quality of compilers. 75-84
  
• David W. Sandberg:
  Smalltalk and exploratory programming. 85-92
  
• Peter Schnorf:
  Dynamic instantiation and configuration of functionally extended, efficient lexical analysers. 93-102
  
• C. Genillard, Alfred Strohmeier:
  GRAMOL. 103-122
  
• Jay W. Warfield, Henry R. Bauer III:
  An expert system for a retargetable peephole optimizer. 123-130
  
• John S. Yates, Robert A. Schwartz:
  Dynamic programming and industrial-strength instruction selection: code generation by tiring, but not exhaustive, search. 131-140
  
• Charles B. Weinstock, William A. Wulf:
  An efficient algorithm for heap storage allocation. 141-148
  
• Peter F. Lemkin:
  PSAIL: A portable SAIL to C compiler - description and tutorial. 149-171
  
• Dhananjay M. Dhamdhere:
  A fast algorithm for code movement optimisation. 172-180
  
• Fred Mellender:
  An integration of logic and object-oriented programming. 181-185
  
• Joseph E. Lang:
  Grammars for FFP. 186-190
  

Volume 23, Number 11, November 1988

Volume 23, Number 12, December 1988

• Antonio Corradi, Letizia Leonardi:
  The role of opaque types to build abstractions. 24-37
  
• Markku Sakkinen:
  Comments on "the law of demeter" and C++. 38-44
  
• Dashing Yeh, Uwe Kastens:
  Improvements of an incremental evaluation algorithm for ordered attribute grammars. 45-50
  
• Nikola B. Serbedzija:
  Asynchronous communication on Occam. 51-62
  
• Timothy A. Budd:
  Time space tradeoffs in vector algorithms for APL functions. 63-68
  
• Paul W. Oman, Curtis R. Cook:
  A paradigm for programming style research. 69-78
  
• Christian Neusius:
  Portable software in modular Pascal. 79-85
  
• Antonio L. Furtado, Paulo A. S. Veloso:
  Iteration for applicative languages. 86-94
  
• D. A. Sewry:
  Process scheduling in Modula-2. 95-97
  
• Paul R. Wilson:
  Opportunistic garbage collection. 98-102
  
• Ronald T. House:
  A problem with extended Pascal. 103-114
  
• David E. Boddy:
  SOS: a monitor-based operating system for instruction. 115-124
  
• Daniel Sharpe:
  Adding regular expressions to Pascal. 125-133
  
• Brian L. Meek:
  Language standards committees and revisions. 134-142
  
• David Spector:
  Efficient full LR(I) parser generation. 143-150
  
• Thomas A. Kovats:
  Comments on innovative control constructs in pancode and EPN. 151-157
  

Last update Mon May 20 03:19:18 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page