Formal and Practical Aspects of Implementing Abstract Data Types in the Prolog Instruction

Authors:
Bruria Haberman
Affiliations:
Department of Computer Science, Holon Institute of Technology and Department of Science Teaching, The Weizmann Institute of Science, Rehovot 76100, Israel, e-mail: bruria.haberman@weizmann.ac.il
Venue:
Informatica
Year:
2008

Citing 7
Cited 0

The art of Prolog (2nd ed.): advanced programming techniques

The art of Prolog (2nd ed.): advanced programming techniques
Logic programming based curriculum for high school students: the use of abstract data types

SIGCSE '95 Proceedings of the twenty-sixth SIGCSE technical symposium on Computer science education
Abstract data types: specifications, implementations, and applications

Abstract data types: specifications, implementations, and applications
On the criteria to be used in decomposing systems into modules

Communications of the ACM
Understanding Programming Languages

Understanding Programming Languages
Foundations of Computer Science

Foundations of Computer Science
Evolving boxes as flexible tools for teaching high-school students declarative and procedural aspects of logic programming

ISSEP'05 Proceedings of the 2005 Informatics in Secondary Schools - Evolution and Perspectives international conference on From Computer Literacy to Informatics Fundamentals

Quantified Score

Hi-index	0.00

Visualization

Abstract

Abstract data types constitute a central tool in computer science and play an important role in problem solving, knowledge representation, and programming. In this paper, formal and practical aspects of utilizing abstract data types (ADTs) are discussed in the context of logic programming when using the Prolog programming language. The approach is presented in the following stages: (a) First, alternative ways of implementing ADTs in terms of Prolog constructs are presented and partial encapsulation of ADTs in terms of grey boxes is demonstrated. (b) Next, complete encapsulation of ADTs in terms of black boxes is suggested in a way that strictly reflects the concept's formal computer science definition while taking into consideration the characteristics and constraints of the logic programming paradigm. (c) Finally, implications for instruction are discussed.