Well-Typed Programs Can't Be Blamed

Philip Wadler, Robert Bruce Findler

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract / Description of output

We 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.
Original languageEnglish
Title of host publicationProgramming Languages and Systems
Subtitle of host publication18th European Symposium on Programming, ESOP 2009, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009, York, UK, March 22-29, 2009. Proceedings
EditorsGiuseppe Castagna
PublisherSpringer
Pages1-16
Number of pages16
ISBN (Print)978-3-642-00589-3
DOIs
Publication statusPublished - 2009

Publication series

NameLecture Notes in Computer Science
PublisherSpringer Berlin / Heidelberg
Volume5502
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Fingerprint

Dive into the research topics of 'Well-Typed Programs Can't Be Blamed'. Together they form a unique fingerprint.

Cite this