Paper
A model for the parallel execution of subset-equational languages

https://doi.org/10.1016/0167-739X(95)00002-AGet rights and content

Abstract

This paper describes a model for the parallel execution of subset-equational languages, a class of functional languages that allow constrained nondeterminism. The fundamentals of subset-equational languages are presented, followed by the formulation of a kernel language that is used as the basis of the model. The languages are based on nondeterministic term-rewriting systems; the model uses dataflow execution graphs and is suitable for implementation on both conventional and unconventional machines.

References (30)

  • N. Dershowitz et al.

    Rewrite systems

  • A. Omondi

    On functional languages and parallel computers

    Future Generation Computer Syst.

    (1991)
  • D.A. Plaisted

    Semantic confluence tests and completion methods

    Information and Control

    (1985)
  • H. Aida et al.

    Architectural design of the rewrite rule machine

  • Arvind et al.

    Managing resources in a parallel machine

  • H. Barendregt
  • F.W. Burton

    Nondeterminism with referential transparency in functional languages

    Comput. J.

    (1988)
  • K. Clark et al.

    PARLOG: Parallel programming in logic

    ACM Trans. Programming Languages and Systems

    (1986)
  • J.S. Conery
  • J. Crammond

    A comparative study of unification algorithms for or-parallel execution of logic languages

    IEEE Trans. Comput.

    (1985)
  • A.L. Davis et al.

    Dataflow program graphs

    IEEE Comput.

    (1982)
  • N. Dershowitz

    Computing with rewrite rules

    Information and Control

    (1985)
  • J.R.W. Glauert

    An active rewrite model for parallel computation

  • J. Goguen et al.

    Concurrent rewriting as a model of computation

  • P. Henderson

    Purely functional operating systems

  • Cited by (0)

    View full text