Talks & Seminars
Title: Optimal Reduction of Lambda Expressions
Prof. Andrea Asperti, University of Bologna, Italy
Date & Time: January 28, 2009 15:00
Venue: SIC 301, 03rd floor, ā€˜Cā€™ Block, Kanwal Rekhi Building
The goal of optimal reduction is to avoid the duplication of work during evaluation, optimizing sharing of common sub-expressions. The theory of optimal reduction was introduced by J. J. Levy in the seventies, but the problem of providing an optimal implementation remained open for over 15 years, when Lamping finally solved it by means of an innovative graph reduction technique. In this talk we give a short, informal introduction to this complex topic, stressing some important connections with Linear logic and the Geometry of Interaction.
Speaker Profile:
Andrea Asperti is full Professor of Theoretical Computer Science at the University of Bologna, Italy. His research interests are mainly focused on foundational aspects of programming languages, comprising lambda calculi, type theory, category theory, higher order logic and linear logic. He has been recently working in the field of interactive theorem proving, supervising the development of the "Matita" prover. He has been director of the Department of Computer Science and coordinated several National and European Projects. Andrea Asperti is editorial manager of the Journal of Formalized Reasoning.
List of Talks


Faculty CSE IT
Forgot Password
    [+] Sitemap     Feedback