A Determinacy Testing Algorithm for Nondeterminate Flat Concurrent Logic Programming Languages
| dc.contributor.author | Tick, E. | |
| dc.contributor.author | Korsloot, M. | |
| dc.date.accessioned | 2023-06-20T20:48:43Z | |
| dc.date.available | 2023-06-20T20:48:43Z | |
| dc.date.issued | 1990-11 | |
| dc.description | 39 pages | en_US |
| dc.description.abstract | This paper describes an algorithm for the code generation of determinacy testing for nondeterminate flat concurrent logic programming languages. Languages such as Andorra and Pandora require that procedure invocations suspend if there is more than one candidate clause potentially satisfying the goal. The algorithm described has been developed specifically for a variant of flat Pandora based on FGHC, although the concepts are general. We have extended Kliger and Shapiro's decision-graph construction algorithm to compile "don't know" procedures which must suspend for nondeterminate goal invocation. The determinacy test is compiled into a decision graph quite different from those of committed-choice procedures, but we argue that in most cases, the same low space complexity is retained. | en_US |
| dc.identifier.uri | https://hdl.handle.net/1794/28440 | |
| dc.language.iso | en | en_US |
| dc.publisher | University of Oregon | en_US |
| dc.rights | Creative Commons BY-NC-ND 4.0-US | en_US |
| dc.subject | don't-know procedure | en_US |
| dc.subject | decision graph | en_US |
| dc.subject | node generation | en_US |
| dc.title | A Determinacy Testing Algorithm for Nondeterminate Flat Concurrent Logic Programming Languages | en_US |
| dc.type | Article | en_US |