NOTE ON THE SET ABSTRACTION IN LOGIC PROGRAMMING LANGUAGE.

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

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.

Original languageEnglish
Title of host publicationUnknown Host Publication Title
PublisherOhmsha Ltd
Pages333-340
Number of pages8
ISBN (Print)4274072215
Publication statusPublished - 1984 Dec 1
Externally publishedYes

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'NOTE ON THE SET ABSTRACTION IN LOGIC PROGRAMMING LANGUAGE.'. Together they form a unique fingerprint.

  • Cite this

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