Graeme E. Moss and Colin Runciman. Auburn: A kit for benchmarking functional data structures. Lecture Notes in Computer Science, 1467:141--160, 1998. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Automated Benchmarking of Functional Data Structures - Moss, Runciman (1999) (2 citations) Self-citation (Moss Runciman) (Correct)
....applying head to the list of node n 3, giving the second element. Every other element of the list is removed in the same way, till node 3n represents the last element, and node 3n 1 represents the empty list. This is how Sum sums the list of n integers. The authors introduced such a graph in [MR97], given the name datatype usage graph, or dug. The definition was informal in [MR97] but we shall now give a brief formal definition. To abstract over many competing data structures providing similar operations, we insist on a dug describing the use of an adt. The same dug can then describe the ....
....of the list is removed in the same way, till node 3n represents the last element, and node 3n 1 represents the empty list. This is how Sum sums the list of n integers. The authors introduced such a graph in [MR97] given the name datatype usage graph, or dug. The definition was informal in [MR97] but we shall now give a brief formal definition. To abstract over many competing data structures providing similar operations, we insist on a dug describing the use of an adt. The same dug can then describe the use of any implementation of that adt. We restrict an adt to being simple. Definition ....
[Article contains additional citation context not shown here]
Graeme E. Moss and Colin Runciman. Auburn: A kit for benchmarking functional data structures. In Proceedings of IFL'97, volume 1467 of LNCS, pages 141--160, September 1997.
Exploring Datatype Usage Space - Moss, Runciman (1998) Self-citation (Moss Runciman) (Correct)
....i at any time is obtained by solving pP = p, where p is the row vector with p i at column i. The vector p gives the overall weights ratio. However, the circumstances under which this equation is solvable are not met in general. This method needs more examination. 6 Related Work We wrote a paper [MR97] benchmarking queues using the basic profile of Section 3 with the build and fall method of Section 5.1. Most papers presenting functional data structures omit thorough benchmarking results. Notable exceptions include Okasaki [Oka95] and O Neill [OB97] Our work will eventually appear in [Mos99] ....
Graeme E. Moss and Colin Runciman. Auburn: A kit for benchmarking functional data structures. In Proceedings of IFL '97, volume 1467 of Lecture Notes in Computer Science, pages 141--160. Springer-Verlag, 1997.
Efficient Data Structures in a Lazy Functional Language - Holters (2003) (Correct)
No context found.
Graeme E. Moss and Colin Runciman. Auburn: A kit for benchmarking functional data structures. Lecture Notes in Computer Science, 1467:141--160, 1998.
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