NOTE ON THE SET ABSTRACTION IN LOGIC PROGRAMMING LANGUAGE.

Takashi Yokomori*

*この研究の対応する著者

研究成果

抄録

The concept of set abstraction is introduced as a simple analogy to lambda abstraction in the theory of lambda calculus. The set abstraction is concerned with two extensions of language features: set expression and predicate variable. Combining these two concepts of extensions to Prolog, we define set abstraction as the set expression in which predicate variables are allowed as data objects. In other words, the set abstraction gets involved in the higher order predicate logic. It is demonstrated that with the help of predicate variables, set abstractions can nicely handle the world of the second order predicate logic. Implementation programs written in Prolog and Concurrent Prolog are presented.

本文言語English
ホスト出版物のタイトルUnknown Host Publication Title
出版社Ohmsha Ltd
ページ333-340
ページ数8
ISBN(印刷版)4274072215
出版ステータスPublished - 1984 12 1
外部発表はい

ASJC Scopus subject areas

  • 工学(全般)

フィンガープリント

「NOTE ON THE SET ABSTRACTION IN LOGIC PROGRAMMING LANGUAGE.」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル