[PL-sem-jr] Local type inference (5/25, WVH 366, 11:00)

Brian T. Lachance blachanc at ccs.neu.edu
Mon May 25 08:53:53 EDT 2015


Two things to add:

The last link is wrong; it should be: http://repository.upenn.edu/cgi/viewcontent.cgi?article=1185&context=cis_reports
Also, sorry for the wacky formatting in the HTML version of the email.

----- Original Message -----
From: "Brian LaChance" <blachanc at ccs.neu.edu>
To: pl-sem-jr at lists.ccs.neu.edu
Sent: Monday, May 25, 2015 8:37:30 AM
Subject: [PL-sem-jr] Local type inference (5/25, WVH 366, 11:00)

Local type inference is an inference system that allows programmers to leave out explicit type information in places that "make sense." Duplicate code is rarely pleasant, and type inference is one way to avoid mandatory duplication. We'll cover three aspects of this technique: its motivation, its core technical details, and some of its limitations. 


References 
http://www.cis.upenn.edu/~bcpierce/papers/lti.pdf 
http://dl.acm.org/citation.cfm?id=345100 
The ACM DL has the TOPLAS version, which has extra material that we won't get into today. 

http://repository.upenn.edu/cgi/viewcontent.cgi?article=1185 
This is an extended evaluation of local type inference. 



_______________________________________________
Pl-sem-jr mailing list
Pl-sem-jr at lists.ccs.neu.edu
https://lists.ccs.neu.edu/bin/listinfo/pl-sem-jr



More information about the Pl-sem-jr mailing list