Results 331 to 340 of about 6,254,795 (351)

Polymorphic type inference and abstract data types [PDF]

ACM Transactions on Programming Languages and Systems, 1994
Many statically typed programming languages provide an abstract data type construct, such as the module in Modula-2. However, in most of these languages, implementations of abstract data types are not first-class values. Thus, they cannot be assigned to variables, passed as function parameters, or returned as function results.
Martin Odersky, Konstantin Läufer
openaire   +1 more source

Some of the next articles are maybe not open access.

Related searches:

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

On hierarchies of abstract data types

Acta Informatica, 1983
Hierarchical 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, H. Partsch, Peter Pepper, Manfred Broy, Walter Dosch   +4 more
openaire   +2 more sources

The Algebraic Specification of Abstract Data Types

Acta Informatica, 1978
There have been many recent proposals for embedding abstract data types in programming languages. In order to reason about programs using abstract data types, it is desirable to specify their properties at an abstract level, independent of any particular implementation.
John V. Guttag, J. J. Horning
openaire   +2 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

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

Specification of Abstract Data Types

1985
In the last chapter we have introduced algebraic specifications and algebras satisfying the given equations. In general there are many different algebras for each specification SPEC. In this chapter we want to consider a distinguished algebra, the quotient term algebra T SPEC, which is generated by its operations and satisfies some ground equations E ...
Bernd Mahr, Hartmut Ehrig
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