Type error slicing in implicitly typed higher-order languages

Authors:
Christian Haack;J. B. Wells
Affiliations:
Heriot-Watt University;Heriot-Watt University
Venue:
ESOP'03 Proceedings of the 12th European conference on Programming
Year:
2003

Citing 15
Cited 25

Smartest recompilation

POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
An analysis of ML typability

Journal of the ACM (JACM)
Explaining type errors in polymorphic languages

ACM Letters on Programming Languages and Systems (LOPLAS)
Explaining type inference

Science of Computer Programming
Catching bugs in the web of program invariants

PLDI '96 Proceedings of the ACM SIGPLAN 1996 conference on Programming language design and implementation
What are principal typings and what are they good for?

POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Proofs about a folklore let-polymorphic type inference algorithm

ACM Transactions on Programming Languages and Systems (TOPLAS)
Compositional explanation of types and algorithmic debugging of type errors

Proceedings of the sixth ACM SIGPLAN international conference on Functional programming
Finding the source of type errors

POPL '86 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A maximum-flow approach to anomaly isolation in unification-based incremental type inference

POPL '86 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
The Definition of Standard ML

The Definition of Standard ML
Principal type-schemes for functional programs

POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Intractable Unifiability Problems and Backtracking

Proceedings of the Third International Conference on Logic Programming
Unification source-tracking with application to diagnosis of type inference

Unification source-tracking with application to diagnosis of type inference
A slicing-based approach for locating type errors

DSL'97 Proceedings of the Conference on Domain-Specific Languages on Conference on Domain-Specific Languages (DSL), 1997

Helium, for learning Haskell

Haskell '03 Proceedings of the 2003 ACM SIGPLAN workshop on Haskell
Interactive type debugging in Haskell

Haskell '03 Proceedings of the 2003 ACM SIGPLAN workshop on Haskell
Scripting the type inference process

ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
Discriminative sum types locate the source of type errors

ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
Type inference with expansion variables and intersection types in system E and an exact correspondence with β-reduction

PPDP '04 Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming
Improving type error diagnosis

Haskell '04 Proceedings of the 2004 ACM SIGPLAN workshop on Haskell
Source-tracking unification

Information and Computation
Type inference against races

Science of Computer Programming
An extended comparative study of language support for generic programming

Journal of Functional Programming
Types for atomicity: Static checking and inference for Java

ACM Transactions on Programming Languages and Systems (TOPLAS)
A type system equivalent to a model checker

ACM Transactions on Programming Languages and Systems (TOPLAS)
Dependent type inference with interpolants

PPDP '09 Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming
Programming Examples Needing Polymorphic Recursion

Electronic Notes in Theoretical Computer Science (ENTCS)
Expansion: the Crucial Mechanism for Type Inference with Intersection Types: A Survey and Explanation

Electronic Notes in Theoretical Computer Science (ENTCS)
Source-tracking unification

Information and Computation
Program generation and components

FMCO'04 Proceedings of the Third international conference on Formal Methods for Components and Objects
A type system equivalent to a model checker

ESOP'05 Proceedings of the 14th European conference on Programming Languages and Systems
Discovery of minimal unsatisfiable subsets of constraints using hitting set dualization

PADL'05 Proceedings of the 7th international conference on Practical Aspects of Declarative Languages
Type class directives

PADL'05 Proceedings of the 7th international conference on Practical Aspects of Declarative Languages
Type processing by constraint reasoning

APLAS'06 Proceedings of the 4th Asian conference on Programming Languages and Systems
Automated error diagnosis using abductive inference

Proceedings of the 33rd ACM SIGPLAN conference on Programming Language Design and Implementation
Trends in Trends in Functional Programming 1999/2000 versus 2007/2008

Higher-Order and Symbolic Computation
Improving type error messages for generic Java

Higher-Order and Symbolic Computation
Constraint-Free type error slicing

TFP'11 Proceedings of the 12th international conference on Trends in Functional Programming
Counter-factual typing for debugging type errors

Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages

Quantified Score

Hi-index	0.00

Visualization

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 describe algorithms for finding minimal type error slices for implicitly typed higher-order languages like Standard ML.