Abstract
It has come to our attention that there is an error in the proof of Theorem 6 on page 373 of the above titled paper [1]. Specifically, the term e 0 does not type check in the system named DM as required by the theorem, because the types of the variables c and t require the type constructor τ cont, which is not present in the core DM system. To repair the theorem it is sufficient to weaken condition (2) of the theorem to require that the expression e be type checked in extensions of DM and DM+ with free type-constructor variables, which are transformed to themselves by the cbv type transformation. To repair the proof, treat the required type constructor cont as a free unary type-constructor variable declared in the context along with the ordinary variables c and t. Then, after transformation, replace all occurrences of τ cont with [τ/t]||t cont||cbv . We are grateful to Hongwei Xi for pointing out this error.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Higher-Order and Symbolic Computation (formerly LISP and Symbolic Computation)
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.