Venkatesh Choppella, Christopher T. Haynes  Home/Search
Context Related
| indiana.edu/pub/techreport...TR426.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: indiana.edu/ftp/techrepor...index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: A framework, based on syntactic and type constraints, is provided for defining program slices that contribute to a given type error or similar syntactic property. We specify soundness, minimality and completeness criterion for these slices and outline an algorithm for their lazy generation. 1 Introduction Error diagnosis in current type-reconstruction algorithms either misses information that is relevant, presents irrelevant details, or both. We propose a general framework that describes a... (Update)
Context of citations to this paper: More
.... that from a type error message it is often hard to deduce the actual cause of the error and understand it [1, 2, 3, 4, 9, 10, 17, 19, 20, 21, 22, 23, 24, 25, 26]. Consider the following tiny Haskell program [16] f xs ys = map toUpper) xs ys Permission to make...
...construct a type graph from the collected constraints. Other techniques have been proposed to store type information in a graph [GVS96, Cho95]. However, these two systems cannot handle polymorphism. The graph presented by McAdam [McA00] can contain let expressions, but the...
Cited by: More
Type Error Slicing in Implicitly Typed Higher-Order Languages - Haack, Wells (2004) (Correct)
Improving Polymorphic Type Explanations - Yang (2001) (Correct)
Generalizing Hindley-Milner Type Inference Algorithms - Heeren, Hage, Swierstra (2002) (Correct)
Active bibliography (related documents): More All
0.6: Explaining Type Inference - Duggan, Bent (1995) (Correct)
0.1: Interactive Type Debugging - McAdam (1998) (Correct)
0.1: Repairing Type Errors in Functional Programs - McAdam (2001) (Correct)
Similar documents based on text: More All
0.4: Type Debugging in Functional Languages - McKenzie, Wyber (Correct)
0.3: Unchecked Exceptions can be Strictly More Powerful than Call/CC - Lillibridge (1996) (Correct)
0.2: Polymorphic Type Reconstruction Using Type Equations - Choppella (2003) (Correct)
Related documents from co-citation: More All
5: Debugging type errors - Bernstein, Stark - 1995
4: Explaining type errors in polymorphic languages - Beaven, Stansifer - 1994
4: Generalising Techniques for Type Debugging - McAdam - 2000
BibTeX entry: (Update)
V. Choppella and C. T. Haynes. Diagnosis of ill-typed programs. TR426, Indiana University, 1995. http://citeseer.ist.psu.edu/choppella95diagnosis.html More
@misc{ choppella95diagnosis,
author = "V. Choppella and C. Haynes",
title = "Diagnosis of ill-typed programs",
text = "V. Choppella and C. T. Haynes. Diagnosis of ill-typed programs. TR426,
Indiana University, 1995.",
year = "1995",
url = "citeseer.ist.psu.edu/choppella95diagnosis.html" }
Citations (may not include all citations):809 A theory of type polymorphism in programming (context) - Milner - 1978 DBLP
638 Partial Evaluation and Automatic Program Generation (context) - Jones, Gomard et al. - 1992 ACM
458 A theory of diagnosis from first principles (context) - Reiter - 1987 ACM DBLP
170 ACM Transactions on Programming Languages and Systems (context) - Martelli, Montanari - 1982
166 Unification revisited (context) - Lassez, Maher et al. - 1988 ACM DBLP
139 Type systems for programming languages (context) - Mitchell - 1991 ACM DBLP
126 Type inference with polymorphic recursion - Henglein - 1993 ACM DBLP
82 Journal of Computer and System Sciences (context) - Paterson, Wegman - 1978
64 Efficient type inference for higher-order binding-time analy.. - Henglein - 1991 ACM DBLP
59 Basic polymorphic typechecking - Cardelli - 1987 ACM DBLP
55 A simple algorithm and proof for type inference (context) - Wand - 1987
45 Finding the source of type errors (context) - Wand - 1986 ACM DBLP
35 Partial type inference for untyped functional programs (context) - Gomard - 1990 ACM DBLP
30 Explaining type errors in polymorphic languages - Beaven, Stansifer - 1994 ACM
22 A maximum-flow approach to anomaly isolation in unification-.. (context) - Johnson, Walz - 1986 ACM DBLP
15 An explanation based polymorphic type checker for Standard M.. (context) - Soosaipillai - 1990
13 Principal type-schemes for functional languages (context) - Damas, Milner - 1982
4 A simple approach to finding the cause of non-unifiability (context) - Port - 1988 DBLP
2 Extending Attribute Grammars and Type Inference Algorithms (context) - Walz - 1989
1 Support tool and strategy for type error correction with pol.. (context) - Maruyama, Matsuyama et al. - 1992
1 Explaining type reconstruction (context) - Duggan, Ophel et al. - 1994
1 Type-based diagnostic program analysis (context) - Choppella - 1995
1 IEEE Transactins on Software Engineering (context) - Weiser - 1984
Documents on the same site (http://www.cs.indiana.edu/ftp/techreports/index.html): More
Topological Reasoning and The Logic of Knowledge - Dabrowski, Moss, Parikh (Correct)
Merging Interactive, Modular, And Object-Oriented Programming - Tung (Correct)
First-Class Extents - Shinn-Der Lee (1992) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC