default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDScience of Computer Programming, Volume 10
Volume 10, Number 1, February 1988
- Orit Baruch, Shmuel Katz:
Partially Interpreted Schemas for CSP Programming. 1-18 - F. E. J. Kruseman Aretz:
On Deriving a LISP Program From Its Specification. 19-32 - Deepak Kapur, Mandayam K. Srivas:
Computability and Implementability Issues in Abstract Data Types. 33-63 - Manfred Broy:
Nondeterministic Data Flow Programs: How to Avoid the Merge Anomaly. 65-85 - Martin Rem:
Small Programming Exercises 20. 99-105
Volume 10, Number 2, April 1988
- Gerard Tel, Richard B. Tan, Jan van Leeuwen:
The Derivation of Graph Marking Algorithms From Distributed Termination Detection Protocols. 107-137 - Hanne Riis Nielson, Flemming Nielson:
Automatic Binding Time Analysis for a Typed lambda-Calculus. 139-176 - Ian A. Mason:
Verification of Programs That Destructively Manipulate Data. 177-210
Volume 10, Number 3, June 1988
- Boleslaw K. Szymanski
, Noah S. Prywes:
Efficient Handling of Data Structures in Definitional Languages. 221-245 - Beat Michel:
A 'Division' Transformation for Program and Data Structures and the Structure Clash Problem. 247-280 - Peter G. Harrison:
Linearisation: An Optimisation for Nonlinear Functional Programs. 281-318 - Martin Rem:
Small Programming Exercises 21. 319-325
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 2024-12-23 19:35 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:
