Compiling OR-parallelism into AND-parallelism (Q1819930): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(5 intermediate revisions by 4 users not shown) | |||
Property / describes a project that uses | |||
Property / describes a project that uses: PARLOG / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: GHC / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: PARLOG: parallel programming in logic / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3727368 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A parallel implementation of flat concurrent Prolog / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Advances in Computer Science - ASIAN 2004. Higher-Level Decision Making / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3742690 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3994465 / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/bf03037457 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2013234715 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 09:25, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Compiling OR-parallelism into AND-parallelism |
scientific article |
Statements
Compiling OR-parallelism into AND-parallelism (English)
0 references
1987
0 references
This paper suggests a general method for compiling OR-parallelism into AND-parallelism. An interpreter for an AND/OR-parallel language written in the AND-parallel subset of the language induces a source-to-source transformation from the full language into the AND-parallel subset. This transformation can be identified and implemented as a special purpose compiler or applied using a general purpose partial evaluator. The method is demonstrated to compile a variant of Concurrent Prolog into an AND-parallel subset of the language called Flat Concurrent Prolog (FCP). It is also shown applicable to the compilation of OR-parallel Prolog to FCP. The transformation identified is simple and efficient. The performance of the method is discussed in the context of programming examples. These compare well with conventionally compiled Prolog programs.
0 references
partial evaluation
0 references
program transformation
0 references
Concurrent Prolog
0 references
Flat Concurrent Prolog
0 references
examples
0 references
Prolog programs
0 references