default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDScience 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 - Paul Pritchard:
A Case Study of Number-Theoretic Computation: Searching for Primes in Arithmetical Progression. 37-63 - Krzysztof R. Apt, Ernst-Rüdiger Olderog:
Proof Rules and Transformations Dealing with Fairness. 65-100 - Nissim Francez:
Extended Naming Conventions for Communicating Processes. 101-114
Volume 3, Number 2, August 1983
- Lawrence C. Paulson
:
A Higher-Order Implementation of Rewriting. 119-149 - Gilles Kahn, Bernard Lang, Bertrand Melese, Elham Morcos:
Metal: A Formalism to Specify Formalisms. 151-188 - Trevor I. Dix:
Exceptions and Interrupts in CSP. 189-204 - Jyrki Katajainen, Olli Nevalainen:
An Alternative for the Implementation of Kruskal's Minimal Spanning Tree Algorithm. 205-216 - Martin Rem:
Small Programming Exercises 1. 217-222
Volume 3, Number 3, December 1983
- Harald Ganzinger:
Increasing Modularity and Language-Independency in Automatically Generated Compilers. 223-278 - Roberto Barbuti, Alberto Martelli:
A Structured Approach to Static Semantics Correctness. 279-311 - Martin Rem:
Small Programming Exercises 2. 313-319
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.
last updated on 2025-11-04 00:45 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:
