View source for Publications:Exploring the Design Space of Higher-Order Casts

<div style='display: none'>
== Do not edit this section ==
</div>
{{PublicationSetupTemplate|Author=Jeremy Siek, Ronald Garcia, Walid Taha
|PID=396151
|Name=Siek, Jeremy (University of Colorado at Boulder, Department of Electrical & Computer Engineering, Boulder City United States );Garcia, Ronald (Rice University, Houston United States );Taha, Walid [waltah] (Rice University, Department of Computer Science, Houston United States )
|Title=Exploring the Design Space of Higher-Order Casts
|PublicationType=Conference Paper
|ContentType=Refereegranskat
|Language=eng
|Journal=
|JournalISSN=
|Status=
|Volume=
|Issue=
|HostPublication=Programming languages and systems : 18th European symposium on programming, ESOP 2009, held as part of the joint european conferences on theory and practice of software, ETAPS 2009, York, UK : proceedings
|Conference=18th European Symposium on Programming, ESOP 2009; York; 22 March 2009 through 29 March 2009
|StartPage=17
|EndPage=31
|Year=2009
|Edition=
|Pages=
|City=Berlin
|Publisher=Springer Berlin/Heidelberg
|Series=Lecture notes in computer science ; Vol. 5502
|SeriesISSN=0302-9743
|ISBN=978-364200589-3
|Urls=
|ISRN=
|DOI=http://dx.doi.org/10.1007/978-3-642-00590-9_2
|ISI=000265244700002
|PMID=
|ScopusId=2-s2.0-67650176084
|NBN=urn:nbn:se:hh:diva-14414
|LocalId=
|ArchiveNumber=
|Keywords=
|Categories=Datavetenskap (datalogi) (10201)
|ResearchSubjects=
|Projects=
|Notes=
|Abstract=<p>This paper explores the surprisingly rich design space for the simplytyped lambda calculus with casts and a dynamic type. Such a calculus is the targetintermediate language of the gradually typed lambda calculus but it is alsointeresting in its own right. In light of diverse requirements for casts, we developa modular semantic framework, based on Henglein’s Coercion Calculus, that instantiatesa number of space-efficient, blame-tracking calculi, varying in whaterrors they detect and how they assign blame. Several of the resulting calculi extendwork from the literature with either blame tracking or space efficiency, andin doing so reveal previously unknown connections. Furthermore, we introduce anew strategy for assigning blame under which casts that respect traditional subtypingare statically guaranteed to never fail. One particularly appealing outcomeof this work is a novel cast calculus that is well-suited to gradual typing.</p>
|Opponents=
|Supervisors=
|Examiners=
|Patent=
|ThesisLevel=
|Credits=
|Programme=
|Subject=
|Uppsok=
|DefencePlace=
|DefenceLanguage=
|DefenceDate=
|CreatedDate=2011-02-08
|PublicationDate=2011-02-08
|LastUpdated=2013-01-29
|diva=http://hh.diva-portal.org/smash/record.jsf?searchId=1&pid=diva2:396151}}
<div style='display: none'>

== Keep all hand-made modifications below ==
</div>{{PublicationDisplayTemplate}}