Type error slicing in implicitly typed higher-order languages

Science of Computer Programming

Volumn 50, Issue 1-3, 2004, Pages 189-224

  Haack, Christian ^a   Wells, J B ^b  

^a DEPAUL UNIVERSITY   (United States)

^b HERIOT WATT UNIVERSITY   (United Kingdom)

Author keywords

Intersection types; Type error location; Type inference

Indexed keywords

ALGORITHMS; ERROR ANALYSIS; SET THEORY; THEOREM PROVING; TREES (MATHEMATICS);

INTERSECTION TYPES; TYPE ERROR LOCATION; TYPE INFERENCE;

COMPUTER PROGRAMMING LANGUAGES;

EID: 1442335810     PISSN: 01676423     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.scico.2004.01.004     Document Type: Conference Paper

References (38)

1. Baader F., Nipkow T. Term Rewriting and All That. 1998;Cambridge University Press, Cambridge.
2. Beaven M., Stansifer R. Explaining type errors in polymorphic languages. ACM Lett. Programming Languages Systems. 2(1):1993;17-30.
3. K.L. Bernstein, E.W. Stark, Debugging type errors (full version), Technical Report, State University of New York, Stony Brook, 1995.
4. S. Carlier, C.H. Haack, J.B. Wells, Web demo: type error slicing, 2002, http://www.macs.hw.ac.uk/ultra/compositional-analysis/type-error-slicin%g.
5. O. Chitil, Compositional explanation of types and algorithmic debugging of type errors, in: Proc. Sixth Internat. Conf. Functional Programming, ACM Press, New York, 2001.
6. V. Choppella, Unification source-tracking with application to diagnosis of type inference, Ph.D. Thesis, Indiana University, 2002.
7. V. Choppella, C.T. Haynes, Diagnosis of ill-typed programs, Technical Report 426, Indiana University, 1995.
8. L. Damas, R. Milner, Principles type schemes for functional programs, in: Conf. Record of Ninth Ann. ACM Symp. Principles of Programming Language, Albuquerque, NM, 1982.
9. L.M.M. Damas, Type assignment in programming languages, Ph.D. Thesis, University of Edinburgh, Edinburgh, Scotland, 1985.
10. T.B. Dinesh, F. Tip, A slicing-based approach for locating type errors, in: Proc. USENIX Conf. on Domain-Specific Language, Santa Barbara, California, 1997.
11. Duggan D., Bent F, Explaining type inference. Sci. Comput. Programming. 27:1996;37-83.
12. C. Flanagan, M. Flatt, S. Krishnamurthi, S. Weirich, M. Felleisen, Catching bugs in the web of program invariants, in: Proc. ACM SIGPLAN '96 Conf. on Programming Languages Design and Implementation, Philadelphia, PA, 1996.
13. B. Heeren, J. Hage, Parametric type inferencing for Helium, Technical Report UU-CS-2002-035, University Utrecht, 2002.
14. B. Heeren, J. Hage, D. Swierstra, Generalizing Hindley-Milner type inference algorithms, Technical Report UU-CS-2002-031, University Utrecht, 2002.
15. B. Heeren, J. Jeuring, D. Swiersta, P.A. Alcocer, Improving type-error messages in functional languages, Technical Report UU-CS-2002-009, University Utrecht, 2002.
16. T. Jim, What are principal typings and what are they good for? in: POPL '96 Conf. Record of POPL '96: 23rd ACM Symp. Principles of Programming Languages, 1996.
17. G.F. Johnson, J.A. Walz, A maximum flow approach to anomaly isolation in unification-based incremental type inference, in: POPL '96 Conf. Record of POPL '96: 23rd ACM Symp. Principles of Programming Languages, 1996.
18. Kannellakis P., Mairson H., Mitchell J.C. Unification and ML type reconstruction. Lassez J.-L., Plotkin G. Computational Logic: Essays in Honor of Alan Robinson. 1991;MIT Press, Cambridge, MA.
19. A.J. Kfoury, J. Tiuryn, P. Urzyczyn, ML typability if DEXPTIME compete, in: 15th Collog. Trees in Algebra and Programming, Lecture Notes in Computer Science, vol. 431, Springer, 1990. Superseded by A.J. Kfoury, J. Tiuryn, P. Urzyczyn, An analysis of ML typability, J. ACM 41(2) (1994).
20. A.J. Kfoury, J. Tiuryn, P. Urzyczyn, ML typability if DEXPTIME compete, in: 15th Collog. Trees in Algebra and Programming, Lecture Notes in Computer Science, vol. 431, Springer, 1990. Superseded by A.J. Kfoury, J. Tiuryn, P. Urzyczyn, An analysis of ML typability, J. ACM 41(2) (1994).
21. A.J. Kfoury, J. Tiuryn, P. Urzyczyn, An analysis of ML typability, J. ACM 41(2) (1994). Superseds A.J. Kfoury, J. Tiuryn, P. Urzyczyn, ML typability if DEXPTIME compete, in: 15th Collog. Trees in Algebra and Programming, Lecture Notes in Computer Science, vol. 431, Springer, 1990.
22. A.J. Kfoury, J. Tiuryn, P. Urzyczyn, An analysis of ML typability, J. ACM 41(2) (1994). Superseds A.J. Kfoury, J. Tiuryn, P. Urzyczyn, ML typability if DEXPTIME compete, in: 15th Collog. Trees in Algebra and Programming, Lecture Notes in Computer Science, vol. 431, Springer, 1990.
23. Lee O., Yi J. Proofs about a folklore let-polymorphic type inference algorithm. ACM Transactions on Programming Languages and Systems. 20(4):1998;707-723.
24. B.J. McAdam, On the unification of substitutions in type inference, in: K. Hammond, A.J.T. Davie, C. Clack, (Eds.), Implementation of Functional Language (IFL'98), Lecture Notes in Computer Science, vol. 1595, London, UK, Springer, Berlin, 1998.
25. B.J. McAdam, Generalising techniques for type debugging, in: P. Trinder, G. Michaelson, H.-W. Loidl (Eds.), Trends in Functional Programming Intellect, 2000; A collection of papers earlier presented at the 1999 Scottish Functional Programming Workshop.
26. B.J. McAdam, Generalising techniques for type debugging, in: P. Trinder, G. Michaelson, H.-W. Loidl (Eds.), Trends in Functional Programming Intellect, 2000; A collection of papers earlier presented at the 1999 Scottish Functional Programming Workshop.
27. Milner R., Tofte M., Harper R., MacQueen D.B. The Definition of Standard ML (Revised). 1997;MIT Press, Cambridge, MA.
28. Conf. Record of POPL '96: 23rd ACM Symp. Principles of Programming Languages, St Peterburg Beach, FL, 1996.
29. G.S. Port, A simple approach to finding the cause of non-unifiability, in: Proc. Fifth Internat. Conf. on Logic Programming, MIT Press, Cambridge, MA, 1988.
30. Z. Shao, A. Appel, Smartest recompilation, in: Conf. Record of 20th ACM Symp. Principles of Programming Languages, Charleston, SC, 1993.
31. P. Trinder, G. Michaelson, H.-W. Loidl (Eds.), Trends in Functional Programming Intellect, 2000; A collection of papers earlier presented at the 1999 Scottish Functional Programming Workshop.
32. P. Trinder, G. Michaelson, H.-W. Loidl (Eds.), Trends in Functional Programming Intellect, 2000; A collection of papers earlier presented at the 1999 Scottish Functional Programming Workshop.
33. M. Wand, Finding the source of type errors, in: Conf. Record of 13th Ann. ACM Symp. Principles of Programming Languages, St Peterburg Beach, FL, 1986.
34. D.A. Wolfram, Intractable unifiability problems and bractracking, in: Proc. Third Interna. Conf. on Logic Programming, Lecture Notes in Computer Science, vol. 225, 1986.
35. J. Yang, Explaining type errors by finding the source of a type conflict, in: P. Trinder, G. Michaelson, H.-W. Loidl (Eds.), Trends in Functional Programming Intellect, 2000; A collection of papers earlier presented at the 1999 Scottish Functional Programming Workshop.
36. J. Yang, Explaining type errors by finding the source of a type conflict, in: P. Trinder, G. Michaelson, H.-W. Loidl (Eds.), Trends in Functional Programming Intellect, 2000; A collection of papers earlier presented at the 1999 Scottish Functional Programming Workshop.
37. J. Yang, G. Michaelson, P. Trinder, J.B. Wells, Improved type error reporting, in: [Draft] Proc. 12th Internat. Workshop Implementation Functional Languages, Aachen, Germany, 2000; This is the unreviewed draft proceedings distributed at the workshop containing all submitted papers.
38. Yang J., Michaelson G., Trinder P. Explaining polymorphic types. Comput. J. 45(4):2002;436-452.