Vous pouvez vous abonner à nos annonces de séminaires
		    http://gallium.inria.fr/seminaires/

			     S E M I N A I R E
			   __
			  / _`  _   /  /  o
			 /   ) __) /  /  / /  / /\/|
			(___/ (_/ (_ (_ / (__/ /   |

			     I N R I A - Paris
                 2 rue Simone Iff (ou: 41 rue du Charolais)
                            Salle C334, bâtiment C

                           MERCREDI 21 juin, 10h30

                                 ------------
                                 Olin Shivers
                                 ------------

                           Northeastern University

                          =========================
                          No-Brainer CPS Conversion
                          =========================

[Please note the unusual time and place: this is TOMORROW in room C334.]

Algorithms that convert direct-style lambda-calculus terms to their equivalent
terms in continuation-passing style (CPS) typically introduce so-called
"administrative redexes:" useless artifacts of the conversion that must be
cleaned up by a subsequent pass over the result to reduce them away. I
present a simple, linear-time algorithm for CPS conversion that introduces no
administrative redexes. In fact, the output term is a normal form in a
reduction system that generalizes the notion of "administrative redexes" to
what we call "no-brainer redexes", that is, redexes whose reduction shrinks the
size of the term.