Naoki Kobayashi (-tokyo.ac.jp) Department of Information Science,...  Home/Search
Context Related
| yl.is.s.utokyo.ac.jp/...UVEHOSC.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: kb.cs.titech.ac.jp...publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Useless-variable elimination is a transformation that eliminates variables whose values contribute nothing to the final outcome of a computation. We present a type-based method for useless-variable elimination and prove its correctness. The algorithm is a surprisingly simple extension of the usual type-reconstruction algorithm. Our method has several attractive features. First, it is simple, so that the proof of the correctness is clear and the method can be easily extended to deal with a... (Update)
Cited by: More
A Type System for Parallelization - Dana Xu Siau-Cheng (Correct)
Useless-Code Elimination and Program Slicing for the Pi-Calculus - Kobayashi (2003) (Correct)
Simple Relational Correctness Proofs for Static Analyses and.. - Benton (2004) (Correct)
Similar documents (at the sentence level):
16.5%: Type-Based Useless Variable Elimination - Kobayashi (1999) (Correct)
Active bibliography (related documents): More All
0.4: Dependence Analysis Through Type Inference - Hafizogullari, Kreitz (1999) (Correct)
0.4: Detecting and Removing Dead Code using Rank 2 Intersection - Damiani, Prost (1997) (Correct)
0.3: Static Analysis of Communication for Asynchronous Concurrent.. - Kobayashi (1995) (Correct)
Similar documents based on text: More All
0.3: Static Analysis on Communication for Asynchronous.. - Kobayashi, Nakade.. (1995) (Correct)
0.2: Control in Parallel Constraint Logic Programming - Naoki Kobayashi Koba (1991) (Correct)
0.2: Quasi-Linear Types - Kobayashi (1999) (Correct)
Related documents from co-citation: More All
11: Constraint systems for useless variable elimination - Wand, Siveroni - 1999
7: A Core Calculus of Dependency - Abadi, Banerjee et al. - 1999
4: Useless-code Detection and Elimination for PCF with Algebraic Datatypes (context) - Damiani - 1999
BibTeX entry: (Update)
Naoki Kobayashi. Type-based useless variable elimination. Technical Report TR99-02, Department of Information Science, University of Tokyo, 1999. Submitted for publication. http://citeseer.ist.psu.edu/kobayashi99typebased.html More
@inproceedings{ kobayashi00typebased,
author = "Naoki Kobayashi",
title = "Type-Based Useless Variable Elimination",
booktitle = "Partial Evaluation and Semantic-Based Program Manipulation",
pages = "84-93",
year = "2000",
url = "citeseer.ist.psu.edu/kobayashi99typebased.html" }
Citations (may not include all citations):1074 The Definition of Standard ML (context) - Milner, Tofte et al. - 1997
229 Foundations for Programming Languages (context) - Mitchell - 1996
176 Control-Flow Analysis of Higher-Order Languages (context) - Shivers - 1991
126 Type Inference with Polymorphic Recursion - Henglein - 1993
88 A Type System Equivalent to Flow Analysis - Palsberg, O'Keefe - 1995
78 Efficiency of a good but not linear set union algorithm (context) - Tarjan - 1975
53 Control-Flow Analysis and Type Systems - Heintze - 1995
51 Linear Unification (context) - Paterson, Wegman - 1978
47 Program Specialization via Program Slicing - Reps, Turnidge - 1996
34 From Polyvariant Flow Information to Intersection and Union .. - Palsberg, Pavlopoulou - 1998
34 Linear-time Subtransitive Control Flow Analysis - Heintze, McAllester - 1997
32 Unification and ML Type Reconstruction - Kanellakis, Mairson et al. - 1991
27 Proofs about a Folklore Let-Polymorphic Type Inference Algor.. - Lee, Yi - 1998
24 Constraint Systems for Useless Variable Elimination - Wand, Siveroni - 1999
23 Redundant Argument Filtering of Logic Programs - Leuschel, Srensen - 1996
19 the Cubic Bottleneck in Subtyping and Flow Analysis - Heintze, McAllester - 1997
16 Collecting More Garbage - Fradet - 1994
15 Lambda-Dropping: Transforming Recursive Equations into Progr.. - Danvy, Schultz - 2000
11 Semi-unification (context) - Kapur, Musser et al. - 1991
10 Polymorphic Splitting: An Effective Polyvariant Flow Analysi.. - Wright, Jagannathan - 1998
9 Equality-based flow analysis versus recursive types - Palsberg - 1998
8 Types, Abstraction and Parametric Polymorphism (context) - Reynolds - 1983
6 Implementation of the call-by-value lambdacalculus using a s.. (context) - Tofte, Talpin - 1994
6 Pruning Simply Typed Lambda-Terms (context) - Berardi - 1996
6 Non-standard type inference for functional programs (context) - Damiani - 1998
4 Refinement Types for Program Analysis (context) - Coppo, Damiani et al. - 1996
4 Type Systems and Algorithms for Useless-Variable Elimination (context) - Fischbach, Hannan - 1999
3 Polymorphic type, region and effect inference - Talpin - 1992
3 Formal Description for Collecting Reachable Garbage via Dyna.. - Hosoya, Yonezawa - 1998
1 Types for 0, 1 or Many Uses (context) - Mogensen - 1998
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.kb.cs.titech.ac.jp/~kobayasi/publications.html): More
Time Regions and Effects for Resource Usage Analysis - Kobayashi (2003) (Correct)
Type-Based Information Flow Analysis for Low-Level Languages - Kobayashi, Shirane (2002) (Correct)
Distributed Concurrent Linear Logic Programming - Kobayashi, Shimizu, Yonezawa (Correct)
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