Results 311 to 320 of about 6,019,748 (341)
Some of the next articles are maybe not open access.
Fields, Meadows and Abstract Data Types
2008Fields 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
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 +2 more
openaire +2 more sources
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 +2 more
openaire +2 more sources
Synthesis of Programs in Abstract Data Types
1999In 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
Specification of Abstract Data Types
1985In 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
Verifying abstract data types with SNOBOL4
Software: Practice and Experience, 1982AbstractThe presentation of an abstract data type by a series of equational axioms has become an accepted specification mechanism. Verifying the correctness of such specifications has been recognized as a problem troubling their use. A means is presented for experimenting with a directly executable version of the axioms without having to choose ...
openaire +2 more sources
Abstract Data Types, Then and Now
2002Data abstraction has come to play an important role in software development. This paper presents one view of what data abstraction is, how it was viewed when it was introduced, and its long-term impact on programming.
openaire +2 more sources
1990
In chapter 5 we looked at general implementations of the ADT set. As we noticed, not all the set operations could be implemented efficiently using a single data structure. However, many applications using sets require only a limited number of set operations.
openaire +2 more sources
In chapter 5 we looked at general implementations of the ADT set. As we noticed, not all the set operations could be implemented efficiently using a single data structure. However, many applications using sets require only a limited number of set operations.
openaire +2 more sources