


default search action
Science of Computer Programming, Volume 9
Volume 9, Number 1, August 1987
- Yong-Qiang Sun, Ren-Ling Huang:

Deriving Some Expansion Theorems for Nonlinear Functional Equations by an Algorithm. 1-15 - Paul Pritchard:

Linear Prime-Number Sieves: A Family Tree. 17-35 - Zohar Manna, Richard J. Waldinger:

The Origin of a Binary-Search Paradigm. 37-83 - Anne Kaldewaij:

Some Algorithms Based on the Dual of Dilworth's Theorem. 85-89 - Martin Rem:

Small Programming Exercises 18. 91-100
Volume 9, Number 2, October 1987
- Hanne Riis Nielson

:
A Hoare-Like Proof System for Analysing the Computation Time of Programs. 107-136 - Ahlem Ben Cherifa, Pierre Lescanne:

Termination of Rewriting Systems by Polynomial Interpretations and Its Implementation. 137-159 - Fosca Giannotti, Attilio Matteucci, Dino Pedreschi

, Franco Turini:
Symbolic Evaluation with Structural Recursive Symbolic Constants. 161-177 - Henryk Jan Komorowski

, Jan Maluszynski:
Logic Programming and Rapid Prototyping. 179-205 - Martin Rem:

Small Programming Exercises 19. 207-211
Volume 9, Number 3, December 1987
- Edsger W. Dijkstra:

A Heuristic Explanation of Batcher's Baffler. 213-220 - Peter Pepper:

A Simple Calculus for Program Transformation (Inclusive of Induction). 221-262 - Maarten M. Fokkinga:

A Correctness Proof of Sorting by Means of Formal Procedures. 263-269 - Pierre Boullier, Martin Jourdan:

A New Error Repair and Recovery Scheme for Lexical and Syntactic Analysis. 271-286 - Joseph M. Morris:

A Theoretical Basis for Stepwise Refinement and the Programming Calculus. 287-306

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














