R. S. Nikhil. Practical polymorphism. In J.-P. Jouannaud, editor, Functional Programming Languages and Computer Architecture, pages 319--333. Springer-Verlag, Berlin, DE, 1985. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Generalizing Hindley-Milner Type Inference Algorithms - Heeren, Hage, Swierstra (2002) (2 citations) (Correct)
....Contrary to the standard type environment #, as used in the Hindley Milner inference rules, there can be multiple (di#erent) assumptions for a given variable. The rules are such that they allow for flexibility in coping with unbound identifiers. Advantages of this property are discussed in Nikhil [Nik85] and Bernstein [Ber95] The inference rule for a variable is very straightforward: a fresh type variable # is introduced and returned as the type. We assume that at any time there are infinitely many fresh type variables available. The fact that # was assigned to the variable is recorded in the ....
R. S. Nikhil. Practical polymorphism. In J.-P. Jouannaud, editor, Functional Programming Languages and Computer Architecture, pages 319--333. Springer-Verlag, Berlin, DE, 1985.
Explaining Type Inference - Duggan, Bent (1995) (9 citations) (Correct)
....which scales up) our objective is to provide better explanations for why particular types were inferred for program variables, to help the programmer in tracking down the source of type errors. There have been a few approaches to providing explanations for type errors with type inference. Nikhil [32] describes a practical realization of type inference, where the main consideration for reporting type errors is to report the application site where the type error arose (this is now standard in most type checkers) In our experience, type errors often arise when the type checker infers an ....
Rishiyur S. Nikhil. Practical polymorphism. In Proceedings of ACM Symposium on Functional Programming and Computer Architecture, pages 319--333, 1985.
An Incremental Type Inference System for the Programming Language Id - Gupta (1990) (1 citation) (Correct)
....interprocedural consistency which gets further complicated due to type inference, polymorphism and higher order functions. It is our intention in this thesis to incorporate LISP like programming incrementality within the framework of Hindley Milner static type inference mechanism. Nikhil [44] raised this problem in the context of ML programming environment and outlined a scheme for incremental polymorphic type inference that we have concretized and implemented here for the programming environment of Id. In particular, we will show how to modify the Hindley Milner type system to work ....
....abnormal termination if that definition is really required in the dynamic sequence of execution. This is useful, for example, in developing large systems where the user may want to exercise localized parts of the system using appropriate test data without bothering about the whole system. See [44] for description of such a strategy. The completeness lemmas of section 3.4 are not affected by this extension of handling an incomplete program because none of the definitions is ever removed from the program we are only allowed to add more, and secondly no definition can be edited so that the ....
[Article contains additional citation context not shown here]
Rishiyur S. Nikhil. Practical Polymorphism. In Proceedings of the Conference on Functional Programming Languages and Computer Architectures, Nancy, FRANCE, volume 201 of Lecture notes in Computer Science. Springer-Verlag, September 1985.
Types and Type Inference in a Visual Programming Language - Burnett (1993) (6 citations) (Correct)
....message gives the conflicting monomorphic types found and the cell whose formula introduced the error (which is the most recent formula entered, since type checking is immediate) When the user changes a formula, type checking of the affected objects must be redone. Using techniques suggested by [8] and [10] which take advantage of the fact that most of the factors affecting the type remain unchanged, re typechecking can be handled at a cost of one additional multiple, namely the size of the equivalence class being rechecked. 5: Issues and open questions Use of VPL characteristics: This work ....
R. Nikhil, Practical polymorphism, in Functional Programming Langs. and Computer Arch., (J. Jouannaud, ed.), LNCS #201, Springer-Verlag, 319-333, Sept. 1985.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC