Abstract is missing.
- Formal Description of Programming Concepts: A Software Engineering ViewpointDines Bjørner. 1-21
- Electronic Category TheoryRod M. Burstall. 22-39
- An Eassay about Research on Sparse NP Complete SetsJuris Hartmanis, Stephen R. Mahaney. 40-57
- Some Theoretical Aspects of Applicative MultiprocessingRobert M. Keller. 58-74
- On Some Discrete Optimization Problems in Mass Storage SystemsC. K. Wong. 75-93
- Abstract Data Types: A Retrospective and Prospective ViewWilliam A. Wulf. 94-112
- Controlling Behaviours of Systems: Some Basic Concepts and some ApplicationsAndré Arnold, Maurice Nivat. 113-122
- Conceptual Relations between Databases Transformed under Join and ProjectionGiorgio Ausiello, Carlo Batini, Marina Moscarini. 123-136
- The Weighted Sperner s Set ProblemX. Berenguer, J. Díaz. 137-141
- Proof of a Concurrent Program Finding Euler PathsEike Best. 142-153
- A Theoretical Basis for the Systematic Proof MethodWolfgang Bibel. 154-167
- Consistent Semantics for a Data Flow LanguageJ. Dean Brock. 168-180
- Analog ProcessesLuca Cardelli. 181-193
- An Extended Polymorphic Type System for Applicative LanguagesMario Coppo. 194-204
- A Criterion of Undecidability of Algorithmic TheoriesWiktor Danko. 205-218
- On Finding the Optimal Access Path to Resolve a Relational Data Base QueryPierpaolo Degano, A. Lomanto, Franco Sirovich. 219-230
- Compound Algebraic Implementations: An Approach to Stepwise Refinement of Software SystemsHartmut Ehrig, Hans-Jörg Kreowski, Bernd Mahr, Peter Padawitz. 231-245
- on And/Or SchemesDavid Harel. 246-260
- A Term Model for CCSMatthew Hennessy, Gordon D. Plotkin. 261-274
- A Mathematical Approach to Multi-Pass ParsingBerthold Hoffmann, Ilse-R. Schiedecke. 275-290
- Abstract Implementation of Abstract Data TypesUlrich L. Hupbach. 291-304
- Parallel Algorithms in Graph Theory: Planarity Testing (preliminary version)Joseph JáJá, Janos Simon. 305-319
- On Atomic Nets and Concurrency RelationsRyszard Janicki. 320-333
- Node-Label Controllel Graph GrammarsDirk Janssens, Grzegorz Rozenberg. 334-347
- A Method to Compare the Descriptive Power of Different Types of Petri NetsKurt Jensen. 348-361
- A Simple Class of Algorithmic Specifications for Abstract Software ModulesHerbert Klaeren. 362-374
- Inducing Patterns of Behaviour in Distributed System PartsNorbert Kraft, Horst Wedde. 375-386
- Van Wijngaarden Grammars as a Special Information Processing ModelIngbert Kupka. 387-401
- Approaches to Concurrency in B-TreesYat-Sang Kwong, Derick Wood. 402-413
- On a Subclass of Pseudopolynomial ProblemsBurkhard Monien. 414-425
- Decidability of Reachability in Persistent Vector Replacement SystemsHorst Müller. 426-438
- Generalized HeapsortSeiichi Okoma. 439-451
- Decidability Results on a Query Language for Data Bases with Incomplete InformationsHiroakira Ono, Akira Nakamura. 452-459
- New Results on Completeness and Consistency of Abstract Data TypesPeter Padawitz. 460-473
- Asymptotic Complexity of Game-Searching ProceduresJudea Pearl. 474-487
- Completeness in Classical Logic of Complex AlgorithmsHelena Rasiowa. 488-503
- Initially-Restricting Algebraic TheoriesHorst Reichel. 504-514
- Schemes for Nonsequential Processing SystemsWolfgang Reisig. 515-527
- Dynamic Algebras which are not Kripke StructuresJan Reiterman, Vera Trnková. 528-538
- Time and Space Bounds in Producing Certain Partial OrdersPeter Ruzicka. 539-551
- Axioms of Algorithmic Logic Univocally Determine Semantics of ProgramsAndrzej Salwicki. 552-561
- A Logical Approach to the Problem P=NP? Vladimir Yu. Sazonov. 562-575
- Verifying Concurrent System Specification in COSYM. W. Shields, Peter E. Lauer. 576-586
- Deadlocks and Livelocks in Transition SystemsJoseph Sifakis. 587-600
- Descriptional Complexity of Concurrent Processes (preliminary version)Giora Slutzki. 601-611
- A Uniform Approach to Applicative and Imperative Features in Programming LanguagesStefan Sokolowski. 612-626
- A Resource Applocation ProblemZbigniew Suraj. 627-642
- An O(n² log log log n) Expected Time Algorithm for the all Shortest Distance ProblemTadao Takaoka, Alistair Moffat. 643-655
- Decision Complexity of Variants of Propositional Dynamic LogicMars K. Valiev. 656-664
- Relativized ObliviousnessPaul M. B. Vitányi. 665-672
- Abstract Data Types as Lattices of Finitely Generated ModelsMartin Wirsing, Manfred Broy. 673-685
- The LR(k) ParserJacek Witaszek. 686-697
- Substitution Systems - A Family of System Models Based on ConcurrencyHartmann J. Genrich, Kurt Lautenbach, P. S. Thiagarajan. 698-723