Harold ; or, two died for me by Laura A. Barter Snow(
Book
)1
edition published
in
1891
in
English
and held by
4 WorldCat member
libraries
worldwide

Pattern matching with abstract data types by Simon Fraser University(
Book
)3
editions published
in
1991
in
English
and held by
4 WorldCat member
libraries
worldwide
Two proposals have been made to generalize pattern matching to a broader class of data types: the laws mechanism of Miranda,
which allows pattern matching with non-free algebraic types, and the views concept of Wadler (1987), which enables defining
of arbitrary mappings between a physical implementation and a view supporting pattern matching. This paper proposes a third
approach which unifies the laws and views mechanisms while avoiding their problems. The paper views pattern matching philosophically
as a bundling of case recognition and component selection functions instead of a method for inverting data construction. This
can be achieved by removing the implied equivalence between data constructors and pattern constructors. In practice, the proposal
allows automatic mapping into a view but not out of a view. Equational reasoning can still be used with the resulting system

Guaranteeing good space bounds for parallel programs by Simon Fraser University(
Book
)3
editions published
in
1992
in
English
and held by
4 WorldCat member
libraries
worldwide
The space requirements of a parallel program may be spectacularly different from those of an equivalent sequential program.
This study assumes that each parallel program has an underlying sequential execution order that may be used as a basis for
judging storage requirements. The author proposes a restriction that is sufficient to ensure that any program that will run
in n units of space sequentially can run in mn units of space on m processors. The paper shows whether it is possible to transform
a program to one that satisfies this restriction, and whether some potential parallelism may be lost in the transformation.
The paper also develops a method to ensure that all programs meet the restrictions by imposing certain features, and develops
a space scheduling strategy that will be within a factor of two of being optimal with respect to time

Indeterminate behavior with determinate semantics in parallel programs by Simon Fraser University(
Book
)3
editions published
in
1989
in
English
and held by
3 WorldCat member
libraries
worldwide
A parallel program may be indeterminate so that it can adapt its behaviour to the number of processors available, or at least
so that low level timing issues are removed from the program. Indeterminate programs are hard to write, understand, modify
or verify. They are impossible to debug, since they may not behave the same from one run to the next. This paper proposes
a new construct, a polymorphic abstract data type called an improving value, with operations that have indeterminate behaviour
but simple determinate semantics. These operations allow the type of indeterminate behaviour required by many parallel algorithms.
The paper defines the improving values in the context of a functional programming language, but the technique can be used
in a procedural program as well

Limitations of process management in distributed systems by Simon Fraser University(
Book
)3
editions published
in
1990
in
English
and held by
3 WorldCat member
libraries
worldwide
Many proposed and existing languages for parallel computing support dynamic process creation and allow processes to synchronize
in arbitrary ways. This paper considers a system where processes may be created dynamically as a computation progresses and
may synchronize with other processes in an arbitrary way, assuming that a process cannot be moved once it has started. The
paper shows that the order in which processes are scheduled may make a spectacular difference in the performance of the program,
particularly in speeding up the processes, although in practice it is not likely to have sufficient information to be able
to determine which process should be scheduled and therefore it is not possible to avoid bad schedules