David R. Musser and Alexander A. Stepanov. A library of generic algorithms in Ada. In Using Ada (1987.  Home/Search   Document Not in Database   Summary   Related Articles   Check

No context found.

D. R. Musser and A. A. Stepanov, `A library of generic algorithms in Ada', Proc. 1987 ACM SIGAda International Conference, Boston, December 1987, pp. 216--225.

No context found.

D. R. Musser and A. A. Stepanov, "A Library of Generic Algorithms in Ada," Proc. of 1987 ACM SIGAda International Conference, Boston, December, 1987.

....and because the container representations and algorithms can be combined without the overhead of subprogram calls (by using inline declarations and templates and or macros) 1. 2 The algorithm oriented approach in C We demonstrated an earlier version of the algorithm oriented approach in Ada in [7, 8, 9]. In this paper, we illustrate the approach with a number of generic algorithms implemented in C . These algorithms are part of a library of operations on sequences of values, using array, linked list, or hybrid array linked representations of sequences, including partitioning, merging, and ....

D. R. Musser and A. A. Stepanov, "A Library of Generic Algorithms in Ada," Proc. of 1987 ACM SIGAda International Conference, Boston, December, 1987.

....are not supported, such as procedures with second order procedure parameters (e.g. make tournament sort ) other techniques not provided in Scheme become available via generic packages. These techniques are particularly suitable as the basis for development of generic software libraries [7]. Acknowledgements. Earlier drafts of this paper were written while the second author was at General Electric Research and Development Center, Schenectady, NY. We are grateful to Leon Levy and Martin Shannon of AT T Bell Labs for insightful comments and suggestions. ....

D.R. Musser and A.A. Stepanov, "A Library of Generic Algorithms in Ada," Proc. ACM SIGAda Conference, Boston, December 9-11, 1987.

....and verify such abstractions. We present the issues relating to generic algorithms mainly in terms of a single example, a Partition algorithm such as is used in quicksort, but we will also allude to a large collection of examples we have developed in Ada as part of an Ada Generic Library project [6], 7] The structure of the library is designed to achieve a much higher degree of modularity than has been found in previous libraries, by completely separating data representations from algorithmic and other data abstraction issues. Some of our goals are in common with the parameterized ....

....a family of stack data abstractions, whereas the usual programming techniques give only a single data abstraction. The following sections give more detailed examples of algorithmic abstractions. Further discussion and examples of data, structural, and representational abstraction may be found in [6]. 3 Algorithmic Abstractions As an example of generic algorithms, we consider the sequence algorithmic abstraction: diverse data abstractions which can be sequentially traversed. These data abstractions belong to numerous different families: singly linked lists, doubly linked lists, vectors, ....

D. R. Musser and A. A. Stepanov, "A Library of Generic Algorithms in Ada," Proc. of 1987 ACM SIGAda International Conference, Boston, December, 1987.

No context found.

D. R. Musser and A. A. Stepanov, "A Library of Generic Algorithms in Ada," Proc. of 1987 ACM SIGAda International Conference, Boston, December, 1987.

No context found.

David R. Musser and Alexander A. Stepanov. A library of generic algorithms in Ada. In Using Ada (1987.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC