A. Wright and R. Cartwright. A practical soft typing system for scheme. In Proceedings of the 1994 ACM Conference on Lisp and Functional Programming, June 1994. To appear. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Dynamic Typing and Subtype Inference - Aiken, Fähndrich (1995) (2 citations) (Correct)
....values into and project values from type Dynamic. Currently, the main application of dynamic typing is the optimization of programs written in dynamically typed languages (such as Lisp and Scheme) by removing runtime tests of type tags where they are provably unnecessary (so called soft typing [CF91, WC94]) A remarkable, and to our knowledge unique, aspect of dynamic typing is that it not only permits the removal of dynamic type tag tests, but also allows the elimination of type tagging operations themselves. The purpose and results of our study are two fold. First, while dynamic typing is a very ....
....dynamic type tag tests, but also allows the elimination of type tagging operations themselves. The purpose and results of our study are two fold. First, while dynamic typing is a very interesting system, it cannot remove as many type checks as other recently proposed algorithms based on subtyping [AWL94, WC94]. However, as noted above, dynamic typing has the singular ability to remove type tagging operations as well. Thus, the power of dynamic typing is incomparable to the subtyping approaches. One of our goals is to investigate whether the strengths of dynamic typing can be combined with the strengths ....
[Article contains additional citation context not shown here]
A. Wright and R. Cartwright. A practical soft typing system for scheme. In Proceedings of the 1994 ACM Conference on Lisp and Functional Programming, June 1994. To appear.
Dynamic Typing and Subtype Inference - Aiken, Fähndrich (1995) (2 citations) (Correct)
....values into and project values from type Dynamic. Currently, the main application of dynamic typing is the optimization of programs written in dynamically typed languages (such as Lisp and Scheme) by removing runtime tests of type tags where they are provably unnecessary (so called soft typing [CF91, WC94]) A remarkable, and to our knowledge unique, aspect of dynamic typing is that it not only permits the removal of dynamic type tag tests, but also allows the elimination of type tagging operations themselves. The purpose and results of our study are two fold. First, while dynamic typing is a very ....
....tag tests, but also allows the elimination of type tagging operations themselves. The purpose and results of our study are two fold. First, while dynamic typing is a very interesting system, it cannot remove as many type checks as other recently proposed algorithms based on inclusion subtyping [AWL94, WC94]. By inclusion subtyping, we mean systems where type t 1 is a subtype of t 2 if t 2 includes every value of t 1 ; we will refer to this simply as subtyping. As noted above, dynamic typing has the singular ability to remove type tagging operations as well as dynamic type checks. Thus, the power of ....
[Article contains additional citation context not shown here]
A. Wright and R. Cartwright. A practical soft typing system for Scheme. In Proceedings of the 1994 ACM Conference on Lisp and Functional Programming, pages 250--262, 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