Type error slicing in implicitly typed higher-order languages

Christian Haack; J. B. Wells

doi:10.1016/j.scico.2004.01.004

Type error slicing in implicitly typed higher-order languages

Christian Haack, J. B. Wells

Research output: Contribution to journal › Article › peer-review

93 Citations (Scopus)

Abstract

Previous methods have generally identified the location of a type error as a particular program point or the program subtree rooted at that point. We present a new approach that identifies the location of a type error as a set of program points (a slice) all of which are necessary for the type error. We identify the criteria of completeness and minimality for type error slices. We discuss the advantages of complete and minimal type error slices over previous methods of presenting type errors. We present and prove the correctness of algorithms for finding complete and minimal type error slices for implicitly typed higher-order languages like Standard ML. © 2004 Published by Elsevier B.V.

Original language	English
Pages (from-to)	189-224
Number of pages	36
Journal	Science of Computer Programming
Volume	50
Issue number	1-3
DOIs	https://doi.org/10.1016/j.scico.2004.01.004
Publication status	Published - Mar 2004

Keywords

Intersection types
Type error location
Type inference

Access to Document

10.1016/j.scico.2004.01.004

Cite this

@article{33052df782624d78ab0c169f5b5aacc2,

title = "Type error slicing in implicitly typed higher-order languages",

abstract = "Previous methods have generally identified the location of a type error as a particular program point or the program subtree rooted at that point. We present a new approach that identifies the location of a type error as a set of program points (a slice) all of which are necessary for the type error. We identify the criteria of completeness and minimality for type error slices. We discuss the advantages of complete and minimal type error slices over previous methods of presenting type errors. We present and prove the correctness of algorithms for finding complete and minimal type error slices for implicitly typed higher-order languages like Standard ML. {\textcopyright} 2004 Published by Elsevier B.V.",

keywords = "Intersection types, Type error location, Type inference",

author = "Christian Haack and Wells, {J. B.}",

year = "2004",

month = mar,

doi = "10.1016/j.scico.2004.01.004",

language = "English",

volume = "50",

pages = "189--224",

journal = "Science of Computer Programming",

publisher = "Elsevier",

number = "1-3",

}

TY - JOUR

T1 - Type error slicing in implicitly typed higher-order languages

AU - Haack, Christian

AU - Wells, J. B.

PY - 2004/3

Y1 - 2004/3

N2 - Previous methods have generally identified the location of a type error as a particular program point or the program subtree rooted at that point. We present a new approach that identifies the location of a type error as a set of program points (a slice) all of which are necessary for the type error. We identify the criteria of completeness and minimality for type error slices. We discuss the advantages of complete and minimal type error slices over previous methods of presenting type errors. We present and prove the correctness of algorithms for finding complete and minimal type error slices for implicitly typed higher-order languages like Standard ML. © 2004 Published by Elsevier B.V.

AB - Previous methods have generally identified the location of a type error as a particular program point or the program subtree rooted at that point. We present a new approach that identifies the location of a type error as a set of program points (a slice) all of which are necessary for the type error. We identify the criteria of completeness and minimality for type error slices. We discuss the advantages of complete and minimal type error slices over previous methods of presenting type errors. We present and prove the correctness of algorithms for finding complete and minimal type error slices for implicitly typed higher-order languages like Standard ML. © 2004 Published by Elsevier B.V.

KW - Intersection types

KW - Type error location

KW - Type inference

UR - http://www.scopus.com/inward/record.url?scp=1442335810&partnerID=8YFLogxK

U2 - 10.1016/j.scico.2004.01.004

DO - 10.1016/j.scico.2004.01.004

M3 - Article

VL - 50

SP - 189

EP - 224

JO - Science of Computer Programming

JF - Science of Computer Programming

IS - 1-3

ER -

Type error slicing in implicitly typed higher-order languages

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this