Abstract
This paper presents an approach to completing variable names when writing programs in an implicitly typed functional language. As a first step toward developing practical systems, we considered a simple case: up to the cursor position the program text is given completely. With this assumption we specify a variable completion problem for an implicitly typed core functional language with let-polymorphism, and show an algorithm for solving the problem. Based on the algorithm we have implemented a variable name completion system for the language as an Emacs-mode.
Original language | English |
---|---|
Pages (from-to) | 127-163 |
Number of pages | 37 |
Journal | Higher-Order and Symbolic Computation |
Volume | 25 |
Issue number | 1 |
DOIs | |
Publication status | Published - 2012 Mar |
Keywords
- Emacs-mode
- Polymorphic language
- Type inference
- Variable name completion
ASJC Scopus subject areas
- Software
- Computer Science Applications