Tulane University, New Orleans, LA, March 29 - April 1, 1995

- Stephen D. Brookes, Michael G. Main, Austin Melton, Michael W. Mislove:
**Foreword and Dedication.**

- Fabio Alessi, Paolo Baldan, Gianna Bellè, Jan J. M. M. Rutten:
**Solutions of functorial and non-functorial metric domain equations.**

- Karen L. Bernstein, Eugene W. Stark:
**Operational semantics of a focusing debugger.**

- Gérard Boudol, Cosimo Laneve:
**Termination, deadlock and divergence in the lambda-calculus with multiplicities.**

- J. Robin B. Cockett, David A. Spooner:
**Categories for synchrony and asynchrony.**

- Krishna Kishore Dhara, Gary T. Leavens:
**Weak behavioral subtyping for types with mutable objects.**

- Abbas Edalat:
**Domain theory in learning processes.**

- Jonathan Eifrig, Scott F. Smith, Valery Trifonov:
**Type inference for recursively constrained types and its application to OOP.**

- Zoltán Ésik, L. Bernátsky:
**Scott induction and equational proofs.**

- Bob Flagg, Ralph Kopperman:
**Fixed points and reflexive domain equations in categories of continuity spaces.**

- Peter J. Freyd, Peter W. O'Hearn, John Power, Robert D. Tennent, Makoto Takeyama:
**Bireflectivity.**

- Philippa Gardner:
**A name-free account of action calculi.**

- Andrew D. Gordon:
**Bisimilarity as a theory of functional programming.**

- Douglas N. Hoover:
**Maximal limit spaces, powerspaces, and Scott domains.**

- Bart Jacobs:
**Subtypes and bounded quantification from a fibred perspective.**

- Alan Jeffrey:
**A fully abstract semantics for a nondeterministic functional language with monadic types.**

- Cliff B. Jones:
**Granularity and the development of concurrent programs.**

- Cliff B. Jones:
**Fixing the semantics of some concurrent object-oriented concepts.**

- Neil D. Jones:
**Complexity and computability from a programming language perspective.**

- Achim Jung, Hermann Puhlmann:
**Types, logic and semantics for nested databases.**

- François Lamarche:
**Generalizing coherent domains and hypercoherences.**

- John Maraist, Martin Odersky, David N. Turner, Philip Wadler:
**Call-by-name, call-by-value, call-by-need and the linear lambda calculus.**

- Michael W. Mislove:
**Denotational models for unbounded nondeterminism.**

- Ugo Montanari, Marco Pistore:
**Concurrent semantics for the pi-calculus.**

- Kay-Jeannette Nuessler:
**Universality and powerdomains.**

- Peter W. O'Hearn, John Power, Robert D. Tennent, Makoto Takeyama:
**Syntactic control of interference revisited.**

- Peter W. O'Hearn, Uday S. Reddy:
**Objects, interference and the Yoneda embedding.**

- Frank Pfenning, Hao-Chi Wong:
**On a modal lambda calculus for S4.**

- Michel P. Schellekens:
**The Smyth completion: a common foundation for denotational semantics and complexity analysis.**