| V. Breazu-Tannen, C. A. Gunter, and A. Scedrov. Computing with coercions. In LISP and Functional Programming, pages 44--60, 1990. |
....with the factor of slowdown or increase of stack space. 1 Introduction A programming language with subtyping can be translated into a language without subtyping by inserting conversion functions. Previous studies of this interpretation showed only the extensional correctness of the translation [3, 13]. In this paper, we study runtime behavior of the conversion interpretation of subtyping in call by value evaluation. We show that this translation preserves execution time and stack space within a factor determined by the types in a program, if subtyping relation is a partial order. The ....
V. Breazu-Tannen, C. A. Gunter, and A. Scedrov. Computing with coercions. In Proceedings of the 1990.
No context found.
V. Breazu-Tannen, C. A. Gunter, and A. Scedrov. Computing with coercions. In LISP and Functional Programming, pages 44--60, 1990.
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