Information and Computation, Volume 124

Volume 124, Number 1, 10 January 1996

Lance Fortnow, Nick Reingold: PP is Closed Under Truth-Table Reductions. 1-6 BibTeX
Andreas Gruchalski: Computability on dI-Domains. 7-19 BibTeX
Gérard Cécé, Alain Finkel, S. Purushothaman Iyer: Unreliable Channels are Easier to Verify Than Perfect Channels. 20-31 BibTeX
Delia Kesner, Laurence Puel, Val Tannen: A Typed Pattern Calculus. 32-61 BibTeX
Christian Haack: A Decomposition Theorem for Domains. 62-67 BibTeX
James H. Anderson, Jae-Heon Yang: Time/Contention Trade-Offs for Multiprocessor Synchronization. 68-84 BibTeX
Piotr Kosiuczenko, Karl Meinke: On the Power of Higher-Order Algebraic Specification Methods. 85-101 BibTeX

Douglas J. Howe: Proving Congruence of Bisimulation in Functional Programming Languages. 103-112 BibTeX
Chun-Kuen Ho: Beyond Recursive Real Functions. 113-126 BibTeX
Rachel Ben-Eliyahu, Menachem Magidor: A Temporal Logic for Proving Properties of Topologically General Executions. 127-144 BibTeX
Campbell Fraser, Robert W. Irving, Martin Middendorf: Maximal Common Subsequences and Minimal Common Supersequences. 145-153 BibTeX
Alexander Moshe Rabinovich: On Schematological Equivalence of Dataflow Networks. 154-167 BibTeX
Hsu-Chun Yen: On the Regularity of Petri Net Languages. 168-181 BibTeX
Abbas Edalat: Power Domains and Iterated Function Systems. 182-197 BibTeX