Sharing graphs are a new technique for efficient implementationof functional languages. The goal is avoiding any duplication of work during reduction, optimizing sharing.
The interest of this technique is both practical andtheoretical.
The study of optimal reduction has provided important insights andconnections between linear logic, control structures, context semantics and the geometry of interaction, intensional
semantics, withhope of applying its ideas as well in the area of full ab straction.
Moreover, recent complexity results seem to open interestingresearch perspectives on the definition of a good "intrinsic" complexity measure for the reduction cost of functional expressions.
Mar. 16:00-18:00 Mer. 11:00-13:00 Gio. 11:00-13:00 Mer. 11:00-13:00 Gio. 11:00-13:00 Ven. 11:00-13:00 Lun 11:00-13:00 14:30-16:30 Mar 9:15-11:15 13:30-15:30 Mer 10:00-12:00 14:00-16:00 Gio 9:30-12:30 (Sala Multimediale)