Subject: DynLangSem, Fri. Aug. 3, 2-3pm, 8ai, Eric Kidd
From: Gregory T. Sullivan (gregs@ai.mit.edu)
Date: Mon Jul 30 2001 - 10:05:39 EDT
Dynamic Languages Seminar
http://www.ai.mit.edu/projects/dynlangs/
Who: Eric Kidd
When: Friday, Aug. 3, 2001, 2-3pm. Refreshments from 1:45pm to 2.
What: Efficient Compression of Generic Function Dispatch Tables
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.
I 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.
Location: 8th floor play room of MIT building NE43, aka 545
Technology Square, aka 200 Technology Square.
Directions: http://www.ai.mit.edu/visiting/directions.shtml
Hope to see you there!
-- Greg gregs@ai.mit.edu (617)253-5807 Sullivan http://www.ai.mit.edu/~gregs/
This archive was generated by hypermail 2b28 : Mon Jul 30 2001 - 10:58:09 EDT