INTRODUCTION TO GUARDED HORN CLAUSES.

Research output: Contribution to journalArticle

Abstract

This paper informally introduces the programming language Guarded Horn Clauses (GHC) through program examples. GHC is a parallel programming language devised from investigation of the basic framework and practice of logic programming. It introduces the guard construct with simple semantics into logic programming to express interacting processes. A GHC program naturally expresses parallelism inherent in the original problem. The simple and uniform framework of GHC should be far easier to understand than the constructs of conventional parallel programming languages. We explain GHC in comparison with Prolog, the best-known logic programming language.

Original languageEnglish
Pages (from-to)6-13
Number of pages8
JournalNEC Research and Development
Issue number84
Publication statusPublished - 1987 Jan
Externally publishedYes

Fingerprint

Computer programming languages
Logic programming
Parallel programming
Semantics

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

INTRODUCTION TO GUARDED HORN CLAUSES. / Ueda, Kazunori.

In: NEC Research and Development, No. 84, 01.1987, p. 6-13.

Research output: Contribution to journalArticle

@article{963364d2b8414475bf008228bdfbe74b,
title = "INTRODUCTION TO GUARDED HORN CLAUSES.",
abstract = "This paper informally introduces the programming language Guarded Horn Clauses (GHC) through program examples. GHC is a parallel programming language devised from investigation of the basic framework and practice of logic programming. It introduces the guard construct with simple semantics into logic programming to express interacting processes. A GHC program naturally expresses parallelism inherent in the original problem. The simple and uniform framework of GHC should be far easier to understand than the constructs of conventional parallel programming languages. We explain GHC in comparison with Prolog, the best-known logic programming language.",
author = "Kazunori Ueda",
year = "1987",
month = "1",
language = "English",
pages = "6--13",
journal = "NEC Research and Development",
issn = "0048-0436",
publisher = "NEC Media Products Ltd.",
number = "84",

}

TY - JOUR

T1 - INTRODUCTION TO GUARDED HORN CLAUSES.

AU - Ueda, Kazunori

PY - 1987/1

Y1 - 1987/1

N2 - This paper informally introduces the programming language Guarded Horn Clauses (GHC) through program examples. GHC is a parallel programming language devised from investigation of the basic framework and practice of logic programming. It introduces the guard construct with simple semantics into logic programming to express interacting processes. A GHC program naturally expresses parallelism inherent in the original problem. The simple and uniform framework of GHC should be far easier to understand than the constructs of conventional parallel programming languages. We explain GHC in comparison with Prolog, the best-known logic programming language.

AB - This paper informally introduces the programming language Guarded Horn Clauses (GHC) through program examples. GHC is a parallel programming language devised from investigation of the basic framework and practice of logic programming. It introduces the guard construct with simple semantics into logic programming to express interacting processes. A GHC program naturally expresses parallelism inherent in the original problem. The simple and uniform framework of GHC should be far easier to understand than the constructs of conventional parallel programming languages. We explain GHC in comparison with Prolog, the best-known logic programming language.

UR - http://www.scopus.com/inward/record.url?scp=0023168750&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0023168750&partnerID=8YFLogxK

M3 - Article

SP - 6

EP - 13

JO - NEC Research and Development

JF - NEC Research and Development

SN - 0048-0436

IS - 84

ER -