NOTE ON THE SET ABSTRACTION IN LOGIC PROGRAMMING LANGUAGE.

研究成果: Conference contribution

抄録

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
出版場所Tokyo, Jpn
出版者Ohmsha Ltd
ページ333-340
ページ数8
ISBN(印刷物)4274072215
出版物ステータスPublished - 1984
外部発表Yes

Fingerprint

Logic programming
Computer programming languages

ASJC Scopus subject areas

  • Engineering(all)

これを引用

Yokomori, T. (1984). NOTE ON THE SET ABSTRACTION IN LOGIC PROGRAMMING LANGUAGE.Unknown Host Publication Title (pp. 333-340). Tokyo, Jpn: Ohmsha Ltd.

NOTE ON THE SET ABSTRACTION IN LOGIC PROGRAMMING LANGUAGE. / Yokomori, Takashi.

Unknown Host Publication Title. Tokyo, Jpn : Ohmsha Ltd, 1984. p. 333-340.

研究成果: Conference contribution

Yokomori, T 1984, NOTE ON THE SET ABSTRACTION IN LOGIC PROGRAMMING LANGUAGE.Unknown Host Publication Title. Ohmsha Ltd, Tokyo, Jpn, pp. 333-340.
Yokomori T. NOTE ON THE SET ABSTRACTION IN LOGIC PROGRAMMING LANGUAGE. : Unknown Host Publication Title. Tokyo, Jpn: Ohmsha Ltd. 1984. p. 333-340
Yokomori, Takashi. / NOTE ON THE SET ABSTRACTION IN LOGIC PROGRAMMING LANGUAGE. Unknown Host Publication Title. Tokyo, Jpn : Ohmsha Ltd, 1984. pp. 333-340
@inproceedings{cf676db5d7a749a586677c2ce0305cba,
title = "NOTE ON THE SET ABSTRACTION IN LOGIC PROGRAMMING LANGUAGE.",
abstract = "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.",
author = "Takashi Yokomori",
year = "1984",
language = "English",
isbn = "4274072215",
pages = "333--340",
booktitle = "Unknown Host Publication Title",
publisher = "Ohmsha Ltd",

}

TY - GEN

T1 - NOTE ON THE SET ABSTRACTION IN LOGIC PROGRAMMING LANGUAGE.

AU - Yokomori, Takashi

PY - 1984

Y1 - 1984

N2 - 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.

AB - 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.

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

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

M3 - Conference contribution

AN - SCOPUS:0021654472

SN - 4274072215

SP - 333

EP - 340

BT - Unknown Host Publication Title

PB - Ohmsha Ltd

CY - Tokyo, Jpn

ER -