EXPANSION OF TURBO PROLOGUE PROGRAMMING SYSTEM BY PREDICATES FOR LIST PROCESSING

Abstract

Lists are considered as a main data structure in logic Turbo Prologue programming language. However the language does not contain in-set predicates (procedures) for list processing. In order to facilitate a problem programming process where lists are used it is proposed to apply a Turbo Prologue version that has a set of predicates in the form of recursive rules for executing frequently repeated operations with lists such as unification of lists, italicization and deletion of some list elements, sorting-out, list reversing and many others. The modified version contains a reference to new input predicates. The proposed Turbo Prologue version is easily expanded by new rules. Usage of this version makes programmer’s work easier and promotes development of new programs where it is necessary to work with lists.