Paper Info
Title
A model for the parallel execution of subset-equational languages
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.
Year
DOI
Venue
1995
10.1016/0167-739X(95)00002-A
Future Generation Comp. Syst.
Keywords
Field
DocType
functional language,functional languages,parallel processing
Fifth-generation programming language,Second-generation programming language,Comparison of multi-paradigm programming languages,Programming language,Nondeterministic algorithm,Functional programming,Computer science,Theoretical computer science,Dataflow,Third-generation programming language,Ontology language
Journal
Volume
Issue
ISSN
11
3
0167-739X
Citations 
PageRank 
References 
0
0.34
12
Authors
2
Name
Order
Citations
PageRank
Amos R. Omondi1173.88
David A. Plaisted21680255.36