Concurrent Applicative Implementations of Nondeterministic Algorithms

@article{Salter1983ConcurrentAI,
  title={Concurrent Applicative Implementations of Nondeterministic Algorithms},
  author={R. Salter},
  journal={Comput. Lang.},
  year={1983},
  volume={8},
  pages={61-68}
}
  • R. Salter
  • Published 1983
  • Computer Science
  • Comput. Lang.
  • In this paper we introduce a methodology for utilizing concurrency in place of backtracking in the implementation of nondeterministic algorithms. This is achieved in an applicative setting through the use of the Friedman-Wise multiprogramming primitive frons, and a paradigm which views the action of nondeterministic algorithms as one of data structure construction. The element by element nondeterminism arising from a linearized search is replaced by a control structure which is oriented towards… CONTINUE READING
    1 Citations

    References

    SHOWING 1-10 OF 11 REFERENCES
    An Approach to Fair Applicative Multiprogramming
    • 20
    Backtracking in a Generalized Control Setting
    • 11
    The Revised Report on SCHEME: A Dialect of LISP.
    • 143
    An indeterminate constructor for applicative programming
    • 22
    Non-Deterministic Algorithms
    • 52
    Unbounded computational structures
    • 11
    A Basis for a Mathematical Theory of Computation1)
    • 313
    • PDF
    Nondeterministic Algorithms
    • 311
    • PDF
    Backtrack programming techniques
    • 369