Science of Computer Programming, Volume 8

Volume 8, Number 1, February 1987

• Paul Chisholm:
  Derivation of a Parsing Algorithm in Martin-Löf's Theory of Types. 1-42
  
• Mathai Joseph, Abha Moitra, Neelam Soundararajan:
  Proof Rules for Fault Tolerant Distributed Programs. 43-67
  
• Claude Kirchner, Hélène Kirchner:
  REVEUR-3: The Implementation of a General Completion Procedure Parameterized by Built-in Theories and Strategies. 69-86
  
• Stefan Kölbl, Mitchell Wand:
  Linear Future Semantics and Its Implementation. 87-103
  
• Martin Rem:
  Small Programming Exercises 15. 105-112
  

Volume 8, Number 2, April 1987

• Richard S. Bird:
  A Formal Development of an Efficient Subercombinator Compiler. 113-137
  
• David Gries, Jan Prins:
  McLaren's Masterpiece. 139-145
  
• Luca Cardelli:
  Basic Polymorphic Typechecking. 147-172
  
• Guy Cousineau, Pierre-Louis Curien, Michel Mauny:
  The Categorical Abstract Machine. 173-202
  
• Martin Rem:
  Small Programming Exercises 16. 203-211
  

Volume 8, Number 3, June 1987

• Douglas R. Smith:
  Applications of a Strategy for Designing Divide-and-Conquer Algorithms. 213-229
  
• David Harel:
  Statecharts: A Visual Formalism for Complex Systems. 231-274
  
• E. Allen Emerson, Chin-Laung Lei:
  Modalities for Model Checking: Branching Time Logic Strikes Back. 275-306
  
• Martin Rem:
  Small Programming Exercises 17. 307-313
  

Last update Fri May 17 20:44:48 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page