A declarative semantics of flat guarded horn clauses for programs with perpetual processes

Research output: Contribution to journalArticlepeer-review

3 Citations (Scopus)

Abstract

A declarative semantics of a concurrent programming language based on Horn logic such as Flat GHC is presented. The domain of input/output (I/O) histories is introduced. The model of a program is defined as a set of I/O histories. The notion of truth is redifined for goal clauses and sets of guarded clauses. The semantics of a program is defined as the maximum model of the program. We also show that the semantics is characterized as the greatest fixpoint of the function obtained from the program. The properties of programs that contain perpetual computation controlled by guard-commit mechanisms can be discussed using the semantics.

Original languageEnglish
Pages (from-to)67-83
Number of pages17
JournalTheoretical Computer Science
Volume75
Issue number1-2
DOIs
Publication statusPublished - 1990
Externally publishedYes

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint

Dive into the research topics of 'A declarative semantics of flat guarded horn clauses for programs with perpetual processes'. Together they form a unique fingerprint.

Cite this