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

Displayed time zone: Guadalajara, Mexico City, Monterrey change

08:30 - 10:00
Meta for TypesMETA at Cambridge
Chair(s): Elisa Gonzalez Boix Vrije Universiteit Brussel
08:30
30m
Talk
Code Generation for Higher Inductive Types
META
Paventhan Vivekanandan Indiana University Bloomington
File Attached
09:00
30m
Talk
Recognizing heterogeneous sequences by rational type expression
META
Jim Newton EPITA / LRDE https://www.lrde.epita.fr, Didier Verna EPITA / LRDE
DOI
09:30
30m
Talk
Multiple Dispatch using Compile-Time Metaprogramming
META
Seyed Hossein Haeri Université Catholique de Louvain, Paul Keir