Compiler error messages considered unhelpful: The landscape of text-based programming error message research

BA Becker, P Denny, R Pettit, D Bouchard… - Proceedings of the …, 2019 - dl.acm.org
Diagnostic messages generated by compilers and interpreters such as syntax error
messages have been researched for over half of a century. Unfortunately, these messages …

A history of Haskell: being lazy with class

P Hudak, J Hughes, S Peyton Jones… - Proceedings of the third …, 2007 - dl.acm.org
A history of Haskell Page 1 A History of Haskell: Being Lazy With Class Paul Hudak Yale
University paul.hudak@yale.edu John Hughes Chalmers University rjmh@cs.chalmers.se …

Practical type inference for arbitrary-rank types

SP Jones, D Vytiniotis, S Weirich… - Journal of functional …, 2007 - cambridge.org
Haskell's popularity has driven the need for ever more expressive type system features, most
of which threaten the decidability and practicality of Damas-Milner type inference. One such …

Helium, for learning Haskell

B Heeren, D Leijen, A Van IJzendoorn - Proceedings of the 2003 ACM …, 2003 - dl.acm.org
Helium is a user-friendly compiler designed especially for learning the functional
programming language Haskell. The quality of the error messages has been the main …

On the bright side of type classes: instance arguments in Agda

D Devriese, F Piessens - ACM SIGPLAN Notices, 2011 - dl.acm.org
We present instance arguments: an alternative to type classes and related features in the
dependently typed, purely functional programming language/proof assistant Agda. They are …

[图书][B] Top quality type error messages

BJ Heeren - 2005 - Citeseer
Overview. This chapter provides a gentle introduction to type systems, functional languages,
and type error messages. We give examples of reported type error messages to illustrate the …

A constraint language for static semantic analysis based on scope graphs

H Antwerpen, P Néron, A Tolmach, E Visser… - Proceedings of the …, 2016 - dl.acm.org
In previous work, we introduced scope graphs as a formalism for describing program
binding structure and performing name resolution in an AST-independent way. In this paper …

Learning to blame: localizing novice type errors with data-driven diagnosis

EL Seidel, H Sibghat, K Chaudhuri, W Weimer… - Proceedings of the …, 2017 - dl.acm.org
Localizing type errors is challenging in languages with global type inference, as the type
checker must make assumptions about what the programmer intended to do. We introduce …

Heuristics for type error discovery and recovery

J Hage, B Heeren - … and Application of Functional Languages: 18th …, 2007 - Springer
Type error messages that are reported for incorrect functional programs can be difficult to
understand. The reason for this is that most type inference algorithms proceed in a …

Combinator parsing: A short tutorial

SD Swierstra - International LerNet ALFA Summer School on …, 2008 - Springer
There are numerous ways to implement a parser for a given syntax; using parser
combinators is a powerful approach to parsing which derives much of its power and …