Results 181 to 190 of about 33,954 (218)

Abstract data types and the development of data structures

Communications of the ACM, 1976
Abstract data types can play a significant role in the development of software that is reliable, efficient, and flexible. This paper presents and discusses the application of an algebraic technique for the specification of abstract data types. Among the examples presented is a top-down development of a symbol table for a block structured language; a ...
openaire   +6 more sources

An experience in implementing abstract data types

Software: Practice and Experience, 1981
AbstractThe abstract data type concept appears to be a useful software structuring tool. A project, called ‘Système d'Objets Conservés’, which was developed at the University of Rennes, (France), gave some experience in implementing this concept. The possibility of including abstract data type into a pre‐existing compiler is demonstrated, and desirable
M. Banatre, M. Raynal, D. Herman, A. Couvert   +3 more
openaire   +3 more sources

Constructive Abstract Data types (CAD)

ACM SIGMOD Record, 1980
1. Distinction from conventional approaches The motivation for CAD is to extend the idea of data abstraction to application programming. Conventional approaches confine themselves to operational concepts of system programming like STACK, QUEUE etc. and do not consider concepts like CONTRACT, INVOICE etc.
openaire   +2 more sources

Specification of Abstract Data Types in Modula

ACM Transactions on Programming Languages and Systems, 1980
The programming language MODULA is extended to permit the formal specification of the structure and functional capabilities of modules. This makes true hierarchical programming possible in MODULA by allowing programmers of higher level parts of a system to ignore completely the internal structure of lower level modules and to rely entirely on the ...
William F. Ogden, George W. Ernst
openaire   +3 more sources

Iteration and abstract data types

ACM SIGPLAN Notices, 1987
Numerous languages have been developed which support the creation of abstract data types. Introductions to such languages typically provide the standard stack and complex number examples to demonstrate their respective expressive power. While such examples fit neatly into the framework of these languages, only a few have attempted to deal with the ...
openaire   +2 more sources

Data structures, types and abstractions

The IEEE Computer Society's Second International Computer Software and Applications Conference, 1978. COMPSAC '78., 2005
The purpose of this paper is to explore the concepts and provide examples of data structures, data types and data abstractions The term data structures has been around for about 30 years; the term data type has been around for about 20 years; and the term data abstraction is a recent one and has been used for the last five years.
openaire   +2 more sources

Programs are abstract data types

Proceedings 16th Annual International Conference on Automated Software Engineering (ASE 2001), 2005
We propose to view programs as abstract data types and to perform program changes by applying well-defined operations on programs. The ADT view of programs goes beyond the approach of syntax-directed editors and proof-editors since it is possible to combine basic update operations into larger update programs that can be stored and reused. It is crucial
openaire   +2 more sources

Fields, Meadows and Abstract Data Types

2008
Fields and division rings are not algebras in the sense of "Universal Algebra", as inverse is not a total function. Mending the inverse by any definition of 0(-1) will not suffice to axiomatize the axiom of inverse x(-1) · x = 1, by an equation. In particular the theory of fields cannot be used for specifying the abstract data type of the rational ...
Bergstra, J., Hirschfeld, Y., Tucker, J.
openaire   +4 more sources

PVM and Abstract Data Types

2000
Parallel Virtual Machine (PVM) [16] is a software system that permits a network of heterogeneous Unix computers to be used as a single large parallel computer. Thus large computational problems can be solved by using the aggregate power of many computers.
Willi-Hans Steeb, Tan Kiat Shi, Yorick Hardy   +2 more
openaire   +2 more sources

Synthesis of Programs in Abstract Data Types

1999
In this paper we propose a method for program synthesis from constructive proofs based on a particular proof strategy, we call dischargeable set construction. This proof-strategy allows to build proofs in which active patterns (sequences of application of rules with proper computational content) can be distinguished from correctness patterns ...
Avellone A., FERRARI, MAURO, Miglioli P.
openaire   +3 more sources