Incremental on-line type inference
Robinson, Thomas Lewis
Volpano, Dennis M.
MetadataShow full item record
Type inference in interactive programming environments falls short in two respects. The ability to type check definitions one at a time, and to type check some definitions but not all after one definition is modified is called incremental on-line type inference. Current interactive programming environments perform batch type inference and require extensive type recomputation for small changes. We give an algorithm for on-line type inference that is implemented as an attribute grammar. From this grammar an editor was automatically generated that performs on-line type inference. The editor infers types incrementally due to a well-known reduction we used from Hindley-Milner type inference to first- order unification. Unlike other efforts, our algorithm for on-line type inference is truly incremental
Approved for public release; distribution unlimited.
Showing items related by title, author, creator and subject.
Fischer, William D. (Monterey, California. Naval Postgraduate School, 2009-06);Prior research has focused on intra-domain fault localization leaving the cross-domain problem largely unaddressed. Faults often have widespread effects, which if correlated, could significantly improve fault localization. ...
Watanabe, Satosi (American Physical Society, 1955-06);An attempt is made within the framework of the accepted quantum physics to achieve the maximum paralllism between prediction (inference of the future observational data from the present ones) and retrodiction (inference ...
Towards a solution to the proper integration of a logic programming system and a large knowledge based management system Gorman, John Patrick (1987-12);In designing the interface between a database and a logic system with inference such as Prolog, efficiency is the major issue. Presented here are three of the methods that are considered most promising and in which much ...