Electronic Notes in Theoretical Computer Science, Volume 1

Volume 1, 1995

• Stephen D. Brookes, Michael G. Main, Austin Melton, Michael W. Mislove:
  Foreword and Dedication.
  Electronic Edition (link) BibTeX
• Fabio Alessi, Paolo Baldan, Gianna Bellè, Jan J. M. M. Rutten:
  Solutions of functorial and non-functorial metric domain equations.
  Electronic Edition (link) BibTeX
• Karen L. Bernstein, Eugene W. Stark:
  Operational semantics of a focusing debugger.
  Electronic Edition (link) BibTeX
• Gérard Boudol, Cosimo Laneve:
  Termination, deadlock and divergence in the lambda-calculus with multiplicities.
  Electronic Edition (link) BibTeX
• J. Robin B. Cockett, David A. Spooner:
  Categories for synchrony and asynchrony.
  Electronic Edition (link) BibTeX
• Krishna Kishore Dhara, Gary T. Leavens:
  Weak behavioral subtyping for types with mutable objects.
  Electronic Edition (link) BibTeX
• Abbas Edalat:
  Domain theory in learning processes.
  Electronic Edition (link) BibTeX
• Jonathan Eifrig, Scott F. Smith, Valery Trifonov:
  Type inference for recursively constrained types and its application to OOP.
  Electronic Edition (link) BibTeX
• Zoltán Ésik, L. Bernátsky:
  Scott induction and equational proofs.
  Electronic Edition (link) BibTeX
• Bob Flagg, Ralph Kopperman:
  Fixed points and reflexive domain equations in categories of continuity spaces.
  Electronic Edition (link) BibTeX
• Peter J. Freyd, Peter W. O'Hearn, John Power, Robert D. Tennent, Makoto Takeyama:
  Bireflectivity.
  Electronic Edition (link) BibTeX
• Philippa Gardner:
  A name-free account of action calculi.
  Electronic Edition (link) BibTeX
• Andrew D. Gordon:
  Bisimilarity as a theory of functional programming.
  Electronic Edition (link) BibTeX
• Douglas N. Hoover:
  Maximal limit spaces, powerspaces, and Scott domains.
  Electronic Edition (link) BibTeX
• Bart Jacobs:
  Subtypes and bounded quantification from a fibred perspective.
  Electronic Edition (link) BibTeX
• Alan Jeffrey:
  A fully abstract semantics for a nondeterministic functional language with monadic types.
  Electronic Edition (link) BibTeX
• Cliff B. Jones:
  Granularity and the development of concurrent programs.
  Electronic Edition (link) BibTeX
• Cliff B. Jones:
  Fixing the semantics of some concurrent object-oriented concepts.
  Electronic Edition (link) BibTeX
• Neil D. Jones:
  Complexity and computability from a programming language perspective.
  Electronic Edition (link) BibTeX
• Achim Jung, Hermann Puhlmann:
  Types, logic and semantics for nested databases.
  Electronic Edition (link) BibTeX
• François Lamarche:
  Generalizing coherent domains and hypercoherences.
  Electronic Edition (link) BibTeX
• John Maraist, Martin Odersky, David N. Turner, Philip Wadler:
  Call-by-name, call-by-value, call-by-need and the linear lambda calculus.
  Electronic Edition (link) BibTeX
• Michael W. Mislove:
  Denotational models for unbounded nondeterminism.
  Electronic Edition (link) BibTeX
• Ugo Montanari, Marco Pistore:
  Concurrent semantics for the pi-calculus.
  Electronic Edition (link) BibTeX
• Kay-Jeannette Nuessler:
  Universality and powerdomains.
  Electronic Edition (link) BibTeX
• Peter W. O'Hearn, John Power, Robert D. Tennent, Makoto Takeyama:
  Syntactic control of interference revisited.
  Electronic Edition (link) BibTeX
• Peter W. O'Hearn, Uday S. Reddy:
  Objects, interference and the Yoneda embedding.
  Electronic Edition (link) BibTeX
• Frank Pfenning, Hao-Chi Wong:
  On a modal lambda calculus for S4.
  Electronic Edition (link) BibTeX
• Michel P. Schellekens:
  The Smyth completion: a common foundation for denotational semantics and complexity analysis.
  Electronic Edition (link) BibTeX