Skalpel: A constraint-based type error slicer for Standard ML
نویسندگان
چکیده
منابع مشابه
Skalpel: A constraint-based type error slicer for Standard ML
Compilers for languages with type inference algorithms often produce confusing type error messages and give a single error location which is sometimes far away from the real location of the error. Attempts at solving this problem often (1) fail to include the multiple program points which make up the type error; (2) report tree fragments which do not correspond to any place in the user program;...
متن کاملSkalpel: A Type Error Slicer for Standard ML
Compilers for languages with type inference algorithms produce confusing type error messages and give a single error location which is often far away from the real location of the type error. Attempts at solving this problem 1) fail to include the multiple program points which make up the type error, 2) often report tree fragments which do not correspond to any place in the user program, and 3)...
متن کاملA constraint system for a SML type error slicer
Existing compilers for many languages have confusing type error messages. Type error slicing (TES) helps the programmer by isolating the part of a program contributing to a type error, but unfortunately TES was initially done for a tiny toy language. Extending TES to a full programming language is extremely challenging, and for SML we needed a number of innovations and generalisations. Some iss...
متن کاملChallenges of a type error slicer for the SML language
SML (a higher-order function-oriented imperative programming language) depends on automated inference of sophisticated type information. Existing implementations have confusing type error messages. Type error slicing gives the programmer more helpful type error information: (1) It identifies all program points that contribute to a type error rather than blaming just one point. (2) It exhibits a...
متن کاملA type-theoretic interpretation of standard ML
It has been nearly twenty years since Robin Milner introduced ML as the metalanguage of the LCF interactive theorem prover [5]. His elegant use of abstract types to ensure validity of machine-generated proofs, combined with his innovative and exible polymorphic type discipline, and supported by his rigorous proof of soundness for the language, inspired a large body of research into the type str...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 2017
ISSN: 0747-7171
DOI: 10.1016/j.jsc.2016.07.013