Improving Type Error Messages in OCaml

Article, Preprint, Conference object English OPEN
Charguéraud, Arthur;
  • Publisher: Open Publishing Association
  • Journal: Electronic Proceedings in Theoretical Computer Science (issn: 2075-2180)
  • Publisher copyright policies & self-archiving
  • Related identifiers: doi: 10.4204/EPTCS.198.4
  • Subject: [INFO.INFO-PL]Computer Science [cs]/Programming Languages [cs.PL] | Computer Science - Programming Languages | Mathematics | ACM: D.: Software/D.3: PROGRAMMING LANGUAGES | Electronic computers. Computer science | D.3.4 | ACM : D.: Software/D.3: PROGRAMMING LANGUAGES | [ INFO.INFO-PL ] Computer Science [cs]/Programming Languages [cs.PL] | QA1-939 | QA75.5-76.95

International audience; Cryptic type error messages are a major obstacle to learning OCaml or other ML-based languages. In many cases, error messages cannot be interpreted without a sufficiently-precise model of the type inference algorithm. The problem of improving typ... View more
  • References (22)
    22 references, page 1 of 3

    [1] Sheng Chen 0008 & Martin Erwig (2014): Counter-factual typing for debugging type errors. In Suresh Jagannathan & Peter Sewell, editors: The 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL '14, San Diego, CA, USA, January 20-21, 2014, ACM, pp. 583-594, doi:10.1145/2535838.2535863.

    [2] Benus Becker (2008): EasyOCaml: Making OCaml More Pleasant.

    [3] Karen L. Bernstein & Eugene W. Stark (1995): Debugging Type Errors. Technical Report, State University of New York at Stony Brook. Available at

    [4] Bernd Braßel (2004): TypeHope: There is hope for your type errors.

    [5] Olaf Chitil (2001): Compositional Explanation of Types and Algorithmic Debugging of Type Errors. In Benjamin C. Pierce, editor: Proceedings of the Sixth ACM SIGPLAN International Conference on Functional Programming (ICFP '01), Firenze (Florence), Italy, September 3-5, 2001, ACM, pp. 193-204, doi:10.1145/507669.507659. SIGPLAN Notices 36(10), October 2001.

    [6] Christian Haack & J. B. Wells (2003): Type Error Slicing in Implicitly Typed Higher-Order Languages. In: Programming Languages and Systems, Springer Science + Business Media, pp. 284-301, doi:10.1007/3- 540-36575-3_20.

    [7] Christian Haack & Joe B. Wells (2004): Type error slicing in implicitly typed higher-order languages. Science of Computer Programming 50(1-3), pp. 189-224, doi:10.1016/j.scico.2004.01.004.

    [8] Jurriaan Hage & Bastiaan Heeren (2005): Heuristics for type error discovery and recovery. Technical Report UU-CS-2005-029, Utrecht University. Available at CS-2005/2005-029.pdf.

    [9] Jurriaan Hage & Bastiaan Heeren (2007): Heuristics for Type Error Discovery and Recovery. In: Implementation and Application of Functional Languages, Springer Science + Business Media, pp. 199-216, doi:10.1007/978-3-540-74130-5_12.

    [10] Bastiaan Heeren, Daan Leijen & Arjan van IJzendoorn (2003): Helium, for learning Haskell. In: Proceedings of the ACM SIGPLAN workshop on Haskell (HASKELL-03), ACM, pp. 62-71, doi:10.1145/871895.871902.

  • Related Research Results (1)
  • Related Organizations (1)
  • Metrics