A new approach to abstract data types II computation on ADTs as ordinary computation

Computer Science Logic - Lecture Notes in Computer Science ◽

10.1007/bfb0023759 ◽

2005 ◽

pp. 79-95 ◽

Cited By ~ 3

Author(s):

Solomon Feferman

Keyword(s):

Abstract Data Types ◽

Data Types ◽

New Approach ◽

Abstract Data

Download Full-text

A new approach to abstract data types, I Informal development

Mathematical Structures in Computer Science ◽

10.1017/s0960129500001432 ◽

1992 ◽

Vol 2 (2) ◽

pp. 193-229 ◽

Cited By ~ 6

Author(s):

Solomon Feferman

Keyword(s):

Large Scale ◽

Design Tools ◽

Modular Construction ◽

Abstract Data Types ◽

Data Types ◽

New Approach ◽

Abstract Data ◽

Informal Development ◽

Data Objects

The concept of abstract data types (ADTs) has emerged in the last fifteen years or so as one of the major programming design tools, with the emphasis on modular construction of large-scale programe. ADTs provide the means for seperating how data objects may be used from the different ways in which they actually are, or might be, implemented. A foundation for the theory of compputation with ADTs must provide answers to such questions as: What are ADTs and how may they be specified? What does it mean to implement an ADT? How may we construct new ADTs from old ones? What does it mean to compute with ADTs? This paper is devoted to a new and rather general, constructively based approach to these questions.

Download Full-text

Towards the Temporal Approach to Abstract Data Types

Fundamenta Informaticae ◽

10.3233/fi-1988-11105 ◽

1988 ◽

Vol 11 (1) ◽

pp. 49-63

Author(s):

Andrzej Szalas

Keyword(s):

Temporal Logic ◽

Abstract Data Types ◽

Data Types ◽

First Order ◽

Abstract Data ◽

Order Completeness ◽

General Method

In this paper we deal with a well known problem of specifying abstract data types. Up to now there were many approaches to this problem. We follow the axiomatic style of specifying abstract data types (cf. e.g. [1, 2, 6, 8, 9, 10]). We apply, however, the first-order temporal logic. We introduce a notion of first-order completeness of axiomatic specifications and show a general method for obtaining first-order complete axiomatizations. Some examples illustrate the method.

Download Full-text