An approach to completing variable names for implicitly typed functional languages

Authors:
Takumi Goto;Isao Sasano
Affiliations:
Shibaura Institute of Technology, Tokyo, Japan;Shibaura Institute of Technology, Tokyo, Japan
Venue:
PEPM '12 Proceedings of the ACM SIGPLAN 2012 workshop on Partial evaluation and program manipulation
Year:
2012

Citing 10
Cited 0

Retrieving re-usable software components by polymorphic type

FPCA '89 Proceedings of the fourth international conference on Functional programming languages and computer architecture
Using types as search keys in function libraries

FPCA '89 Proceedings of the fourth international conference on Functional programming languages and computer architecture
Incremental polymorphism

Proceedings of the 5th ACM conference on Functional programming languages and computer architecture
Type isomorphisms in a type-assignment framework

POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Simple imperative polymorphism

Lisp and Symbolic Computation - Special issue on state in programming languages (part I)
A Machine-Oriented Logic Based on the Resolution Principle

Journal of the ACM (JACM)
The Definition of Standard ML

The Definition of Standard ML
Type error slicing in implicitly typed higher-order languages

Science of Computer Programming - Special issue on 12th European symposium on programming (ESOP 2003)
Searching for type-error messages

Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation
How Program History Can Improve Code Completion

ASE '08 Proceedings of the 2008 23rd IEEE/ACM International Conference on Automated Software Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents an approach to completing variable names when writing programs in implicitly typed functional languages. 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.