![[Search]](/static/images/search.gif){kind=small}
![[A-Z Index]](/static/images/az.gif){kind=small}
![[Contact]](/static/images/contact.gif){kind=small}
![[University of Cambridge]](/static/images/identifier2.gif){kind=small}
![[Talks.cam]](/static/images/talkslogosmall.gif)
Friday 08 April 2016, 14:00-15:00
Generating Gradual Typing Systems with the Gradualizer
- đ¤ Speaker: Jeremy Siek, Indiana University đ Website
- đ Date & Time: Friday 08 April 2016, 14:00 - 15:00
- đ Venue: FW26
Abstract
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.
Series This talk is part of the Logic and Semantics Seminar (Computer Laboratory) series.
Included in Lists
- All Talks (aka the CURE list)
- bld31
- Cambridge talks
- Computing and Mathematics
- Department of Computer Science and Technology talks and seminars
- FW26
- Interested Talks
- Logic and Semantics Seminar (Computer Laboratory)
- Martin's interesting talks
- School of Technology
- tcw57âs list
- Trust & Technology Initiative - interesting events
- yk373's list
- yk449
Note: Ex-directory lists are not shown.