Max-Planck-Institut für Informatik
max planck institut
informatik
mpii logo Minerva of the Max Planck Society
 

MPI-INF or MPI-SWS or Local Campus Event Calendar

<< Previous Entry Next Entry >> New Event Entry Edit this Entry Login to DB (to update, delete)
What and Who
Title:Types for Incremental Computational Complexity
Speaker:Deepak Garg
coming from:Max Planck Institute for Software Systems
Speakers Bio:
Event Type:Joint Lecture Series
Visibility:D1, D2, D3, D4, D5, SWS, RG1, MMCI
We use this to send out email in the morning.
Level:Public Audience
Language:English
Date, Time and Location
Date:Wednesday, 3 June 2015
Time:12:15
Duration:60 Minutes
Location:Saarbrücken
Building:E1 5
Room:002
Abstract
The area of incremental computation seeks to reduce a program's

execution time by re-using the trace of a prior execution of the
program intelligently. With recent advances, programs can be compiled
to their incremental versions automatically. However, thus far, there
is no language-level support for formally proving the time complexity
of incremental execution. Motivated by this gap, this talk presents
CostIt, a higher-order functional language equipped with a type theory
for proving asymptotic bounds on incremental computation time.  CostIt
uses type refinements to specify which parts of inputs and outputs may
change, as well as the program's incremental execution time. The talk
will cover the intuitions behind CostIt's design.

Contact
Name(s):Jennifer Müller
Phone:2900
EMail:--email address not disclosed on the web
Video Broadcast
Video Broadcast:NoTo Location:
Tags, Category, Keywords and additional notes
Note:
Attachments, File(s):

Created by:Jennifer Müller/MPI-INF, 02/02/2015 11:57 AMLast modified by:Uwe Brahm/MPII/DE, 11/24/2016 04:13 PM
  • Jennifer Müller, 06/01/2015 10:02 AM
  • Jennifer Müller, 02/02/2015 11:58 AM -- Created document.