A parallel implementation of equational programming
- 4 December 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 426-435
- https://doi.org/10.1109/jcit.1990.128313
Abstract
A parallel implementation of rewriting and narrowing is described. This 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. Running programs under the interpreter and using facilities provided by the FCP system, we obtain empirical evidence of parallel speed-up in support of theoretical predictions.Keywords
This publication has 13 references indexed in Scilit:
- OR-parallel PROLOG in flat concurrent PROLOGThe Journal of Logic Programming, 1989
- An implementation of narrowingThe Journal of Logic Programming, 1989
- A parallel implementation of rewriting and narrowingPublished by Springer Nature ,1989
- Solving goals in equational languagesPublished by Springer Nature ,1988
- The undecidability of the unification and matching problem for canonical theoriesActa Informatica, 1987
- Concurrent term rewriting as a model of computationPublished by Springer Nature ,1987
- Improving basic narrowing techniquesPublished by Springer Nature ,1987
- Concurrent Prolog: A Progress ReportComputer, 1986
- The average height of binary trees and other simple treesJournal of Computer and System Sciences, 1982
- Canonical forms and unificationPublished by Springer Nature ,1980