From types at ccs.neu.edu Mon Mar 2 04:08:03 2015 From: types at ccs.neu.edu (Benjamin L Greenman) Date: Mon, 2 Mar 2015 04:08:03 -0500 (EST) Subject: [PL-sem-jr] Today @ 12:00pm, Bisimulation and Coinduction WVH 166 Message-ID: <418563355.18763978.1425287283146.JavaMail.zimbra@zimbra.ccs.neu.edu> Weather permitting, we'll meet at noon today to talk about infinity, iPhones, and when to stop caring. We will also explore Agda's coinduction library and see how it compares to tools available in other languages. Notes are online. http://www.ccs.neu.edu/home/types/resources/notes/coinduction-tutorial/base-case.pdf From konathan at ccs.neu.edu Mon Mar 16 10:27:15 2015 From: konathan at ccs.neu.edu (Konstantinos A. Athanasiou) Date: Mon, 16 Mar 2015 10:27:15 -0400 Subject: [PL-sem-jr] First Order Logic, Monday 3/16 12.30 WVH 166 Message-ID: This talk will discuss completeness of First Order Logic. To do so, the semantics of First Order Logic and a deductive system will be introduced. -------------- next part -------------- HTML attachment scrubbed and removed From maxsnew at gmail.com Sun Mar 22 21:13:06 2015 From: maxsnew at gmail.com (Max New) Date: Sun, 22 Mar 2015 21:13:06 -0400 Subject: [PL-sem-jr] System F and Parametricity (3/22 12:30-2p WVH 166) Message-ID: How do we model polymorphism in a programming language? What kind of reasoning does polymorphism enable? We present System F, a simple language that has notions of parametric polymorphism and information hiding. We will then see the powerful reasoning tools that this language provides, generally known as Parametricity, or Theorems for Free. Associated Reading: [1] Reynolds 1983, Types, Abstraction and Parametric Polymorphism [2] Wadler 1989, Theorems for Free! [3] Pierce, Types and Programming Languages, Chapters 23 and 24 -Max Stewart New -------------- next part -------------- HTML attachment scrubbed and removed From jrslepak at ccs.neu.edu Sun Mar 29 21:04:26 2015 From: jrslepak at ccs.neu.edu (Justin R. Slepak) Date: Sun, 29 Mar 2015 21:04:26 -0400 (EDT) Subject: [PL-sem-jr] PL Seminar, 3/30: Type inference beyond Hindley-Milner Message-ID: <1943712957.26993207.1427677466109.JavaMail.zimbra@zimbra.ccs.neu.edu> The design of Hindley-Milner typing requires all quantifiers in a type to be at the outermost level, which restricts the types we can express and use. Type reconstruction for a fully implicitly-typed System F is uncomputable, but including some programmer-provided annotation makes type inference possible again. We will examine global and local inference algorithms which paved the way for more recent work in type inference. We will meet from 12:30 to 2:00 in WVH 166. --- Justin Slepak PhD student, Computer Science dept.