Efficient Compression of Generic Function Dispatch Tables

Authors:
Eric Kidd
Affiliations:
-
Venue:
Efficient Compression of Generic Function Dispatch Tables
Year:
2001

Citing 0
Cited 3

Fast algorithm for creating space efficient dispatching tables with application to multi-dispatching

OOPSLA '02 Proceedings of the 17th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Multiple dispatch in practice

Proceedings of the 23rd ACM SIGPLAN conference on Object-oriented programming systems languages and applications
Extending Dylan's type system for better type inference and error detection

Proceedings of the 2010 international conference on Lisp

Quantified Score

Hi-index	0.00

Visualization

Abstract

A generic function is similar to an overloaded operator, but provides a way to select an appropriate behavior at run-time instead of compile-time. Dujardin and colleagues have proposed an algorithm for building and compressing generic function dispatch tables. We present several modifications to their algorithm, including an improvement to Pseudo-Closest-Poles and two new algorithms for compressing pole tables. The two new compression algorithms are simple and fast, and one produces smaller output than the original.