Information and Computation, Volume 105

Volume 105, Number 1, 1993

• John C. Reynolds, Gordon D. Plotkin: On Functors Expressible in the Polymorphic Typed Lambda Calculus. 1-29 BibTeX
• L. S. van Benthem Jutting: Typing in Pure Type Systems. 30-41 BibTeX
• R. Hoofman: Continuous Information Systems. 42-71 BibTeX
• William I. Gasarch, Lane A. Hemachandra, Albrecht Hoene: On Checking Versus Evaluation of Multiple Queries. 72-93 BibTeX
• Hermann Jung, Lefteris M. Kirousis, Paul G. Spirakis: Lower Bounds and Efficient Algorithms for Multiprocessor Scheduling of Directed Acyclic Graphs with Communication Delays. 94-104 BibTeX
• Eric Sven Ristad: The Anaphora Problem. 105-131 BibTeX
• Soma Chaudhuri: More Choices Allow More Faults: Set Consensus Problems in Totally Asynchronous Systems. 132-158 BibTeX

Volume 105, Number 2, 1993

• Samson Abramsky, C.-H. Luke Ong: Full Abstraction in the Lazy Lambda Calculus. 159-267 BibTeX
• Leslie Ann Goldberg: Automating Pólya Theory: The Computational Complexity of the Cycle Index Polynomial. 268-288 BibTeX