N. Jones and S. Muchnick, `Binding time optimization in programming languages: Some thoughts toward the design of the ideal language.' Proc. of 3rdACM Symp. on Principles of Prog. Lang., pp. 77-94. Jan 1976.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....[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 the inspiration for ours. In particular, our approach is similar to Shivers 0CFA[4] whichdoescontrol flow analysis on distinct call sites, except that ffl ....

N. Jones and S. Muchnick, `Binding time optimization in programming languages: Some thoughts toward the design of the ideal language.' Proc. of 3rdACM Symp. on Principles of Prog. Lang., pp. 77-94. Jan 1976.

....is a pointer, and the generated representation (ISREP) is a number, then the allocation is performed on the stack. Note that a procedure must ensure (at run time) that an argument is heap allocated before it performs an unsafe operation on the argument. 35 4.1. 3 Variables Jones and Muchnick [MJ76] discuss the use of flow analysis for automatic choice of storage discipline for variables in Tempo. For each variable, their analysis determines those points in the program where the variable requires storage; that is, it determines the live range of the variable. Using this information it is ....

Steven S. Muchnick and Neil D. Jones. Binding time optimizations in programming languages: Some thoughts toward the design of an ideal language. In Conf. Record of ACM 107 SIGACT/SIGPLAN Symposium on Principles of Programming Languages, pages 77--91, 1976.

....and structure components are each limited to single types (no side effects of types) and explicit type declarations are sometimes required. 2.2. Kaplan Ullman Fixed Point Iteration The second approach to static inference of data types is attributable to an approach by Jones and Muchnick [6]. Kaplan and Ullman [7] have improved this imperative approach and obtained more exact type information for program statements. In the approach suggested by Kaplan and Ullman programs are modelled as directed graphs, with nodes representing assignments and edges representing the direct control ....

Jones, N. D. and Muchnick, S. Binding time optimization in programming languages. In Third Symposium on Principles of Programming Languages (1976) 77--94.

....that lists can be created (for example, one cannot say f = cons(x,x) and the sharing that can occur within a list. Orbit, an optimizing compiler for Scheme, uses a simple first order escape analysis to stack allocate closures [15] Other analyses for optimizing storage allocation were proposed in [14, 5]. Deutsch [8] presents a lifetime and sharing analysis for higher order languages. While the goals of the paper seem to be similar to ours, the approach is very di#erent. The analysis consisted of defining a lowlevel operational model for a higher order functional language, translating a program ....

N. Jones and S. Muchnick. Binding time optimization in programming languages: An approach to the design of an ideal language. In Proceedings of the ACM Symposium on Principles of Programming Languages, pp. 77-94, 1976.

....for tagging optimization; instead it appears that all values are expected to be fully tagged at run time. 3 Collecting type information for latently typed languages is far 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 ....

N. Jones and S. Muchnick. Binding time optimization in programming languages: some thoughts toward the design of the ideal language. In Proc. 3rd ACM Symp. on Principles of Programming Languages, pages 77--94, ACM, Jan. 1976.

....dynamically, at run time) Instead of early and late we also use the common terms static and dynamic , respectively. Binding time information can be used to optimize the implementation of programming languages by scheduling operations with statically bound data at compile time (e.g. JM76,JM78,JS80,Kro81,NN86] etc) Automatic binding time analysis is usually beneficial for guiding the actions of program specializers, but it plays an especially important role in the generation of compilers from self applicable partial evaluators [JSS85,JSS89,Con88,Rom87,JGB 90,Bon90a,GJ91] as a ....

N. Jones and S. Muchnick. Binding time optimization in programming languages: Some thoughts toward the design of the ideal language. In Proc. 3rd ACM Symp. on Principles of Programming Languages, pages 77--94. ACM, Jan. 1976.

....directly involved with expanding, defining, and implementing this system and solving the problems encountered therein. 1.3.3 Static Analysis Type checking and type inference are both static analysis techniques. Our approach is similar in flavor, though not necessarily in intent, to the work of [Rey69, JM76, KU78, JM82]. A type inference system very similar to ours is used by Mishra and Reddy [MR85] but for a different style of language. Their system includes full type inference, arbitrary union types, parameterized types, and recursive types. Subtyping is based on subsets of union types. Their type inference ....

Neil D. Jones and Steven S. Muchnick. Binding time optimization in programming languages: Some thoughts toward the design of an ideal language. In Conference Record of the Third Annual ACM Symposium on Principles of Programming Languages, pages 77-- 94, 1976.

....is inferred from operations on other variables. A constant propagation algorithm that treats variables independently (e.g. using a constant cross variable product lattice) cannot do this. In addition to propagating type assertions forward, some algorithms also propagate type expectations backward [6, 8, 9, 14]. This allows two useful optimizations: moving several identical type checks to a common point, and hoisting loop invariant type checks out of the loop. For us, however, the advantage is small. Well known optimization techniques, like common subexpression analysis and hoisting of loop invariant ....

Neil D. Jones and Steven S. Muchnick. Binding time optimization in programming languages: Some thoughts toward the design of an ideal language. In Conference Record of the Third Annual ACM Symposium on Principles of Programming Languages, pages 77--94, January 1976.

....variables and structure components are each limited to single types (no side effects of types) and explicit type declarations are sometimes required. 2.2. Kaplan Ullman Fixed Point Iteration The second approach to static inference of data types is attributable to a proposal by Jones and Muchnick [6]. Kaplan and Ullman [7] refined this idea to obtain more exact type information for given program statements. In the approach suggested by Kaplan and Ullman, programs are modelled as directed graphs, with nodes representing assignments and edges representing direct control flow relations between ....

Jones, N. D. and Muchnick, S. Binding time optimization in programming languages. In Third Symposium on Principles of Programming Languages (1976) 77--94.

No context found.

N. Jones and S. Muchnick. Binding time optimization in programming languages: an approach to the design of an ideal language. In Proceedings of the 3rd ACM Symposium on Principles of Programming Languages, pages 77-94, January 1976.

No context found.

Jones, N.D., and Muchnick, S. "Binding time optimization in programming languages". 3'rd ACM POPL, Atlanta, GA (1976),77-94.

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