Results 301 to 310 of about 8,638,029 (373)
Programming with abstract data types [PDF]
ACM SIGPLAN Notices, 1974 The motivation behind the work in very-high-level languages is to ease the programming task by providing the programmer with a language containing primitives or abstractions suitable to his problem area. The programmer is then able to spend his effort in the right place; he concentrates on solving his problem, and the resulting program will be more ...
LiskovBarbara, ZillesStephen
openaire +3 more sources
, 2011 Modern programming languages provide facilities for separating public and private aspects of interfaces. While C does not explicitly provide facilities, there is a way of organizing code that yields this separation. Data types defined in this way are called abstract data types, or ADTs for short.
Aaron R. Bradley
openaire +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Acta Informatica, 2006
The use of abstraction in the context of abstract data types, is investigated. Properties to be checked are formulas in a first order logic under Kleene's 3-valued interpretation. Abstractions are defined as pairs consisting of a congruence and a predicate interpretation. Three types of abstractions are considered,??, ?? and ?0,1?, and for each of them
Ţiplea, Ferucio Laurenţiu +1 more
openaire +3 more sources
The use of abstraction in the context of abstract data types, is investigated. Properties to be checked are formulas in a first order logic under Kleene's 3-valued interpretation. Abstractions are defined as pairs consisting of a congruence and a predicate interpretation. Three types of abstractions are considered,??, ?? and ?0,1?, and for each of them
Ţiplea, Ferucio Laurenţiu +1 more
openaire +3 more sources
Continuous Abstract Data Types
Fundamenta Informaticae, 1986The basic definitions and the mathematical properties connected with the notion of a continuous abstract data type are given. The existence of initial and terminal models for algebraic hierarchical specifications using ground inequalities is proven. The inequalities may contain universally quantified variables and may be conditional. Three examples for
Martin Wirsing, Andrzej Tarlecki
openaire +3 more sources
On hierarchies of abstract data types
Acta Informatica, 1983Hierarchical abstract data types are algebraic specifications of computation structures where certain sorts, function symbols, and axioms are designated as being primitive. On hierarchical abstract data types additional structure is imposed. An algebraic specification is thus decomposed into several well-separated levels, such that both the ...
Martin Wirsing +4 more
openaire +2 more sources
Typing abstract data types [PDF]
, 1995 The purpose of this paper is threefold. First, we describe some basic ideas of constructive type theory, with emphasis on their value for specification. Second, we demonstrate the use of type theory as a specification language. This is done by means of a detailed example, namely, the specification of an abstract data type (ADT) for multisets.
openaire +1 more source