Information and Computation, Volume 126

Volume 126, Number 1, 10 April 1996

Wan Fokkink, Rob J. van Glabbeek: Ntyft/Ntyxt Rules Reduce to Ntree Rules. 1-10 BibTeX
Martin Hofmann, Benjamin C. Pierce: Positive Subtyping. 11-33 BibTeX
Michele Boreale, Rocco De Nicola: A Symbolic Semantics for the pi-Calculus. 34-52 BibTeX
Hasan Md. Sayeed, Hosame Abu-Amara: Efficient Perfectly Secure Message Transmission in Synchronous Networks. 53-61 BibTeX
Rajeev Alur, Gadi Taubenfeld: Contention-Free Complexity of Shared Memory Algorithms. 62-73 BibTeX
Gordon D. Plotkin: On a Question of H. Friedman. 74-77 BibTeX
Toshiya Itoh: Simulating Fair Dice with Biased Coins. 78-82 BibTeX
Gérard Boudol, Cosimo Laneve: The Discriminating Power of Multiplicities in the Lambda-Calculus. 83-102 BibTeX

Manfred Droste: Aperiodic Languages in Concurrency Monoids. 105-113 BibTeX
Thomas R. Hancock, Tao Jiang, Ming Li, John Tromp: Lower Bounds on Learning Decision Lists and Trees. 114-122 BibTeX
Roel Bloo, Fairouz Kamareddine, Rob Nederpelt: The Barendregt Cube with Definitions and Generalised Reduction. 123-143 BibTeX
Christophe Ringeissen: Combining Decision Algorithms for Matching in the Union of Disjoint Equational Theories. 144-160 BibTeX
Shiva Chaudhuri: Sensitive Functions and Approximate Problems. 161-168 BibTeX