A GHC abstract machine and instruction set

Lévy, Julien

doi:10.1007/3-540-16492-8_72

Search citation statements

Order By: Relevance

Paper Sections

Select...

Rule Of Sequencing1

Sequential Implementations1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

1986

1992

Publication Types

Select...

Article3

Book2

Relationship

Self Cite0

Independent5

Authors

Journals

Cited by 6 publications

(2 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The option on executing the bodies of GHC clauses before commitment subject to GHC's rule of sequencing [21] [8,12], no special suspension mechanism is proposed for supporting GHC's rule of sequencing by the lingua franca. The same rule obeyed by Parlog of strict sequencing of evaluation will be obeyed by the lingua franca and only when the clause has committed will evaluation of the body commence.…”

Section: Rule Of Sequencingmentioning

confidence: 99%

A lingua franca for concurrent logic programming

Taylor

1992

IIEEE Trans. Software Eng.

View full text Add to dashboard Cite

Section: Rule Of Sequencingmentioning

confidence: 99%

A lingua franca for concurrent logic programming

Taylor

1992

IIEEE Trans. Software Eng.

View full text Add to dashboard Cite

“…Their complexity, however, seemed unacceptable, and was partially a motivation for the development of Flat Concurrent Prolog and the simpler non-flat languages, GHC, PARLOG, and CP(I,L), An abstract machine for PARLOG was developed by Gregory et al [68], and later optimized by Crammond [34). Another abstract machine for GHC was derived from the FCP machine by Levy [114]. Another abstract machine for GHC was derived from the FCP machine by Levy [114].…”

Section: Sequential Implementationsmentioning

confidence: 99%