Calculating in an object-oriented iterator-view-generator framework

Authors:
Johan Larsson
Affiliations:
Stockholm University, DSV, Electrum 230, SE-164 40 Kista, Sweden
Venue:
OOPSLA '00 Addendum to the 2000 proceedings of the conference on Object-oriented programming, systems, languages, and applications (Addendum)
Year:
2000

Citing 9
Cited 0

Design patterns: elements of reusable object-oriented software

Design patterns: elements of reusable object-oriented software
Design patterns for object-oriented software development

Design patterns for object-oriented software development
Algorithm-oriented generic libraries

Software—Practice & Experience
Algebra of programming

Algebra of programming
PolyP—a polytypic programming language extension

Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Adaptive plug-and-play components for evolutionary software development

Proceedings of the 13th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
The generic graph component library

Proceedings of the 14th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Polytypic Programming

Advanced Functional Programming, Second International School-Tutorial Text
A framework for higher-order functions in C++

COOTS'95 Proceedings of the USENIX Conference on Object-Oriented Technologies on USENIX Conference on Object-Oriented Technologies (COOTS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper briefly describes research on generic object-oriented programming where we establish a set of design patterns (or idioms) which makes algorithms independent of data structures. In the framework that implements these design patterns, an algorithm is not defined directly on a data structure class, but more abstractly on a set of structural properties shared by multiple data structures.