[Colloq] Thesis Defense: Flexible Binding-Safe Programming | Speaker: Paul Stansifer |

[Walker, Lashauna]

Title: Flexible Binding-Safe Programming
Speaker: Paul Stansifer
Date: 4/6/16    Time: 11:45am    Location: 366 WVH

Abstract: Current nominal systems for safely manipulating values with names, such as Pure FreshML, only support simple binding structures for those names. As a result, few tools exist to safely manipulate code in those languages for which name problems are the most challenging. We address this by applying by applying those nominal techniques to a richer specification system, inspired by attribute grammars. Our system has the expressive power of David Herman's λm, but is a full-fledged programming system for any kind of metaprogramming.

We demonstrate our system first by implementing it in a core calculus we call Romeo, and which we prove takes α-equivalent inputs to α-equivalent outputs. Then we use the same mechanics in PLT Redex to provide similar safety guarantees in that context, and demonstrate the ease of retrofitting existing Redex
models to take advantage of our binding specifications.

Committee:
Mitch Wand
Robby Findler
Amal Ahmed
Olin Shivers

Thank You.

LaShauna Walker
Events and Administrative Specialist
College of Computer and Information Science
Northeastern University
617-373-2763
Facebook<https://www.facebook.com/ccisatnu?ref=hl> | Instagram<https://instagram.com/ccisatnu/> | LinkedIn<https://www.linkedin.com/groups/Northeastern-University-College-Computer-Information-1943637?gid=1943637&mostPopular=&trk=tyah&trkInfo=idx%3A1-1-1%2CtarId%3A1426606862845%2Ctas%3ANortheastern+University+College+of+Com> | Twitter<https://twitter.com/CCISatNU>