RO EN
List manipulation in Turbo Prolog
Authors: V. Cotelea
– 0.10 Mb
Abstract
The present paper is concerned with list processing in Turbo Prolog language. It doesn't claim to be an exhaustive description of operations which can be performed upon lists. Nevertheless adduced programs are most representative, more or less known to specialists in logic programming domain. By means of examples are explained the list manipulation techniques, use of recursion, declarative comparison of predicates, analysis and fixation of acceptable prototypes and some problems of predicates' inconsistency. Index terms. Prolog, list, recursion.V. Cotelea,
Academy of Economic Studies, Moldova
59, Banulescu--Bodoni str., Kishinev,
277001, Moldova
Academy of Economic Studies, Moldova
59, Banulescu--Bodoni str., Kishinev,
277001, Moldova
Fulltext
– 0.10 Mb
Contents
- Meta-generation of syntax-oriented editors
- List manipulation in Turbo Prolog
- Noncommutative Grobner basis, Hilbert series, Anick's resolution and BERGMAN under MS-DOS
- The Roumanian spelling checker ROMSP: the project overview
- Modeling of the characteristics of the priority disciplines DD
- Digital Elevation Model for Republic of Moldova
- Algorithms for generalized fractional programming
