000190024 001__ 190024
000190024 005__ 20180913062124.0
000190024 037__ $$aREP_WORK
000190024 245__ $$aOn Repairing Ill-Typed Expressions
000190024 269__ $$a2013
000190024 260__ $$c2013
000190024 300__ $$a20
000190024 336__ $$aReports
000190024 520__ $$aWhen developing code, a programmer typically knows the approximate structure of the desired expression. However, often the first attempt at writing it down results in an ill-typed code fragment.  We propose an approach that automatically repairs code expressions based on the provided almost-correct code. Such a code repair can be applied in interactive scenarios like advanced code completion, as well as in automated repair in the compilation process. We formally define the problem of automatically repairing ill-typed expressions. For the certain class of problems we describe a polynomial time synthesis algorithm that returns the best well-typed expression corresponding to the given ill-typed expression. We also present a complete algorithm that takes as input an ill-typed expression and returns the desired number of type-correct expressions that are closest to the input expression. We simultaneously fix all the type errors in the expression.
000190024 6531_ $$aSoftware repair
000190024 6531_ $$aCorrections
000190024 6531_ $$aType-checking
000190024 6531_ $$aSynthesis
000190024 700__ $$0244058$$aGvero, Tihomir$$g188355
000190024 700__ $$0247191$$aKuraj, Ivan$$g200683
000190024 700__ $$0242186$$aPiskac, Ruzica$$g179111
000190024 8564_ $$s444590$$uhttps://infoscience.epfl.ch/record/190024/files/main.pdf$$yn/a$$zn/a
000190024 909C0 $$0252019$$pLARA$$xU11739
000190024 909CO $$ooai:infoscience.tind.io:190024$$pIC$$preport
000190024 917Z8 $$x188355
000190024 937__ $$aEPFL-REPORT-190024
000190024 973__ $$aEPFL
000190024 980__ $$aREPORT