### 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 language | English |
---|---|

Title of host publication | Unknown Host Publication Title |

Place of Publication | Tokyo, Jpn |

Publisher | Ohmsha Ltd |

Pages | 333-340 |

Number of pages | 8 |

ISBN (Print) | 4274072215 |

Publication status | Published - 1984 |

Externally published | Yes |

### Fingerprint

### ASJC Scopus subject areas

- Engineering(all)

### Cite this

*Unknown Host Publication Title*(pp. 333-340). Tokyo, Jpn: Ohmsha Ltd.

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

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*Unknown Host Publication Title.*Ohmsha Ltd, Tokyo, Jpn, pp. 333-340.

}

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 -