Write a Blog >>
Thu 21 Jan 2016 15:10 - 15:35 at Grand Bay South - Track 2: Types, Generally or Gradually Chair(s): Tiark Rompf

Many languages are beginning to integrate dynamic and static typing. Siek and Taha offered gradual typing as an approach to this integration that provides the benefits of a coherent and full-span migration between the two disciplines. However, the literature lacks a general methodology for designing gradually typed languages. Our first contribution is to provide such a methodology insofar as the static aspects of gradual typing are concerned: deriving the gradual type system and the compilation to the cast calculus.

Based on this methodology, we present the Gradualizer, an algorithm that generates a gradual type system from a normal type system (expressed as a logic program) and generates a compiler to the cast calculus. Our algorithm handles a large class of type systems and generates systems that are correct with respect to the formal criteria of gradual typing. We also report on an implementation of the Gradualizer that takes type systems expressed in lambda-prolog and outputs their gradually typed version (and compiler to the cast calculus) in lambda-prolog.

Thu 21 Jan

14:20 - 16:00: Research Papers - Track 2: Types, Generally or Gradually at Grand Bay South
Chair(s): Tiark RompfPurdue & Oracle Labs
POPL-2016-papers14:20 - 14:45
Sheng ChenUniversity of louisiana at Lafayette, Martin ErwigOregon State University
Media Attached
POPL-2016-papers14:45 - 15:10
Ronald GarciaUniversity of British Columbia, Alison M. Clark, √Čric TanterUniversity of Chile, Chile
Link to publication Media Attached
POPL-2016-papers15:10 - 15:35
Matteo CiminiIndiana University, Jeremy G. SiekIndiana University
Media Attached
POPL-2016-papers15:35 - 16:00
Asumu TakikawaNortheastern University, Daniel FelteyNortheastern University, Ben GreenmanNortheastern University, Max New, Jan VitekNortheastern University, Matthias FelleisenNortheastern University
Pre-print Media Attached File Attached