SINGLE QUEUE COMPILATION.

Jiro Tanaka, Makoto Kishishita

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

Extended Concurrent Prolog (ECP) is a variant of Concurrent Prolog (CP) with OR-parallel, set-abstraction and meta-inference features. In this paper, we describe the implementation of ECP 'compiler' by showing how these extended features of ECP can be compiled to a Prolog program. Our ECP compiler has only one scheduling queue to which all the AND-related goals and all the OR-related clauses are enqueued. This scheduling method is designated 'Single Queue Compilation. ' This 'Single Queue Compilation' makes it possible to handle all kinds of AND-relations and OR-relations in a uniform manner.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science
EditorsBernard Robinet, Reinhard Wilhelm
PublisherSpringer Verlag
Pages301-314
Number of pages14
ISBN (Print)3540164421
Publication statusPublished - 1986 Dec 1
Externally publishedYes

Publication series

NameLecture Notes in Computer Science
ISSN (Print)0302-9743

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'SINGLE QUEUE COMPILATION.'. Together they form a unique fingerprint.

  • Cite this

    Tanaka, J., & Kishishita, M. (1986). SINGLE QUEUE COMPILATION. In B. Robinet, & R. Wilhelm (Eds.), Lecture Notes in Computer Science (pp. 301-314). (Lecture Notes in Computer Science). Springer Verlag.