| A. Dimock, R. Muller, F. Turbak, and J. B. Wells. Strongly typed flow-directed reprsentation transformations. In ACM SIGPLAN International Conference on Functional Programming, pages 85--98, Amsterdam, June 1997. |
....to be aggressive in the elimination of polymorphism and other optimizations, we could achieve spectacular speedups, while maintaining accurate type information through to the back end. 3. THE INFLUENCE OF TIL Later SML compiler e#orts, including Flint [22] MLton [12] TILT [21] and Church [2] took the TIL results much further. For example, Flint used a clever combination of Leroy style coercions and intensional polymorphism to get the best of each approach, and to scale the ideas to the full SML language. The MLton compiler simply eliminated all polymorphism through a whole program ....
A. Dimock, R. Muller, F. Turbak, and J. B. Wells. Strongly typed flow-directed reprsentation transformations. In ACM SIGPLAN International Conference on Functional Programming, pages 11--24, Amsterdam, June 1997.
.... [Tarditi et al. 1996; Morrisett et al. 1996] Today a small number of compilers work with typed intermediate languages in order to realize some or all of these benefits [Leroy 1992; Peyton Jones et al. 1993; Birkedal et al. 1993; Tarditi et al. 1996; Lindholm and Yellin 1996; Shao 1997; Dimock et al. 1997]. However, in all of these compilers, there is a conceptual line where types are lost. For instance, the TIL ML compiler preserves type information through approximately 80 of compilation, but the remaining 20 is untyped. We show how to recode the untyped portions of a compiler to maintain type ....
Dimock, A., Muller, R., Turbak, F., and Wells, J. B. 1997. Strongly typed flow-directed reprsentation transformations. In 1997 ACM SIGPLAN International Conference on Functional Programming. ACM Press, New York, NY, USA, 85--98.
....Any opinions, findings, and conclusions or recommendations expressed in this publication are those of the authors and do not reflect the views of these agencies. 1 Today a small number of compilers work with typed intermediate languages in order to realize some or all of these benefits [23, 34, 7, 41, 25, 38, 14]. However, in all of these compilers, there is a conceptual line where types are lost. For instance, the TIL ML compiler preserves type information through approximately 80 of compilation, but the remaining 20 is untyped. We show how to eliminate the untyped portions of a compiler and by so ....
Allyn Dimock, Robert Muller, Franklyn Turbak, and J. B. Wells. Strongly typed flow-directed reprsentation transformations. In ACM SIGPLAN International Conference on Functional Programming, pages 85--98, Amsterdam, June 1997.
....model calling conventions by specifying them as formal translations of source function types to STAL types. 1 Introduction and Motivation Statically typed source languages have e#ciency and software engineering advantages over their dynamically typed counterparts. Modern type directed compilers [18, 25, 7, 32, 19, 29, 11] exploit the properties of typed languages more extensively than their predecessors by preserving type information computed in the front end through a series of typed intermediate languages. These compilers use types to direct sophisticated transformations such as closure conversion [17, 31, 16, ....
Allyn Dimock, Robert Muller, Franklyn Turbak, and J. B. Wells. Strongly typed flow-directed reprsentation transformations. In ACM SIGPLAN International Conference on Functional Programming, pages 11--24, Amsterdam, June 1997.
.... discipline [22, 18, 28, 37] Furthermore, the ability to type check intermediate code provides an invaluable tool for debugging new transformations and optimizations [41, 30] Today a small number of compilers work with typed intermediate languages in order to realize some or all of these benefits [22, 34, 6, 41, 24, 39, 13]. However, in all of these compilers, there is a conceptual line where types are lost. For instance, the TIL ML compiler preserves type information through approximately 80 of compilation, but the remaining 20 is untyped. We show how to eliminate the untyped portions of a compiler and by so ....
A. Dimock, R. Muller, F. Turbak, and J. B. Wells. Strongly typed flow-directed reprsentation transformations. In ACM SIGPLAN International Conference on Functional Programming, pages 85--98, Amsterdam, June 1997.
....model calling conventions by specifying them as formal translations of source function types to STAL types. 1 Introduction and Motivation Statically typed source languages have e#ciency and software engineering advantages over their dynamically typed counterparts. Modern type directed compilers [19, 25, 7, 32, 20, 28, 12] exploit the properties of typed languages more extensively than their predecessors by preserving type information computed in the front end through a series of typed intermediate languages. These compilers use types to direct sophisticated transformations such as closure conversion [18, 31, 17, ....
Allyn Dimock, Robert Muller, Franklyn Turbak, and J. B. Wells. Strongly typed flow-directed reprsentation transformations. In ACM SIGPLAN International Conference on Functional Programming, pages 11--24, Amsterdam, June 1997.
.... of correctness [22, 18, 28] Furthermore, the ability to type check intermediate code provides an invaluable tool for debugging new transformations and optimizations [41, 31] Today a small number of compilers work with typed intermediate languages in order to realize some or all of these benefits [22, 34, 6, 41, 24, 39, 13]. However, in all of these compilers, there is a conceptual line where types are lost. For instance, the TIL ML compiler preserves type information through approximately 80 of compilation, but the remaining 20 is untyped. y This material is based on work supported in part by AFOSR grant ....
A. Dimock, R. Muller, F. Turbak, and J. B. Wells. Strongly typed flow-directed reprsentation transformations. In ACM SIGPLAN International Conference on Functional Programming, pages 85--98, Amsterdam, June 1997.
.... discipline [23, 19, 31, 37] Furthermore, the ability to typecheck intermediate code provides an invaluable tool for debugging new transformations and optimizations [41, 29] Today a small number of compilers work with typed intermediate languages in order to realize some or all of these benefits [23, 34, 7, 41, 25, 38, 14]. However, in all of these compilers, there is a This material is based on work supported in part by AFOSR grant F49620 97 1 0013, ARPA RADC grant FC30602 96 1 0317, NSF grant CCR 9244739, and ONR grant N00014 92 J 1764. Any opinions, findings, and conclusions or recommendations in this ....
Allyn Dimock, Robert Muller, Franklyn Turbak, and J. B. Wells. Strongly typed flow-directed reprsentation transformations. In ACM SIGPLAN International Conference on Functional Programming, pages 85--98, Amsterdam, June 1997.
.... discipline [22, 18, 28, 37] Furthermore, the ability to type check intermediate code provides an invaluable tool for debugging new transformations and optimizations [41, 30] Today a small number of compilers work with typed intermediate languages in order to realize some or all of these benefits [22, 34, 6, 41, 24, 39, 13]. However, in all of these compilers, there is a conceptual line where types are lost. For instance, the TIL ML compiler preserves type information through approximately 80 of compilation, but the remaining 20 is untyped. We show how to eliminate the untyped portions of a compiler and by so ....
A. Dimock, R. Muller, F. Turbak, and J. B. Wells. Strongly typed flow-directed reprsentation transformations. In ACM SIGPLAN International Conference on Functional Programming, pages 85--98, Amsterdam, June 1997.
....Keywords: Typed compilation, typed assembly language, certified code, polymorphic recursion, stacks. 1 Introduction and Motivation Statically typed source languages have efficiency and software engineering advantages over their dynamically typed counterparts. Modern type directed compilers [18, 25, 7, 32, 19, 29, 11] exploit the properties of typed languages more extensively than their predecessors by preserving type information computed in the front end through a series of typed intermediate languages. These compilers use types to direct sophisticated transformations such as closure conversion [17, 31, 16, ....
Allyn Dimock, Robert Muller, Franklyn Turbak, and J. B. Wells. Strongly typed flow-directed reprsentation transformations. In ACM SIGPLAN International Conference on Functional Programming, pages 11--24, Amsterdam, June 1997.
....Any opinions, findings, and conclusions or recommendations expressed in this publication are those of the authors and do not reflect the views of these agencies. Today a small number of compilers work with typed intermediate languages in order to realize some or all of these benefits [23, 36, 5, 43, 24, 40, 13]. However, in all of these compilers, there is a conceptual line where types are lost. For instance, the TIL ML compiler preserves type information through approximately 80 of compilation, but the remaining 20 is untyped. We show how to recode the untyped portions of a compiler to maintain ....
Allyn Dimock, Robert Muller, Franklyn Turbak, and J. B. Wells. Strongly typed flow-directed reprsentation transformations. In ACM SIGPLAN International Conference on Functional Programming, pages 85--98, Amsterdam, June 1997.
No context found.
A. Dimock, R. Muller, F. Turbak, and J. B. Wells. Strongly typed flow-directed reprsentation transformations. In ACM SIGPLAN International Conference on Functional Programming, pages 85--98, Amsterdam, June 1997.
No context found.
Dimock, A., Muller, R., Turbak, F., and Wells, J. B. 1997. Strongly typed flow-directed reprsentation transformations. In 1997 ACM SIGPLAN International Conference on Functional Programming. ACM Press, New York, NY, USA, 85--98.
No context found.
A. Dimock, R. Muller, F. Turbak, and J. B. Wells. Strongly typed flow-directed reprsentation transformations. In ACM SIGPLAN International Conference on Functional Programming, pages 11--24, Amsterdam, June 1997.
No context found.
A. Dimock, R. Muller, F. Turbak, and J. B. Wells. Strongly typed flow-directed reprsentation transformations. In ACM SIGPLAN International Conference on Functional Programming, pages 85--98, Amsterdam, June 1997.
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