A parallel implementation of equational programming

Nachum Dershowitz, Naomi Lindenstrauss

Research output: Contribution to conferencePaperpeer-review

Abstract

A parallel implementation of rewriting and narrowing is described. The implementation is written in Flat Concurrent Prolog (FCP) but may be coded in any system in which processes are capable of creating other processes and communicating with each other. The Tower of Hanoi problem, parallel merging, and evaluating algebraic expressions are treated as examples of rewriting. Running programs under the interpreter and using facilities provided by the FCP system has provided empirical evidence of parallel speedup in support of theoretical predictions.

Original languageEnglish
Pages426-435
Number of pages10
StatePublished - Oct 1990
Externally publishedYes
EventProceedings of the 5th Jerusalem Conference on Information Technology - Jerusalem, Isr
Duration: 22 Oct 199025 Oct 1990

Conference

ConferenceProceedings of the 5th Jerusalem Conference on Information Technology
CityJerusalem, Isr
Period22/10/9025/10/90

Fingerprint

Dive into the research topics of 'A parallel implementation of equational programming'. Together they form a unique fingerprint.

Cite this