9. ICALP 1982: Aarhus, Denmark

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