Theoretical Computer Science, Volume 136

Volume 136, Number 1, 19 December 1994

• Peter T. Johnstone: Variations on the Bagdomain Theme. 3-20 BibTeX
• Reinhold Heckmann: Stable Power Domains. 21-56 BibTeX
• Adrian Fiech, Michael Huth: Algebraic Domains of Natural Transformations. 57-78 BibTeX
• Austin Melton, Bernd S. W. Schröder, George E. Strecker: Lagois Connections - a Counterpart to Galois Connections. 79-107 BibTeX
• Philip S. Mulry: Partial Map Classifiers and Partial Cartesian Closed Categories. 109-123 BibTeX
• Eike Ritter: Categorical Abstract Machines for Higher-Order Typed lambda-Calculi. 125-162 BibTeX
• Edmund Robinson: Parametricity as Isomorphism. 163-181 BibTeX
• Fairouz Kamareddine, Rob Nederpelt: A Unified Approach to Type Theory Through a Refined lambda-Calculus. 183-216 BibTeX
• Roy L. Crole: Computational Adequacy of the FIX-Logic. 217-242 BibTeX
• Bettina Blaaberg, Christian Clausen: Adequacy for a Lazy Functional Language with Recursive and Polymorphic Types. 243-275 BibTeX
• David A. Wolfram: A Semantics for lambda-Prolog. 277-289 BibTeX

Volume 136, Number 2, 29 December 1994

• Eric Rémila: Recognition of Graphs by Automata. 291-332 BibTeX
• Enno Ohlebusch: On the Modularity of Termination of Term Rewriting Systems. 333-360 BibTeX
• Aldo de Luca, Filippo Mignosi: Some Combinatorial Properties of Sturmian Words. 361-285 BibTeX
• Houcine Senoussi, Ahmed Saoudi: A Quadtree Algorithm for Template Matching on a Pyramid Computer. 387-417 BibTeX
• Vladimir Stetsenko: On Almost Bad Boolean Bases. 419-469 BibTeX
• Masami Ito, Gabriel Thierrin: Congruences, Infix and Cohesive Prefix Codes. 471-485 BibTeX
• Elvira Mayordomo: Almost Every Set in Exponential Time is P-bi-Immune. 487-506 BibTeX
• Marek Chrobak, Wojciech Rytter: Two Results on Linear Embeddings of Complete Binary Trees. 507-526 BibTeX
• Marcos A. Kiwi, René Ndoundam, Maurice Tchuente, Eric Goles Ch.: No Polynomial Bound for the Period of the Parallel Chip Firing Game on Graphs. 527-532 BibTeX