TY - CHAP
T1 - Formalizing Soundness of Contextual Effects
T2 - Theorem Proving in Higher Order LogicsTheorem Proving in Higher Order Logics
Y1 - 2008
A1 - Pratikakis,Polyvios
A1 - Foster, Jeffrey S.
A1 - Hicks, Michael W.
A1 - Neamtiu,Iulian
ED - Mohamed,Otmane
ED - Muñoz,César
ED - Tahar,Sofiène
AB - A contextual effect system generalizes standard type and effect systems: where a standard effect system computes the effect of an expression e , a contextual effect system additionally computes the prior and future effect of e , which characterize the behavior of computation prior to and following, respectively, the evaluation of e . This paper describes the formalization and proof of soundness of contextual effects, which we mechanized using the Coq proof assistant. Contextual effect soundness is an unusual property because the prior and future effect of a term e depends not on e itself (or its evaluation), but rather on the evaluation of the context in which e appears. Therefore, to state and prove soundness we must “match up” a subterm in the original typing derivation with the possibly-many evaluations of that subterm during the evaluation of the program, in a way that is robust under substitution. We do this using a novel typed operational semantics. We conjecture that our approach could prove useful for reasoning about other properties of derivations that rely on the context in which that derivation appears.
JA - Theorem Proving in Higher Order LogicsTheorem Proving in Higher Order Logics
T3 - Lecture Notes in Computer Science
PB - Springer Berlin / Heidelberg
VL - 5170
SN - 978-3-540-71065-3
UR - http://dx.doi.org/10.1007/978-3-540-71067-7_22
ER -