BIB-VERSION:: CS-TR-v2.0
ID:: ncstrl.dartmouthcs//TR2001-404
ENTRY:: June 02, 2001
ORGANIZATION:: Dartmouth College, Computer Science
TITLE:: Efficient Compression of Generic Function Dispatch Tables
TYPE:: Technical Report (paper)
REVISION:: 1
AUTHOR:: Kidd, Eric
DATE:: June 2001
RETRIEVAL:: For a paper copy, email <reports@cs.dartmouth.edu>
RETRIEVAL:: For a paper copy, write to
       Technical Report Librarian
       Department of Computer Science
       Dartmouth College
       6211 Sudikoff Laboratory
       Hanover, NH 03755-3510
       USA
RETRIEVAL:: Compressed Postscript at http://www.cs.dartmouth.edu/reports/TR2001-404.ps.Z
RETRIEVAL:: PDF at http://www.cs.dartmouth.edu/reports/TR2001-404.pdf
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.
NOTE:: 
Senior Honors Thesis.  Advisor: Chris Hawblitzel.
END:: ncstrl.dartmouthcs//TR2001-404