Science of Computer Programming, Volume 3

Volume 3, Number 1, April 1983

• Helmuth Partsch: An Exercise in the Transformational Derivation of an Efficient Program by Joing Development of Control and Data Structure. 1-35 BibTeX
• Paul Pritchard: A Case Study of Number-Theoretic Computation: Searching for Primes in Arithmetical Progression. 37-63 BibTeX
• Krzysztof R. Apt, Ernst-Rüdiger Olderog: Proof Rules and Transformations Dealing with Fairness. 65-100 BibTeX
• Nissim Francez: Extended Naming Conventions for Communicating Processes. 101-114 BibTeX

Volume 3, Number 2, August 1983

• Lawrence C. Paulson: A Higher-Order Implementation of Rewriting. 119-149 BibTeX
• Gilles Kahn, Bernard Lang, Bertrand Melese, Elham Morcos: Metal: A Formalism to Specify Formalisms. 151-188 BibTeX
• Trevor I. Dix: Exceptions and Interrupts in CSP. 189-204 BibTeX
• Jyrki Katajainen, Olli Nevalainen: An Alternative for the Implementation of Kruskal's Minimal Spanning Tree Algorithm. 205-216 BibTeX
• Martin Rem: Small Programming Exercises 1. 217-222 BibTeX

Volume 3, Number 3, December 1983

• Harald Ganzinger: Increasing Modularity and Language-Independency in Automatically Generated Compilers. 223-278 BibTeX
• Roberto Barbuti, Alberto Martelli: A Structured Approach to Static Semantics Correctness. 279-311 BibTeX
• Martin Rem: Small Programming Exercises 2. 313-319 BibTeX