Computer Science Foundations

Organizers: Marek Zaionc
Usual time and place: Wednesday, 12:15-14:00, room 0086
event-date: 12.01.2011
Speaker: Tomasz Krakowiak
Title of the talk: Complexity of Type Inference
(paper by Jurek Tyszkiewicz)
Abstract: The main result is the proof of PTIME-completeness of the type reconstruction problem for simply typed lambda calculus.