How to make ad-hoc polymorphism less ad hoc
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A study of errors, error-proneness, and error diagnosis in Cobol
Communications of the ACM
DITRAN—a compiler emphasizing diagnostics
Communications of the ACM
Automatic program analysis and evaluation
ICSE '76 Proceedings of the 2nd international conference on Software engineering
The impact of language design on the production of reliable software
Proceedings of the international conference on Reliable software
Haskell '03 Proceedings of the 2003 ACM SIGPLAN workshop on Haskell
Scripting the type inference process
ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
Methods and tools for exploring novice compilation behaviour
Proceedings of the second international workshop on Computing education research
Heuristics for type error discovery and recovery
IFL'06 Proceedings of the 18th international conference on Implementation and application of functional languages
Metamodel usage analysis for identifying metamodel improvements
SLE'10 Proceedings of the Third international conference on Software language engineering
| Hi-index | 0.00 |
A language is ultimately developed for its users: the programmers. The gap between the language experts who design and implement the language and its associated tools and the programmers can be very large, particularly in areas where the language is developed to be used by non-programmers or novice programmers by design. To verify that assumptions made and beliefs held by the language developers about the actual use made by programmers bear out, some analyis of the usage of the language and its associated tools must be performed, preferably in an automated fashion transparent to the users. In this paper we detail our approach, which is essentially to log compilations in order to obtain compilation histories and to query these compilation histories in order to extract the necessary information. For the latter task, we have designed and implemented the Neon library, and show how relatively complicated queries can be formulated effectively.