Baker, H. The Nimble type inferencer for Common Lisp-84. Unpublished report, December 1991. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Simulated Overloading using Generic Functions in Scheme - Cox (1999) (Correct)
.... 1 , 2 ] intersect[any, intersect[ any] intersect[true, if 6= #f intersect[ true] if 6= #f intersect[ c] c if c 2 intersect[c, c if c 2 intersect[ 1 , 2 ] 1 if 1 = 2 intersect[ cons 1 2 ) cons 3 4 ) cons intersect[ 1 , 3 ] intersect[ 2 , 4 ] intersect[ 1 . n ) n 1 . n m ) intersect[ 1 , n 1 ] intersect[n , n m ] where n = m intersect[ 1 , 2 ] void when no other case applies Figure 7: Definition of Type Intersection Let the initial solution S 1 be: f(v 1 , any) ....
....symbols. The incremental type inference done here on isolated function abstractions requires an ability to handle unbound names. Kaplan and Ullman [10] iteratively traverse a parse tree for a program to assign types to the elements of the tree. The Nimble type inferencer for Common Lisp 84 [3] is based on the Kaplan Ullman method of fixed point iteration. It is difficult to find documentation on the Nimble inferencer since the source code is the property of the Nimble Computer Corporation. 9 Conclusion This paper has described a simple extension to Scheme which improves the languages ....
Baker, H. The Nimble type inferencer for Common Lisp-84. Unpublished report, December 1991.
A Practical Approach to Type Inference in EuLisp - Kind, Friedrich (1993) (10 citations) (Correct)
....from development environment. The concept of the type inference system is influenced by the language design of EuLisp. The requirements of the language allow us to improve previous work on type inference for Common Lisp. TICL proposed by Ma and Kessler [8] and a type inference approach by Baker [1] perform only atomic, non recursive types by operating on Common Lisp source code. The size and unrestricted nature of Common Lisp prevents deeper type inference using higher order data types. The global tagging optimization for Scheme, proposed by Henglein [5] uses compound and recursive lists, ....
Baker, H. G. The Nimble type inferencer for Common Lisp-84. (April 1990). Pre-puplication version.
A Practical Approach to Type Inference for EuLisp - Kind, Friedrich (1993) (10 citations) (Correct)
....developed by Ma and Kessler [8] generally achieves 20 speed improvement. However, reanalysis slows the inference process when recursive functions must be handled, or when a defined function is analysed before those functions that use it are analysed. A type inference approach proposed by Baker [1] inspired us to use refined types. But the need to use the costly Kaplan Ullman fixed point algorithm makes this approach less attractive. Neither TICL nor Baker s approach handle the notion of typed lists. A global tagging optimization for Scheme, proposed by Henglein [5] eliminates 60 95 of ....
Baker, H. G. The Nimble type inferencer for Common Lisp-84. (April 1990). Pre-puplication version.
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