Title Details: | |
Infinite Terms in a variable: Prolog Lists |
|
Authors: |
Sakellariou, Ilias Vasileiadis, Nikolaos Kefalas, Petros Stamatis, Dimosthenis |
Reviewer: |
Tsadiras, Athanasios |
Description: | |
Abstract: |
The chapter presents the most commonly used data structure in Prolog: the list of terms. It emphasizes that lists are recursively structured compound terms that allow the representation of potentially infinite sequences, making them highly applicable in programming. The chapter explains how the unification mechanism applies to lists, taking advantage of their special syntax. Examples of recursive predicate definitions using lists are provided, and finally, classic list-handling predicates—such as member, append, delete, etc.—are introduced, along with their implementations as logic-based recursive definitions.
|
Type: |
Chapter |
Creation Date: | 2015 |
Item Details: | |
License: |
http://creativecommons.org/licenses/by-nc-sa/3.0/gr |
Handle | http://hdl.handle.net/11419/784 |
Bibliographic Reference: | Sakellariou, I., Vasileiadis, N., Kefalas, P., & Stamatis, D. (2015). Infinite Terms in a variable: Prolog Lists [Chapter]. In Sakellariou, I., Vasileiadis, N., Kefalas, P., & Stamatis, D. 2015. Logic Programming Techniques [Undergraduate textbook]. Kallipos, Open Academic Editions. https://hdl.handle.net/11419/784 |
Language: |
Greek |
Consists of: |
1. Παράδειγμα Εκτέλεσης list_append/3 (append/3) 2. Κώδικας Prolog Κεφαλαίου 7 |
Is Part of: |
Logic Programming Techniques |
Publication Origin: |
Kallipos, Open Academic Editions |