List manipulation in Turbo Prolog

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. B...

Full description

Bibliographic Details
Main Author: V.Cotelea
Format: Article
Language:English
Published: Vladimir Andrunachievici Institute of Mathematics and Computer Science 1995-06-01
Series:Computer Science Journal of Moldova
Online Access:http://www.math.md/nrofdownloads.php?file=/files/csjm/v3-n1/v3-n1-(pp10-23).pdf
_version_ 1811184633049513984
author V.Cotelea
author_facet V.Cotelea
author_sort V.Cotelea
collection DOAJ
description 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.
first_indexed 2024-04-11T13:16:52Z
format Article
id doaj.art-3339931a3813493bb4739a821597f183
institution Directory Open Access Journal
issn 1561-4042
language English
last_indexed 2024-04-11T13:16:52Z
publishDate 1995-06-01
publisher Vladimir Andrunachievici Institute of Mathematics and Computer Science
record_format Article
series Computer Science Journal of Moldova
spelling doaj.art-3339931a3813493bb4739a821597f1832022-12-22T04:22:23ZengVladimir Andrunachievici Institute of Mathematics and Computer ScienceComputer Science Journal of Moldova1561-40421995-06-0131(7)1023List manipulation in Turbo PrologV.Cotelea0Academy of Economic Studies, Moldova 59, Banulescu--Bodoni str., Kishinev, 277001, MoldovaThe 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.http://www.math.md/nrofdownloads.php?file=/files/csjm/v3-n1/v3-n1-(pp10-23).pdf
spellingShingle V.Cotelea
List manipulation in Turbo Prolog
Computer Science Journal of Moldova
title List manipulation in Turbo Prolog
title_full List manipulation in Turbo Prolog
title_fullStr List manipulation in Turbo Prolog
title_full_unstemmed List manipulation in Turbo Prolog
title_short List manipulation in Turbo Prolog
title_sort list manipulation in turbo prolog
url http://www.math.md/nrofdownloads.php?file=/files/csjm/v3-n1/v3-n1-(pp10-23).pdf
work_keys_str_mv AT vcotelea listmanipulationinturboprolog