Show simple item record

Programming Languages and Systems

dc.contributor.authorWadler, Philip
dc.contributor.authorFindler, Robert Bruce
dc.contributor.editorCastagna, Giuseppe
dc.date.accessioned2010-08-25T09:14:52Z
dc.date.available2010-08-25T09:14:52Z
dc.date.issued2009
dc.identifier.isbn03029743en
dc.identifier.urihttp://www.springerlink.com/content/u02272408371p672/en
dc.identifier.urihttp://hdl.handle.net/1842/3685
dc.description.abstractWe introduce the blame calculus, which adds the notion of blame from Findler and Felleisen’s contracts to a system similar to Siek and Taha’s gradual types and Flanagan’s hybrid types. We characterise where positive and negative blame can arise by decomposing the usual notion of subtype into positive and negative subtypes, and show that these recombine to yield naive subtypes. Naive subtypes previously appeared in type systems that are unsound, but we believe this is the first time naive subtypes play a role in establishing type soundness.en
dc.language.isoenen
dc.publisherSpringer-Verlagen
dc.subjectInformaticsen
dc.subjectComputer Scienceen
dc.titleWell-Typed Programs Can’t Be Blameden
dc.typeBook Chapteren
dc.identifier.doi10.1007/978-3-642-00590-9_1en
rps.titleProgramming Languages and Systemsen
dc.extent.pageNumbers16en
dc.date.updated2010-08-25T09:14:53Z


Files in this item

This item appears in the following Collection(s)

Show simple item record