Type error slicing in implicitly typed higher-order languages

Authors:
Christian Haack;J. B. Wells
Affiliations:
DePaul University, Chicago;Heriot-Watt University, Edinburgh, UK
Venue:
Science of Computer Programming - Special issue on 12th European symposium on programming (ESOP 2003)
Year:
2004

Citing 16
Cited 21

Intractable unifiability problems and backtracking

Proceedings on Third international conference on logic programming
Smartest recompilation

POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
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
Term rewriting and all that

Term rewriting and all that
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
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
Explaining Type Errors by Finding the Source of a Type Conflict

SFP '99 Selected papers from the 1st Scottish Functional Programming Workshop (SFP99)
Generalising Techniques for Type Debugging

SFP '99 Selected papers from the 1st Scottish Functional Programming Workshop (SFP99)
ML Typability is DEXTIME-Complete

CAAP '90 Proceedings of the 15th Colloquium on Trees in Algebra and Programming
Unification source-tracking with application to diagnosis of type inference

Unification source-tracking with application to diagnosis of type inference

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
Modular set-based analysis from contracts

Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Seminal: searching for ML type-error messages

Proceedings of the 2006 workshop on ML
Searching for type-error messages

Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation
Types and higher-order recursion schemes for verification of higher-order programs

Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Path projection for user-centered static analysis tools

Proceedings of the 8th ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering
Error Reporting Logic

ASE '08 Proceedings of the 2008 23rd IEEE/ACM International Conference on Automated Software Engineering
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)
Generating compiler optimizations from proofs

Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Iterator types

FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
A rewriting semantics for type inference

ESOP'07 Proceedings of the 16th European conference on Programming
Type inference and strong static type checking for Promela

Science of Computer Programming
Linearity and iterator types for Gödel's System

Higher-Order and Symbolic Computation
An approach to completing variable names for implicitly typed functional languages

PEPM '12 Proceedings of the ACM SIGPLAN 2012 workshop on Partial evaluation and program manipulation
Program generation and components

FMCO'04 Proceedings of the Third international conference on Formal Methods for Components and Objects
Explaining ML type errors by data flows

IFL'04 Proceedings of the 16th international conference on Implementation and Application of Functional Languages
Equality proofs and deferred type errors: a compiler pearl

Proceedings of the 17th ACM SIGPLAN international conference on Functional programming
Security type error diagnosis for higher-order, polymorphic languages

PEPM '13 Proceedings of the ACM SIGPLAN 2013 workshop on Partial evaluation and program manipulation
Precise explanation of success typing errors

PEPM '13 Proceedings of the ACM SIGPLAN 2013 workshop on Partial evaluation and program manipulation
Toward general diagnosis of static 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 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.