Nikolaj S. Bjorner. Minimial typing derivations. In ACM SIGPLAN Workshop on ML and its Applications, pages 120--126, June 1994. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
A Type-Based Compiler for Standard ML - Shao, Appel (1994) (64 citations) (Correct)
....representation analysis to the SML module language to support module level abstractions and functor applications. ffl We improve compilation speed and code size by using partial types at module boundaries, and by memo izing coercions. ffl We evaluate the utility of minimum typing derivations [6] a method for eliminating unnecessary wrapper functions introduced by representation analysis. ffl We show how the type annotations can be simplified in successive phases of the compiler, and how representation analysis can interact with the Continuation Passing Style used by the SML NJ ....
....objects, we have implemented a minimum typing derivation phase in our compiler to give all local variables least polymorphic types. The derivation is done after the elaboration so that it is only applied to type correct programs. Our algorithm, which is similar to Bjrner s algorithm M [6], does a bottom up traversal of the Absyn. During the traversal, we mark all variables that are local (e.g. let bound) or hidden because of signature matching. For each marked polymorphic variable v, we gather all of its actual type instantiations, say 1 ; n , and reassign v a new type ....
[Article contains additional citation context not shown here]
Nikolaj S. Bjorner. Minimial typing derivations. In ACM SIGPLAN Workshop on ML and its Applications, pages 120--126, June 1994.
A Type-Based Compiler for Standard ML - Zhong Shao (1994) (64 citations) (Correct)
....language to support module level abstractions and functor applications. ffl We improve compilation speed and code size by using partial types at module boundaries, by statically hash consing lambda types, and by memoizing coercions. ffl We evaluate the utility of minimum typing derivations [7] a method for eliminating unnecessary wrapper functions introduced by representation analysis. ffl We show how the type annotations can be simplified in successive phases of the compiler, and how representation analysis can interact with the Continuation Passing Style [24, 3] used by the ....
....have implemented a minimum typing derivation phase in our new Elaborator Typechecker to give all local variables least polymorphic types. The derivation is done after the elaboration so that it is only applied to type correct programs. Our algorithm, which is similar to Bj rner s algorithm M [7], does a bottom up traversal of the Absyn. During the traversal, we mark all non exported variables: letbound variables and those that are hidden by signature matching. Then, for each marked polymorphic variable v, we gather all of its actual type instantiations, say 1 ; n , and ....
[Article contains additional citation context not shown here]
Nikolaj S. Bjorner. Minimial typing derivations. In ACM SIGPLAN Workshop on ML and its Applications, pages 120--126, June 1994.
A Type-Based Compiler for Standard ML - Zhong Shao (1994) (64 citations) (Correct)
....module language to support module level abstractions and functor applications. We improve compilation speed and code size by using partial types at module boundaries, by statically hashconsing lambda types, and by memo izing coercions. We evaluate the utility of minimum typing derivations [7] a method for eliminating unnecessary wrapper functions introduced by representation analysis. We show how the type annotations can be simplified in successive phases of the compiler, and how representation analysis can interact with the ContinuationPassing Style [24, 3] used by the ....
....have implemented a minimum typing derivation phase in our new Elaborator Type checker to give all local variables least polymorphic types. The derivation is done after the elaboration so that it is only applied to type correct programs. Our algorithm, which is similar to Bj rner s algorithm M [7], does a bottom up traversal of the Absyn. During the traversal, we mark all non exported variables: let bound variables and those that are hidden by signature matching. Then, for each marked polymorphic variable v, we gather all of its actual type instantiations, say # 1 , # n , and reassign ....
[Article contains additional citation context not shown here]
Nikolaj S. Bjorner. Minimial typing derivations. In ACM SIGPLAN Workshop on ML and its Applications, pages 120-- 126, June 1994.
Compiling Standard ML For Efficient Execution On Modern Machines - Shao (1994) (14 citations) (Correct)
....representation analysis to the SML module language to support module level abstractions and functor applications. ffl We improve compilation speed and code size by using partial types at module boundaries, and by memo izing coercions. ffl We evaluate the utility of minimum typing derivations [Bjo94] a method for eliminating unnecessary wrapper functions introduced by representation analysis. ffl We show how the type annotations can be simplified in successive phases of the compiler, and how representation analysis can interact with the Continuation Passing Style used by the SML NJ ....
....real) bool . We have implemented a minimum typing derivation phase in our compiler to give all local variables least polymorphic types. The derivation is done after the elaboration so that it is only applied to type correct programs. Our algorithm, which is similar to Bj rner s algorithm M [Bjo94] does a bottom up traversal of the abstract syntax Absyn. During the traversal, we mark all variables that are local (e.g. let bound) or hidden because of signature matching. For each marked polymorphic variable v, we gather all of its actual type instantiations, say 1 ; n , and ....
[Article contains additional citation context not shown here]
Nikolaj S. Bjorner. Minimial Typing Derivations. In ACM SIGPLAN Workshop on ML and its Applications, pages 120--126, June 1994.
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