Abstract is missing.
- Locality in Modular SystemsRalph-Johan Back, Heikki Mannila. 1-13
- On-the-Fly Garbage Collection: New Algorithms Inspired by Program ProofsMordechai Ben-Ari. 14-22
- Algebraic Specifications for Parametrized Data Types with Minimal Parameter and Target AlgebrasJan A. Bergstra, Jan Willem Klop. 23-34
- A Modification of the Lambda-Calculus as a Base for Functional Programming LanguagesKlaus J. Berkling, Elfriede Fehr. 35-47
- On the Power of Nondeterminism in Dynamic LogicPiotr Berman, Joseph Y. Halpern, Jerzy Tiuryn. 48-60
- Equivalence and Membership Problems for Regular Trace LanguagesAlberto Bertoni, Giancarlo Mauri, Nicoletta Sabadini. 61-71
- On the Power of Chain Rules in Context Free GrammarsNorbert Blum. 72-82
- Extended Chomsky-Schützenberger TheoremsFranz-Josef Brandenburg. 83-93
- Real Time AgentsLuca Cardelli. 94-106
- Machine Inductive Inference and Language IdentificationJohn Case, Christopher Lynes. 107-115
- Approximations of Infinitary ObjectsGérard Comyn, Max Dauchet. 116-127
- On Test Sets and the Ehrenfeucht ConjectureKarel Culik II. 128-140
- An Automata-Theoretic Characterization of the OI-HierarchyWerner Damm, Andreas Goerdt. 141-153
- Fast Detection of Polyhedral IntersectionsDavid P. Dobkin, David G. Kirkpatrick. 154-165
- On Reversal-Bounded Counter Machines and on Pushdown Automata with a Bound on the Size of the Pushdown StorePavol Duris, Zvi Galil. 166-175
- Multihead Finite State Automata and ConcatenationPavol Duris, Juraj Hromkovic. 176-186
- Conditions Enforcing Regularity of Context-Free LanguagesAndrzej Ehrenfeucht, David Haussler, Grzegorz Rozenberg. 187-191
- Repetitions in Homomorphisms and LanguagesAndrzej Ehrenfeucht, Grzegorz Rozenberg. 192-211
- An Operational Semantics for Pure DataflowAntony A. Faustini. 212-224
- Some Properties of D-Continuous Causal NetsCésar Fernández, P. S. Thiagarajan. 225-238
- A Branching Process Arising in Dynamic Hashing, Trie Searching and Polynomial FactorizationPhilippe Flajolet, Jean-Marc Steyaert. 239-251
- A Sound and Complete Hoare Axiomatization of the Ada-RendevousRob Gerth. 252-264
- Universal Realization, Persistent Interconnection and Implementation of Abstract ModulesJoseph A. Goguen, José Meseguer. 265-281
- Heaps on HeapsGaston H. Gonnet, J. Ian Munro. 282-291
- A Boundary of Isomorphism Completeness in the Lattice of Semigroup PseudovarietiesA. Goralciková, Pavel Goralcik, Václav Koubek. 292-299
- Derived Pairs, Overlap Closures, and Rewrite Dominoes: New Tools for Analyzing Term rewriting SystemsJohn V. Guttag, Deepak Kapur, David R. Musser. 300-312
- A Programming Language for the Inductive Sets, and ApplicationsDavid Harel, Dexter Kozen. 313-329
- A Lower Bound for the Formula Size of Rational FunctionsK. Kalorkoti. 330-338
- On the Equivalence Problem for Binary DOL SystemsJuhani Karhumäki. 339-347
- Results on the Propositional µ-CalculusDexter Kozen. 348-359
- An Iteration Theorem for Simple Precedence Languages (Extended Abstract)Yael Krevner, Amiram Yehudai. 360-368
- The Power of Non-Rectilinear HolesAndrzej Lingas. 369-383
- Fixed-Point Semantics for Algebraic (Tree) Grammars (Extended Abstract)Damian Niwinski. 384-396
- Completing Biprefix CodesDominique Perrin. 397-406
- Advances in Pebbling (Preliminary Version)Nicholas Pippenger. 407-417
- A Powerdomain for Countable Non-Determinism (Extended Abstract)Gordon D. Plotkin. 418-428
- Properties of a Notation for Combining FunctionsJean-Claude Raoult, Ravi Sethi. 429-441
- On the Power of Probabilistic Choice in Synchronous Parallel ComputationsJohn H. Reif. 442-450
- Biprefix Codes and Semisimple AlgebrasChristophe Reutenauer. 451-457
- Algorithmic Theories of Data StructuresAndrzej Salwicki. 458-472
- Implementation of Parameterised Specifications (Extended Abstract)Donald Sannella, Martin Wirsing. 473-488
- Algebraic Semantics of Recursive Flowchart SchemesHartmut Schmeck. 489-501
- The Complexity of Promise ProblemsAlan L. Selman, Yacov Yacobi. 502-509
- Global and Local Invariants in Transition SystemsJoseph Sifakis. 510-522
- On Relativization and the Existence of Complete SetsMichael Sipser. 523-531
- Semantics of Interference ControlRobert D. Tennent. 532-545
- Efficient Simulations of Multicounter MachinesPaul M. B. Vitányi. 546-560
- Event Structure Semantics for CCS and Related LanguagesGlynn Winskel. 561-576
- Domains for Denotational SemanticsDana S. Scott. 577-613