Martin Elsman. Polymorphic equality---no tags required. In Second International Workshop on Types in Compilation (TIC'98), March 1998. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Type-Directed Specialization of Polymorphism - Ohori (1999) (Correct)
....our formalism does not require such a restriction. The value denoted by attribute type P k ( can be any value as far as it is statically computed. With this extension, our formalism can deal with less uniform polymorphic primitives, such as those handled by intensional polymorphism. Elsman [9] has recently developed a compilation method for tag free polymorphic equality based on a mechanism similar to that of [31] His system can be regarded as an instance of the framework presented here with this extension. Other Type Passing Calculi. Recently, Minamide [25] have developed an ....
M. Elsman. Polymorphic equality - no tags required. In Proceedings of the 2nd International Workshop on Types in Compilation, Kyoto, March 1998.
Type Directed Specialization of Polymorphism - Ohori (1999) (Correct)
....(I 2 y) PEQ ( 1 2 2 ) Here, eq b is the primitive equality function on base type b, and we have used product patter in lambda abstraction. Using this attribute judgment, we can translate the above equality typing as 1 In revising this paper, the author noticed that Elsman s recent work [6] proposed a compilation method for polymorphic equality based on a mechanism similar to that of [26] as described here. follows. Eq) K; A;T C : 2 K : EQ A eq : P EQ ( K; T Eq(C; eq) bool The evaluation of Eq(C; eq) can be implemented by (eq C) We believe that other ....
M. Elsman. Polymorphic equality - no tags required. In Proceedings of the 2nd International Workshop on Types in Compilation, Kyoto, March 1989.
Type-Specialized Serialization with Sharing - Martin Elsman Mael (2004) Self-citation (Elsman) (Correct)
No context found.
Martin Elsman. Polymorphic equality---no tags required. In Second International Workshop on Types in Compilation (TIC'98), March 1998.
Combining Region Inference and Garbage Collection - Hallenberg, Elsman, Tofte (2002) (5 citations) Self-citation (Elsman) (Correct)
....An optimizer rewrites LambdaExp fragments as long as it can guarantee that the resulting fragments run in less space than the original fragments. Optimizations include function inlining, specialization of recursive functions, unboxing of function arguments, and elimination of polymorphic equality [6]. Region inference. In this phase, LambdaExp fragments are translated into a language RegionExp in which memory directives are explicit [17] Region representation inference. Regions are divided into finite and infinite regions based on a static approximation to the number of values that ....
.... that tagging adds a substantial cost to execution time (t r t rt ) and to memory usage (m r m rt ) For programs where lists and reals account for the majority of the memory usage, the memory overhead of tagging is close to 50 percent, due to the value tags in allocated pair and real values [6]. 4.2 Effect of Region Inference onGarbage Collection Table 2 demonstrates the e#ect of region inference on garbage collection. First, the table shows dramatic savings in number of garbage collections when enabling region inference (i.e. #GC rgt #GC gt ) Second, for most of the benchmark ....
Martin Elsman. Polymorphic equality---no tags required. In Second International Workshop on Types in Compilation, March 1998.
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