Computability in Europe 2006
Logical Approaches to Computational Barriers

Regular Talk:
On generalising predicate abstraction

Speaker: Birgit Elbl
Slot: Array, 17:00-17:20, col. 2


Starting from a simple term system, in which pure Prolog can be naturally embedded, the mechanism for building predicate terms is generalised. The resulting system has two forms of predicate abstraction which differ in semantics and are different from functional abstraction. It is more expressive than the original system, hence more expressive than pure Prolog. This is exemplified by defining some meta-logical predicates.

websites: Arnold Beckmann 2006-06-29