Mon 5 Nov 2018 09:00 - 09:30 at Cambridge - Meta for Types Chair(s): Elisa Gonzalez Boix

We summarize a technique for writing functions which recognize types of heterogeneous sequences in Common Lisp. The technique employs sequence recognition functions, generated at compile time, and evaluated at run-time. The technique we demonstrate extends the Common Lisp type system, exploiting the theory of rational languages, Binary Decision Diagrams, and the Turing complete macro facility of Common Lisp. The resulting system uses meta-programming to move an $\Omega(2^n)$ complexity operation from run- time to a compile-time operation, leaving a highly optimized $\Theta(n)$ complexity operation for run-time.

Mon 5 Nov
Times are displayed in time zone: (GMT-05:00) Guadalajara, Mexico City, Monterrey change

08:30 - 10:00: Meta - Meta for Types at Cambridge
Chair(s): Elisa Gonzalez BoixVrije Universiteit Brussel
meta-201808:30 - 09:00
Paventhan VivekanandanIndiana University Bloomington
File Attached
meta-201809:00 - 09:30
Jim NewtonEPITA / LRDE, Didier VernaEPITA / LRDE
meta-201809:30 - 10:00
Seyed Hossein HaeriUniversité Catholique de Louvain, Paul Keir