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
L. S. van Benthem Jutting
: Typing in Pure Type Systems. 30-41
R. Hoofman
: Continuous Information Systems. 42-71
William I. Gasarch
,
Lane A. Hemachandra
,
Albrecht Hoene
: On Checking Versus Evaluation of Multiple Queries. 72-93
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
Eric Sven Ristad
: The Anaphora Problem. 105-131
Soma Chaudhuri
: More Choices Allow More Faults: Set Consensus Problems in Totally Asynchronous Systems. 132-158
Volume 105, Number 2, 1993
Samson Abramsky
,
C.-H. Luke Ong
: Full Abstraction in the Lazy Lambda Calculus. 159-267
Leslie Ann Goldberg
: Automating Pólya Theory: The Computational Complexity of the Cycle Index Polynomial. 268-288
Copyright ©
Wed Dec 9 20:22:05 2009 by
Michael Ley
(
ley@uni-trier.de
)