Theoretical Computer Science, Volume 176

Volume 176, Numbers 1-2, 20 April 1997

• Sue-Hwey Wu, Scott A. Smolka, Eugene W. Stark:
  Composition and Behaviors of Probabilistic I/O Automata. 1-38
  Electronic Edition (link) BibTeX
• Giovanni Chiola, Claude Dutheillet, Giuliana Franceschinis, Serge Haddad:
  A Symbolic Reachability Graph for Coloured Petri Nets. 39-65
  Electronic Edition (link) BibTeX
• Hubert Comon, Ralf Treinen:
  The First-Order Theory of Lexicographic Path Orderings is Undecidable. 67-87
  Electronic Edition (link) BibTeX
• Douglas N. Hoover:
  Limiting Semantics of Numerical Programs. 89-110
  Electronic Edition (link) BibTeX
• Miki Hermann, Roman Galbavý:
  Unification of Infinite Sets of Terms Schematized by Primal Grammars. 111-158
  Electronic Edition (link) BibTeX
• Simone Martini, Andrea Masini:
  Experiments in Linear Natural Deduction. 159-173
  Electronic Edition (link) BibTeX
• Armando B. Matos:
  Monadic Logic Programs and Functional Complexity. 175-204
  Electronic Edition (link) BibTeX
• Chrysafis Hartonas:
  Semantics of Finite Delay. 205-234
  Electronic Edition (link) BibTeX
• Benjamin C. Pierce, Martin Steffen:
  Higher-Order Subtyping. 235-282
  Electronic Edition (link) BibTeX , Corrigendum: TCS 184(1-2): 247 (1997)
• Dan Suciu:
  Bounded Fixpoints for Complex Objects. 283-328
  Electronic Edition (link) BibTeX
• Peter Dybjer:
  Representing Inductively Defined Sets by Wellorderings in Martin-Löf's Type Theory. 329-335
  Electronic Edition (link) BibTeX
• Giuseppe Castagna:
  Unifying Overloading and lambda-Abstraction: lambda^{}. 337-345
  Electronic Edition (link) BibTeX
• A. Massol:
  Minimality of the System of Seven Equations for the Category of Finite Sets. 347-353
  Electronic Edition (link) BibTeX