Discriminative Sum Types Locate the Source of Type Errors

Proceedings of the ACM SIGPLAN International Conference on Functional Programming, ICFP

Volumn 8, Issue , 2003, Pages 15-26

  Neubauer, Matthias ^a   Thiemann, Peter ^a  

^a UNIVERSITY OF FREIBURG   (Germany)

Author keywords

Polymorphism; Type errors; Type inference

Indexed keywords

ALGORITHMS; CODING ERRORS; COMPUTER SOFTWARE; ERROR DETECTION; INFERENCE ENGINES; OPTIMIZATION; PROBLEM SOLVING;

POLYMORPHISM; SOFT TYPING; TYPE ERRORS; TYPE INFERENCE;

COMPUTER PROGRAMMING LANGUAGES;

EID: 1142287627     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/944705.944708     Document Type: Conference Paper

References (38)

1. Martín Abadi, Butler Lampson, and Jean-Jacques Lévy. Analysis and caching of dependencies. In Kent Dybvig, editor, Proceedings of the 1996 International Conference on Functional Programming, pages 83-91, Philadelphia, PA, May 1996. ACM Press, New York.
2. ACM. Proc. of the 13th Annual ACM Symposium on Principles of Programming Languages, St. Petersburg, Florida, 1986.
3. Alexander Aiken, Edward L. Wimmers, and T.K. Lakshman. Soft typing with conditional types. In Proceedings of the 1994 ACM SIGPLAN Symposium on Principles of Programming Languages, Portland, OR, January 1994. ACM Press.
4. Franz Baader and Tobias Nipkow. Term Rewriting and All That. Cambridge University Press, 1998.
5. H. P. Barendregt. The Lambda Calculus - Its Syntax and Semantics. North-Holland, 1984.
6. Mike Beaven and Ryan Stansifer. Explaining type errors in polymorphic languages. ACM Letters on Programming Languages and Systems, 2(4): 17-30, March 1993.
7. Robert Cartwright and Mike Pagan. Soft typing. In Proc. Conference on Programming Language Design and Implementation '91, pages 278-292, Toronto, Canada, June 1991. ACM.
8. Olaf Chitil. Compositional explanation of types and algorithmic debugging of type errors. In Xavier Leroy, editor, Proceedings of the 2001 International Conference on Functional Programming, Florence, Italy, September 2001. ACM Press, New York.
9. Dominique Clément, Joëlle Despeyroux, Thierry Despeyroux, and Gilles Kahn. A simple applicative language: Mini-ML. In Proceedings of the 1986 ACM Conference on Lisp and Functional Programming, pages 13-27, 1986.
10. Luis Damas. Type Assignment in Programming Languages. PhD thesis, Computer Science Department, Edinburgh University, 1985. report CST-33-85.
11. Luis Damas and Robin Milner. Principal type-schemes for functional programs. In Proceedings of the 1982 ACM SIG-PLAN Symposium on Principles of Programming Languages, pages 207-212. ACM Press, 1982.
12. Dominic Duggan and Frederick Bent. Explaining type inference, Science of Computer Programming, 27(1):37-83, July 1996.
13. Cormac Flanagan and Matthias Felleisen. Componential set-based analysis. ACM Transactions on Programming Languages and Systems, 21(2):370-416, March 1999.
14. Christian Haack and Joe Wells. Type error slicing in implicitly typed, higher-order languages. In Proc. 12th European Symposium on Programming, Lecture Notes in Computer Science, Warsaw, Poland, April 2003. Springer-Verlag.
15. Bastiaan Heeren, Johan Jeuring, Doaitse Swierstra, and Pablo Azero Alcocer. Improving type-error messages in functional languages. Technical Report UU-CS-2002-009, Institute of Information and Computing Science, University Utrecht, Netherlands, February 2002. Technical Report.
16. Nevin Heintze. Control-flow analysis and type systems. In Alan Mycroft, editor, Proceedings of the 1995 International Static Analysis Symposium, number 983 in Lecture Notes in Computer Science, pages 189-206, Glasgow, Scotland, September 1995. Springer-Verlag.
17. Fritz Henglein. Dynamic typing: Syntax and proof theory. Science of Computer Programming, 22:197-230, 1994.
18. Fritz Henglein and Jakob Rehof. Safe polymorphic type inference for a dynamically typed language: Translating Scheme to ML. In Simon Peyton Jones, editor, Proc. Functional Programming Languages and Computer Architecture 1995, La Jolla, CA, June 1995. ACM Press, New York.
19. Mark P. Jones. Qualified Types: Theory and Practice. Cambridge University Press, Cambridge, UK, 1994.
20. Oukseh Lee and Kwangkeun Yi. Proofs about a folklore letpolymorphic type inference algorithm. ACM Transactions on Programming Languages and Systems, 20(4):707-723, 1998.
21. Bruce J. McAdam. On the Unification of Substitutions in Type Inference. In Kevin Hammond, Anthony J.T. Davie, and Chris Clack, editors, Implementation of Functional Languages (IFL '98), London, UK, number 1595 in Lecture Notes in Computer Science, pages 139-154. Springer-Verlag, September 1998.
22. Robin Milner. A theory of type polymorphism in programming. Journal of Computer and System Sciences, 17:348-375, 1978.
23. John Mitchell. Foundations for Programming Languages. MIT Press, 1996.
24. John C. Mitchell. Type inference with simple subtypes. Journal of Functional Programming, 1(3):245-286, July 1991.
25. Martin Odersky, Martin Sulzmann, and Martin Wehr. Type inference with constrained types. Theory and Practice of Object Systems, 5(1):35-55, 1999.
26. Jens Palsberg and Patrick O'Keefe. A type system equivalent to flow analysis. In Proceedings of the 1995 ACM SIGPLAN Symposium on Principles of Programming Languages, pages 367-378, San Francisco, CA, January 1995. ACM Press.
27. Jens Palsberg and Christina Pavlopoulou. From polyvariant flow information to intersection and union types. In Luca Cardelli, editor, Proc. 25th Annual ACM Symposium on Principles of Programming Languages, pages 197-208, San Diego, CA, USA, January 1998. ACM Press.
28. François Pottier. A versatile constraint-based type inference system. Nordic Journal of Computing, 7(4):312-347, November 2000.
29. Didier Rémy. Typechecking records and variants in a natural extension of ML. In Proc. 16th Annual ACM Symposium on Principles of Programming Languages, pages 77-88, Austin, Texas, January 1989. ACM Press.
30. Didier Rémy. Projective ML. In Proc. 1992 ACM Conference on Lisp and Functional Programming, pages 66-75, San Francisco, California, USA, June 1992.
31. Didier Rémy. Type inference for records in a natural extension of ML. In Carl A. Gunter and John C. Mitchell, editors, Theoretical Aspects of Object-Oriented Programming: Types, Semantics, and Language Design. The MIT Press, 1994.
32. Christian Skalka and Scott Smith. Set types and applications. Electronic Notes in Theoretical Computer Science, 75, 2003.
33. Janet A. Walz and Gregory F. Johnson. A maximium flow approach to anomaly isolation in unification-based incremental type inference. In POPL1986 [2], pages 44-57.
34. Mitchell Wand. Finding the source of type errors. In POPL1986 [2], pages 38-43.
35. Mitchell Wand. Type inference for record concatenation and multiple inheritance. In Proceedings of the 1989 IEEE Symposium on Logic in Computer Science, pages 92-97, Pacific Grove, CA, June 1989. IEEE Computer Society Press. To appear in Information and Computation.
36. Mitchell Wand. Type inference for record concatenation and multiple inheritance. Information and Computation, 93(1): 1-15, July 1991.
37. Joseph B. Wells. The essence of principal typings. In Proc. 29th Int'l Coll. Automata, Languages, and Programming, number 2380 in Lecture Notes in Computer Science, pages 913-925. Springer-Verlag, 2002.
38. Andrew K. Wright and Robert Cartwright. A practical soft type system for Scheme. ACM Transactions on Programming Languages and Systems, 19(1):87-152, January 1997.