Generating Gradual Typing Systems with the Gradualizer

Add to your list(s) Download to your calendar using vCal

• Jeremy Siek, Indiana University
• Friday 08 April 2016, 14:00-15:00
• FW26.

If you have a question about this talk, please contact Dominic Mulligan.

Many languages are beginning to integrate dynamic and static typing. Gradual typing is an approach to this integration that provides a smooth migration between the two disciplines. However, the literature lacks a general methodology for designing gradually typed languages. Towards addressing this, I present a methodology for deriving a gradual type system and compiler from a fully static type system. I also present a program, “the Gradualizer”, that makes this methodology precise by transforming a type system, expressed in lambda-prolog, into its gradual type system, also expressed in lambda-prolog. The Gradualizer currently handles simply typed languages; I demonstrate its use on many of the languages in TAPL . I conclude the talk with a overview of recent work to extend the Gradualizer to languages with quantified types.

This talk is part of the Logic and Semantics Seminar (Computer Laboratory) series.

This talk is included in these lists:

• All Talks (aka the CURE list)
• Cambridge talks
• Computing and Mathematics
• Department of Computer Science and Technology talks and seminars
• FW26
• Interested Talks
• Logic and Semantics Seminar (Computer Laboratory)
• School of Technology
• Trust & Technology Initiative - interesting events
• bld31
• yk373's list

Note that ex-directory lists are not shown.