K. Ma and R. Kessler, `TICL - a type inference system for Common Lisp', Software PracticeandExperience,vol. 20, no. 6, pp. 593-623. Jun 1990.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....attention from Lisp and functional programming language researchers. Tag optimization in functional programming language is done in the context of polymorphic functional programming languages [10] Most Lisp compilers such as ORBIT [11] or Screme [12] will do local tagging optimizations [1] TICL [13]isatype system for Common Lisp but it relies on user declarations. Type inference in high level dynamic typed languages is not a new problem. Early works on this problem include [19] 14] and [15] Their approaches are mainly based on data flow analysis. Shivers [4] and Henglein s [2] works are ....

K. Ma and R. Kessler, `TICL - a type inference system for Common Lisp', Software PracticeandExperience,vol. 20, no. 6, pp. 593-623. Jun 1990.

....analyzability, ffl separation of language 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 ....

Ma, K.-L. and Kessler, R. R. TICL---A type inference system for Common Lisp. Software---Practice and Experience, 20, 6 (June 1990) 593-- 623.

....LISP compiler for S1 [BGS82] in Orbit [KKR 86] and in Screme [VP89,Ple91] tagging optimization (representation analysis) is typically performed for atomic types (numbers) based on local control flow information. Our analysis is global and based on abstract data flow information. ffl In TICL [MK90] type analysis of Common LISP programs relies on costly repeated analysis and programmer type declarations. ffl Shivers [Shi91a] similarly uses potentially expensive and complicated data flow reanalysis for type recovery in Scheme and relies to some degree on programmer type declarations; his ....

....from new. Type finding based on classical data flow analysis technology goes back to Tenenbaum [Ten74] Jones and Muchnick [JM76,JM82] and Kaplan and Ullman [KU80] more recently it has been extended and adapted to SETL by Weiss [Wei86] to Icon by Walker [Wal88] to Common LISP by Ma and Kessler [MK90]; to Scheme by Shivers [Shi91a] see below) Type information is also instrumental in optimizing the implementation of functional 3 The article [CF91] contains some flaws and is currently under revision. 1. Inequality constraint rules) a) C [ ff (k) ff 1 . ff k ) fl; f (k) fi 1 . ....

[Article contains additional citation context not shown here]

K. Ma and R. Kessler. TICL -- a type inference system for common lisp. Software Practice & Experience, 1990.

....reliable indicator of potential program errors. Nevertheless, Henglein has used a formulation of static typing enhanced with to eliminate many run time checks from Scheme programs. The designers of optimizing compilers for Scheme and Lisp have developed type analyzers based on data flow analysis [3, 11, 12, 13, 19]. The information gathered by these systems is important for program optimization, but it is much too coarse to serve as the basis for a soft type system. None of the systems infer polymorphic types and most infer types that are simple unions of type constants. 6 Future Work We have developed ....

Ma, K. L., and Kessler, R. R. TICL---a type inference system for Common Lisp. Software Practice and Experience 20, 6 (June 1990), 593--623.

....FOR EULISP 3 ffl greater chances for further optimizations (e.g. inlining, dead code elimination) The combination of EuLisp and generic type schemes with refined types allows us to improve on previous work on type inference for CommonLisp. TICL a type inference system 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 ....

....the realistic inferences from the unrealistic ones. This is the reason why for recursive functions we do not attempt to achieve as precise types as possible such as by use of Kaplan Ullman fixed point iteration. Milner style unification cannot be used for languages with side effects on types [8]. Unlike ML, EuLisp provides polymorphic reference types (i.e. values of different types can be assigned to structure components) and has no need of lexical typing declarations. Nevertheless, the approach presented 6 KIND, FRIEDRICH here uses a modified unification algorithm to infer type ....

Ma, K.-L. and Kessler, R. R. TICL---A type inference system for Common Lisp. Software---Practice and Experience, 20, 6 (June 1990) 593-- 623.

....programmer. 1 Scheme Type Leakage Explorer 2 Typing Scheme There are basically two approaches for typing a language like Scheme: data flow analysis and static typing with a maximum type. Data flow analysis is an appropriate technique for optimized compilation of dynamically typed languages (Ma Kessler 1990, Shivers 1991) However, classical data flow analysis works top down and intra procedural and therefore cannot handle higher order functions properly. Static typing as described by Damas Milner (1982) assigns one, possibly polymorphic, most general type to each object of a program. Dynamic ....

....(1982) assigns one, possibly polymorphic, most general type to each object of a program. Dynamic typing is therefore reflected by polymorphic types. Because dynamically typed languages cannot be typed statically in general, a maximum type is assigned, when no other type will do (Henglein 1992, Gomard 1990). Style also implements this approach, because it is well understood and efficient in practice (Kanellakis, Mairson Mitchel 1991) 2.1 Types for Scheme Style distinguishes the following types for objects in Scheme. It employs a fully parenthesized prefix notation for types like Scheme does for ....

Ma, K. & Kessler, R. R. (1990): TICL---A Type Inference System for Common Lisp, Software---Practice and Experience 20(6), 593--623.

....written by the user. It appears that the programmer must understand the coercion insertion algorithm to understand the meaning of a program. 6.2. 2 Flow Analysis The designers of optimizing compilers for Scheme and Lisp have developed type recovery procedures based on iterative flow analysis [8, 33, 39, 40]. Some object oriented languages use similar methods [12, 34] The information gathered by these systems is important for program optimization, but it is generally too coarse to serve as the basis for a soft type system. Few of the systems infer polymorphic types; none accommodate higher order ....

....union types. Unboxing certain kinds of values could also simplify the problem of integrating Soft Scheme with other languages, like C. We also believe that type information such as Soft Scheme infers has the potential to guide many kinds of program global optimizations. Various Lisp compilers [8, 33, 39, 40] and some object oriented systems [12, 34] use iterative flow analysis techniques to determine type information for optimization. The idea of using type information derived from type inference for optimization seems to have received little attention in the literature. 128 8.5 Programming ....

Ma, K. L., and Kessler, R. R. TICL---a type inference system for Common Lisp. Software Practice and Experience 20, 6 (June 1990), 593--623.

....the utility of the inferred type information. Nevertheless, Henglein has used a formulation of static typing enhanced with to eliminate many run time checks from Scheme programs. The designers of optimizing compilers for Scheme and Lisp have developed type analyzers based on data flow analysis [4, 9, 13, 14, 15, 21]. The information gathered by these systems is important for program optimization, but it is much too coarse to serve as the basis for a soft type system. None of the systems infer polymorphic types and most infer types that are simple unions of type constants and constructions. 6 Future Work ....

Ma, K. L., and Kessler, R. R. TICL---a type inference system for Common Lisp. Software Practice and Experience 20, 6 (June 1990), 593--623.

No context found.

Ma, Kwan-Liu, and Kessler, Robert R. "TICL---A Type Inference System for Common Lisp". SW---Prac. & Exper. 20,6 (June 1990),593-623.

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